./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/sum_25x0-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c 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_25x0-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 59acfc6d5178664a3f2144603274c2b6e876292a ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 17:30:19,990 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:30:19,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:30:20,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:30:20,010 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:30:20,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:30:20,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:30:20,027 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:30:20,029 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:30:20,031 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:30:20,032 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:30:20,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:30:20,035 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:30:20,039 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:30:20,040 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:30:20,042 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:30:20,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:30:20,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:30:20,050 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:30:20,054 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:30:20,059 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:30:20,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:30:20,063 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:30:20,065 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:30:20,068 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:30:20,069 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:30:20,069 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:30:20,071 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:30:20,071 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:30:20,073 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:30:20,073 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:30:20,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:30:20,074 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:30:20,075 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:30:20,077 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:30:20,077 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:30:20,078 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:30:20,079 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:30:20,079 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:30:20,082 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:30:20,083 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:30:20,084 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:30:20,107 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:30:20,107 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:30:20,109 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:30:20,109 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:30:20,109 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:30:20,110 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:30:20,110 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:30:20,110 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:30:20,111 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:30:20,111 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:30:20,112 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:30:20,113 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:30:20,113 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:30:20,113 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:30:20,114 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:30:20,114 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:30:20,114 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:30:20,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:30:20,115 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:30:20,115 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:30:20,115 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:30:20,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:30:20,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:30:20,116 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:30:20,117 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:30:20,117 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:30:20,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:30:20,117 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:30:20,118 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:30:20,118 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 -> 59acfc6d5178664a3f2144603274c2b6e876292a [2019-11-28 17:30:20,431 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:30:20,452 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:30:20,456 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:30:20,457 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:30:20,458 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:30:20,459 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/sum_25x0-2.c [2019-11-28 17:30:20,528 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cccf936d7/611b8ea244c74c9d8bfb8583990f07ea/FLAG28b5c1438 [2019-11-28 17:30:20,961 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:30:20,962 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_25x0-2.c [2019-11-28 17:30:20,967 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cccf936d7/611b8ea244c74c9d8bfb8583990f07ea/FLAG28b5c1438 [2019-11-28 17:30:21,350 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cccf936d7/611b8ea244c74c9d8bfb8583990f07ea [2019-11-28 17:30:21,353 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:30:21,355 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:30:21,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:30:21,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:30:21,360 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:30:21,361 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:30:21" (1/1) ... [2019-11-28 17:30:21,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22ceee9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:30:21, skipping insertion in model container [2019-11-28 17:30:21,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:30:21" (1/1) ... [2019-11-28 17:30:21,371 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:30:21,389 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:30:21,603 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:30:21,609 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:30:21,629 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:30:21,643 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:30:21,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:30:21 WrapperNode [2019-11-28 17:30:21,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:30:21,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:30:21,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:30:21,646 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:30:21,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:30:21" (1/1) ... [2019-11-28 17:30:21,663 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:30:21" (1/1) ... [2019-11-28 17:30:21,682 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:30:21,682 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:30:21,682 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:30:21,682 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:30:21,784 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:30:21" (1/1) ... [2019-11-28 17:30:21,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:30:21" (1/1) ... [2019-11-28 17:30:21,785 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:30:21" (1/1) ... [2019-11-28 17:30:21,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:30:21" (1/1) ... [2019-11-28 17:30:21,788 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:30:21" (1/1) ... [2019-11-28 17:30:21,790 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:30:21" (1/1) ... [2019-11-28 17:30:21,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:30:21" (1/1) ... [2019-11-28 17:30:21,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:30:21,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:30:21,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:30:21,793 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:30:21,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:30:21" (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-28 17:30:21,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:30:21,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:30:21,859 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2019-11-28 17:30:21,860 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2019-11-28 17:30:22,016 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:30:22,017 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 17:30:22,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:30:22 BoogieIcfgContainer [2019-11-28 17:30:22,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:30:22,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:30:22,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:30:22,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:30:22,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:30:21" (1/3) ... [2019-11-28 17:30:22,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c092f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:30:22, skipping insertion in model container [2019-11-28 17:30:22,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:30:21" (2/3) ... [2019-11-28 17:30:22,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c092f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:30:22, skipping insertion in model container [2019-11-28 17:30:22,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:30:22" (3/3) ... [2019-11-28 17:30:22,026 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_25x0-2.c [2019-11-28 17:30:22,035 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:30:22,042 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 17:30:22,054 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 17:30:22,077 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:30:22,077 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:30:22,078 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:30:22,078 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:30:22,078 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:30:22,078 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:30:22,078 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:30:22,078 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:30:22,095 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-11-28 17:30:22,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 17:30:22,101 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:22,102 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:22,102 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:22,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:22,107 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2019-11-28 17:30:22,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:22,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817506404] [2019-11-28 17:30:22,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:22,452 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-28 17:30:22,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817506404] [2019-11-28 17:30:22,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:30:22,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 17:30:22,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302774856] [2019-11-28 17:30:22,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 17:30:22,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:22,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 17:30:22,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:30:22,477 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 7 states. [2019-11-28 17:30:22,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:22,580 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-11-28 17:30:22,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:30:22,583 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-11-28 17:30:22,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:22,595 INFO L225 Difference]: With dead ends: 24 [2019-11-28 17:30:22,596 INFO L226 Difference]: Without dead ends: 14 [2019-11-28 17:30:22,601 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-28 17:30:22,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-28 17:30:22,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-28 17:30:22,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-28 17:30:22,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-11-28 17:30:22,648 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-11-28 17:30:22,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:22,649 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-11-28 17:30:22,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 17:30:22,650 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-11-28 17:30:22,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 17:30:22,651 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:22,651 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:22,651 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:22,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:22,652 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2019-11-28 17:30:22,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:22,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830469034] [2019-11-28 17:30:22,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:22,815 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-28 17:30:22,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830469034] [2019-11-28 17:30:22,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943575488] [2019-11-28 17:30:22,816 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-28 17:30:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:22,856 INFO L264 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 17:30:22,862 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:22,923 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-28 17:30:22,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:22,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-11-28 17:30:22,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057937463] [2019-11-28 17:30:22,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 17:30:22,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:22,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 17:30:22,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 17:30:22,937 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 9 states. [2019-11-28 17:30:23,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:23,036 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-11-28 17:30:23,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:30:23,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-11-28 17:30:23,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:23,038 INFO L225 Difference]: With dead ends: 21 [2019-11-28 17:30:23,038 INFO L226 Difference]: Without dead ends: 17 [2019-11-28 17:30:23,040 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-28 17:30:23,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-28 17:30:23,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 17:30:23,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 17:30:23,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-11-28 17:30:23,051 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-11-28 17:30:23,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:23,051 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-28 17:30:23,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 17:30:23,052 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-11-28 17:30:23,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 17:30:23,055 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:23,055 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:23,256 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:23,257 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:23,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:23,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2019-11-28 17:30:23,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:23,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356433577] [2019-11-28 17:30:23,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:23,460 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-28 17:30:23,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356433577] [2019-11-28 17:30:23,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615315308] [2019-11-28 17:30:23,462 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-28 17:30:23,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:30:23,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:23,504 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 17:30:23,507 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:23,532 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-28 17:30:23,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:23,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2019-11-28 17:30:23,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842930550] [2019-11-28 17:30:23,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 17:30:23,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:23,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 17:30:23,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 17:30:23,535 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 10 states. [2019-11-28 17:30:23,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:23,627 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-11-28 17:30:23,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 17:30:23,627 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-28 17:30:23,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:23,629 INFO L225 Difference]: With dead ends: 24 [2019-11-28 17:30:23,629 INFO L226 Difference]: Without dead ends: 20 [2019-11-28 17:30:23,629 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-28 17:30:23,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-28 17:30:23,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-28 17:30:23,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 17:30:23,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-11-28 17:30:23,639 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2019-11-28 17:30:23,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:23,640 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-11-28 17:30:23,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 17:30:23,640 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-11-28 17:30:23,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 17:30:23,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:23,643 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:23,846 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:23,847 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:23,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:23,847 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2019-11-28 17:30:23,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:23,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188586134] [2019-11-28 17:30:23,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:24,079 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-28 17:30:24,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188586134] [2019-11-28 17:30:24,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299699942] [2019-11-28 17:30:24,081 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-28 17:30:24,121 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 17:30:24,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:24,123 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 17:30:24,128 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:24,163 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-28 17:30:24,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:24,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2019-11-28 17:30:24,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033826378] [2019-11-28 17:30:24,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 17:30:24,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:24,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 17:30:24,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-28 17:30:24,166 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 11 states. [2019-11-28 17:30:24,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:24,270 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-11-28 17:30:24,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:30:24,271 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-11-28 17:30:24,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:24,272 INFO L225 Difference]: With dead ends: 27 [2019-11-28 17:30:24,273 INFO L226 Difference]: Without dead ends: 23 [2019-11-28 17:30:24,273 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-28 17:30:24,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-28 17:30:24,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-28 17:30:24,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 17:30:24,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-11-28 17:30:24,280 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2019-11-28 17:30:24,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:24,280 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-28 17:30:24,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 17:30:24,281 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-11-28 17:30:24,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 17:30:24,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:24,282 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:24,483 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:24,483 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:24,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:24,484 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2019-11-28 17:30:24,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:24,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951736088] [2019-11-28 17:30:24,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:24,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-28 17:30:24,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951736088] [2019-11-28 17:30:24,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56917459] [2019-11-28 17:30:24,699 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-28 17:30:24,742 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 17:30:24,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:24,744 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 17:30:24,747 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:24,782 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-28 17:30:24,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:24,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 12 [2019-11-28 17:30:24,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66452979] [2019-11-28 17:30:24,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 17:30:24,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:24,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 17:30:24,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-28 17:30:24,791 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-11-28 17:30:24,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:24,912 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-11-28 17:30:24,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:30:24,913 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-11-28 17:30:24,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:24,914 INFO L225 Difference]: With dead ends: 30 [2019-11-28 17:30:24,914 INFO L226 Difference]: Without dead ends: 26 [2019-11-28 17:30:24,915 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-28 17:30:24,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-28 17:30:24,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-28 17:30:24,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 17:30:24,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-11-28 17:30:24,922 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2019-11-28 17:30:24,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:24,922 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-11-28 17:30:24,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 17:30:24,923 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-11-28 17:30:24,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 17:30:24,924 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:24,925 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:25,127 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:25,128 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:25,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:25,128 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2019-11-28 17:30:25,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:25,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290902614] [2019-11-28 17:30:25,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:25,367 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-28 17:30:25,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290902614] [2019-11-28 17:30:25,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463312537] [2019-11-28 17:30:25,368 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-28 17:30:25,412 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-28 17:30:25,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:25,413 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 17:30:25,416 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:25,457 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-28 17:30:25,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:25,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2019-11-28 17:30:25,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333604562] [2019-11-28 17:30:25,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 17:30:25,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:25,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 17:30:25,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-28 17:30:25,459 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 13 states. [2019-11-28 17:30:25,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:25,622 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-11-28 17:30:25,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 17:30:25,622 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2019-11-28 17:30:25,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:25,623 INFO L225 Difference]: With dead ends: 33 [2019-11-28 17:30:25,624 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 17:30:25,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-11-28 17:30:25,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 17:30:25,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-28 17:30:25,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 17:30:25,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-11-28 17:30:25,631 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2019-11-28 17:30:25,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:25,631 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-11-28 17:30:25,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 17:30:25,631 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-11-28 17:30:25,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 17:30:25,633 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:25,633 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:25,839 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:25,840 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:25,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:25,840 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2019-11-28 17:30:25,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:25,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564791474] [2019-11-28 17:30:25,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:25,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:26,111 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-28 17:30:26,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564791474] [2019-11-28 17:30:26,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751328274] [2019-11-28 17:30:26,112 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-28 17:30:26,159 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-28 17:30:26,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:26,160 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 17:30:26,163 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:26,225 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-28 17:30:26,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:26,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2019-11-28 17:30:26,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279283759] [2019-11-28 17:30:26,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 17:30:26,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:26,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 17:30:26,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-28 17:30:26,229 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 14 states. [2019-11-28 17:30:26,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:26,358 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-11-28 17:30:26,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 17:30:26,359 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2019-11-28 17:30:26,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:26,360 INFO L225 Difference]: With dead ends: 36 [2019-11-28 17:30:26,360 INFO L226 Difference]: Without dead ends: 32 [2019-11-28 17:30:26,361 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-28 17:30:26,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-28 17:30:26,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-28 17:30:26,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 17:30:26,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-11-28 17:30:26,367 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2019-11-28 17:30:26,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:26,367 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-11-28 17:30:26,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 17:30:26,367 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-11-28 17:30:26,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 17:30:26,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:26,369 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:26,582 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:26,583 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:26,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:26,584 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2019-11-28 17:30:26,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:26,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817728769] [2019-11-28 17:30:26,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:26,816 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-28 17:30:26,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817728769] [2019-11-28 17:30:26,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031925895] [2019-11-28 17:30:26,817 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-28 17:30:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:26,865 INFO L264 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 17:30:26,868 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:26,914 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-28 17:30:26,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:26,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 15 [2019-11-28 17:30:26,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653220915] [2019-11-28 17:30:26,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 17:30:26,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:26,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 17:30:26,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-11-28 17:30:26,917 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 15 states. [2019-11-28 17:30:27,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:27,053 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-11-28 17:30:27,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 17:30:27,053 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2019-11-28 17:30:27,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:27,054 INFO L225 Difference]: With dead ends: 39 [2019-11-28 17:30:27,054 INFO L226 Difference]: Without dead ends: 35 [2019-11-28 17:30:27,056 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-28 17:30:27,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-28 17:30:27,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-11-28 17:30:27,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 17:30:27,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-11-28 17:30:27,061 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2019-11-28 17:30:27,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:27,062 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-11-28 17:30:27,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 17:30:27,062 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-11-28 17:30:27,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-28 17:30:27,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:27,064 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:27,267 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:27,270 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:27,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:27,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2019-11-28 17:30:27,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:27,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111413104] [2019-11-28 17:30:27,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:27,588 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-28 17:30:27,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111413104] [2019-11-28 17:30:27,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764794149] [2019-11-28 17:30:27,590 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-28 17:30:27,648 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:30:27,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:27,649 INFO L264 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-28 17:30:27,660 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:27,710 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-28 17:30:27,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:27,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 16 [2019-11-28 17:30:27,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448477374] [2019-11-28 17:30:27,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 17:30:27,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:27,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 17:30:27,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-11-28 17:30:27,716 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 16 states. [2019-11-28 17:30:27,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:27,865 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-11-28 17:30:27,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 17:30:27,866 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 57 [2019-11-28 17:30:27,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:27,867 INFO L225 Difference]: With dead ends: 42 [2019-11-28 17:30:27,867 INFO L226 Difference]: Without dead ends: 38 [2019-11-28 17:30:27,868 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-28 17:30:27,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-28 17:30:27,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-28 17:30:27,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 17:30:27,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-11-28 17:30:27,874 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2019-11-28 17:30:27,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:27,874 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-11-28 17:30:27,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 17:30:27,874 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-11-28 17:30:27,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 17:30:27,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:27,876 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:28,079 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:28,080 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:28,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:28,080 INFO L82 PathProgramCache]: Analyzing trace with hash -2055304301, now seen corresponding path program 9 times [2019-11-28 17:30:28,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:28,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646362075] [2019-11-28 17:30:28,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:28,387 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-28 17:30:28,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646362075] [2019-11-28 17:30:28,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959554536] [2019-11-28 17:30:28,388 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-28 17:30:28,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-28 17:30:28,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:28,454 INFO L264 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 17:30:28,468 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:28,521 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-28 17:30:28,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:28,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 17 [2019-11-28 17:30:28,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473568180] [2019-11-28 17:30:28,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 17:30:28,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:28,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 17:30:28,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-11-28 17:30:28,525 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 17 states. [2019-11-28 17:30:28,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:28,719 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-11-28 17:30:28,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 17:30:28,719 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 63 [2019-11-28 17:30:28,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:28,720 INFO L225 Difference]: With dead ends: 45 [2019-11-28 17:30:28,720 INFO L226 Difference]: Without dead ends: 41 [2019-11-28 17:30:28,721 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-28 17:30:28,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-28 17:30:28,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-28 17:30:28,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 17:30:28,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-11-28 17:30:28,727 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2019-11-28 17:30:28,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:28,728 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-11-28 17:30:28,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 17:30:28,728 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-11-28 17:30:28,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-28 17:30:28,729 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:28,729 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:28,933 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:28,933 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:28,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:28,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1172322647, now seen corresponding path program 10 times [2019-11-28 17:30:28,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:28,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113171438] [2019-11-28 17:30:28,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:29,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:29,306 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-28 17:30:29,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113171438] [2019-11-28 17:30:29,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565254548] [2019-11-28 17:30:29,307 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-28 17:30:29,365 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 17:30:29,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:29,366 INFO L264 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 17:30:29,369 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:29,424 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-28 17:30:29,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:29,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 18 [2019-11-28 17:30:29,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371389964] [2019-11-28 17:30:29,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 17:30:29,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:29,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 17:30:29,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-11-28 17:30:29,427 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 18 states. [2019-11-28 17:30:29,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:29,584 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-11-28 17:30:29,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 17:30:29,584 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 69 [2019-11-28 17:30:29,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:29,585 INFO L225 Difference]: With dead ends: 48 [2019-11-28 17:30:29,586 INFO L226 Difference]: Without dead ends: 44 [2019-11-28 17:30:29,587 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-28 17:30:29,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-28 17:30:29,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-28 17:30:29,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-28 17:30:29,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-11-28 17:30:29,592 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2019-11-28 17:30:29,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:29,593 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-11-28 17:30:29,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 17:30:29,593 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-11-28 17:30:29,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-28 17:30:29,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:29,594 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:29,805 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:29,806 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:29,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:29,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1452916077, now seen corresponding path program 11 times [2019-11-28 17:30:29,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:29,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687990168] [2019-11-28 17:30:29,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:30,255 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-28 17:30:30,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687990168] [2019-11-28 17:30:30,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471800367] [2019-11-28 17:30:30,256 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-28 17:30:30,327 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-11-28 17:30:30,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:30,330 INFO L264 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-28 17:30:30,333 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:30,394 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-28 17:30:30,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:30,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 19 [2019-11-28 17:30:30,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570086351] [2019-11-28 17:30:30,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 17:30:30,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:30,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 17:30:30,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2019-11-28 17:30:30,398 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 19 states. [2019-11-28 17:30:30,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:30,603 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-11-28 17:30:30,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 17:30:30,604 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2019-11-28 17:30:30,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:30,605 INFO L225 Difference]: With dead ends: 51 [2019-11-28 17:30:30,605 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 17:30:30,606 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-28 17:30:30,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 17:30:30,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-28 17:30:30,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 17:30:30,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-11-28 17:30:30,612 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2019-11-28 17:30:30,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:30,613 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-11-28 17:30:30,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 17:30:30,613 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-11-28 17:30:30,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-28 17:30:30,614 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:30,614 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:30,815 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:30,815 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:30,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:30,816 INFO L82 PathProgramCache]: Analyzing trace with hash -461124311, now seen corresponding path program 12 times [2019-11-28 17:30:30,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:30,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828528608] [2019-11-28 17:30:30,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:31,296 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-28 17:30:31,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828528608] [2019-11-28 17:30:31,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382324673] [2019-11-28 17:30:31,297 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-28 17:30:31,360 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-11-28 17:30:31,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:31,362 INFO L264 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-28 17:30:31,365 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:31,405 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-28 17:30:31,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:31,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 20 [2019-11-28 17:30:31,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758494720] [2019-11-28 17:30:31,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-28 17:30:31,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:31,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-28 17:30:31,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-11-28 17:30:31,407 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 20 states. [2019-11-28 17:30:31,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:31,628 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-11-28 17:30:31,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 17:30:31,628 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 81 [2019-11-28 17:30:31,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:31,629 INFO L225 Difference]: With dead ends: 54 [2019-11-28 17:30:31,629 INFO L226 Difference]: Without dead ends: 50 [2019-11-28 17:30:31,631 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-28 17:30:31,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-28 17:30:31,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-11-28 17:30:31,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 17:30:31,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-11-28 17:30:31,636 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2019-11-28 17:30:31,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:31,637 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-11-28 17:30:31,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-28 17:30:31,637 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-11-28 17:30:31,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-28 17:30:31,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:31,639 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:31,843 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:31,843 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:31,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:31,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1887065709, now seen corresponding path program 13 times [2019-11-28 17:30:31,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:31,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355650974] [2019-11-28 17:30:31,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:32,325 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-28 17:30:32,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355650974] [2019-11-28 17:30:32,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545631537] [2019-11-28 17:30:32,330 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-28 17:30:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:32,397 INFO L264 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-28 17:30:32,399 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:32,455 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-28 17:30:32,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:32,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 21 [2019-11-28 17:30:32,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991261886] [2019-11-28 17:30:32,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 17:30:32,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:32,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 17:30:32,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2019-11-28 17:30:32,461 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 21 states. [2019-11-28 17:30:32,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:32,719 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-11-28 17:30:32,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 17:30:32,720 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 87 [2019-11-28 17:30:32,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:32,721 INFO L225 Difference]: With dead ends: 57 [2019-11-28 17:30:32,721 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 17:30:32,722 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-28 17:30:32,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 17:30:32,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-28 17:30:32,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 17:30:32,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-11-28 17:30:32,730 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2019-11-28 17:30:32,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:32,731 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-11-28 17:30:32,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 17:30:32,731 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-11-28 17:30:32,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-28 17:30:32,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:32,733 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:32,937 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:32,937 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:32,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:32,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1777212503, now seen corresponding path program 14 times [2019-11-28 17:30:32,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:32,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228519032] [2019-11-28 17:30:32,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:32,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:33,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:33,519 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-28 17:30:33,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228519032] [2019-11-28 17:30:33,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138795197] [2019-11-28 17:30:33,520 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-28 17:30:33,569 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:30:33,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:33,571 INFO L264 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-28 17:30:33,573 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:33,616 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-28 17:30:33,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:33,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 22 [2019-11-28 17:30:33,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955557472] [2019-11-28 17:30:33,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-28 17:30:33,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:33,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-28 17:30:33,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2019-11-28 17:30:33,618 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 22 states. [2019-11-28 17:30:33,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:33,833 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-11-28 17:30:33,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 17:30:33,834 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 93 [2019-11-28 17:30:33,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:33,835 INFO L225 Difference]: With dead ends: 60 [2019-11-28 17:30:33,835 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 17:30:33,836 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-28 17:30:33,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 17:30:33,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-28 17:30:33,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-28 17:30:33,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-11-28 17:30:33,851 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2019-11-28 17:30:33,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:33,853 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-11-28 17:30:33,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-28 17:30:33,853 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-11-28 17:30:33,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-28 17:30:33,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:33,855 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:34,055 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:34,056 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:34,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:34,056 INFO L82 PathProgramCache]: Analyzing trace with hash -948911981, now seen corresponding path program 15 times [2019-11-28 17:30:34,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:34,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474130461] [2019-11-28 17:30:34,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:34,594 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-28 17:30:34,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474130461] [2019-11-28 17:30:34,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743536803] [2019-11-28 17:30:34,594 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-28 17:30:34,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-11-28 17:30:34,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:34,664 INFO L264 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-28 17:30:34,666 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:34,712 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-28 17:30:34,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:34,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 23 [2019-11-28 17:30:34,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379555991] [2019-11-28 17:30:34,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-28 17:30:34,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:34,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 17:30:34,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2019-11-28 17:30:34,715 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 23 states. [2019-11-28 17:30:34,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:34,999 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-11-28 17:30:35,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 17:30:35,000 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 99 [2019-11-28 17:30:35,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:35,001 INFO L225 Difference]: With dead ends: 63 [2019-11-28 17:30:35,001 INFO L226 Difference]: Without dead ends: 59 [2019-11-28 17:30:35,002 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-28 17:30:35,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-28 17:30:35,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-28 17:30:35,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-28 17:30:35,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-11-28 17:30:35,008 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 99 [2019-11-28 17:30:35,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:35,008 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-11-28 17:30:35,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-28 17:30:35,009 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-11-28 17:30:35,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-28 17:30:35,010 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:35,010 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:35,214 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:35,214 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:35,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:35,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1159072297, now seen corresponding path program 16 times [2019-11-28 17:30:35,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:35,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125560233] [2019-11-28 17:30:35,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:35,935 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-28 17:30:35,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125560233] [2019-11-28 17:30:35,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543318878] [2019-11-28 17:30:35,937 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-28 17:30:35,998 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 17:30:35,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:36,000 INFO L264 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-28 17:30:36,003 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:36,047 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-28 17:30:36,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:36,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 24 [2019-11-28 17:30:36,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781582477] [2019-11-28 17:30:36,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-28 17:30:36,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:36,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-28 17:30:36,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2019-11-28 17:30:36,057 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 24 states. [2019-11-28 17:30:36,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:36,300 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-11-28 17:30:36,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-28 17:30:36,300 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 105 [2019-11-28 17:30:36,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:36,301 INFO L225 Difference]: With dead ends: 66 [2019-11-28 17:30:36,301 INFO L226 Difference]: Without dead ends: 62 [2019-11-28 17:30:36,303 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=539, Invalid=1101, Unknown=0, NotChecked=0, Total=1640 [2019-11-28 17:30:36,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-28 17:30:36,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-28 17:30:36,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-28 17:30:36,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-11-28 17:30:36,308 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 105 [2019-11-28 17:30:36,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:36,308 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-11-28 17:30:36,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-28 17:30:36,309 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-11-28 17:30:36,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-28 17:30:36,310 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:36,310 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:36,514 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:36,514 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:36,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:36,515 INFO L82 PathProgramCache]: Analyzing trace with hash 2109441939, now seen corresponding path program 17 times [2019-11-28 17:30:36,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:36,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596859266] [2019-11-28 17:30:36,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:36,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:37,118 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-28 17:30:37,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596859266] [2019-11-28 17:30:37,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945906838] [2019-11-28 17:30:37,140 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-28 17:30:37,219 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-11-28 17:30:37,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:37,222 INFO L264 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-28 17:30:37,224 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:37,264 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-28 17:30:37,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:37,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 25 [2019-11-28 17:30:37,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910579100] [2019-11-28 17:30:37,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-28 17:30:37,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:37,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 17:30:37,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=399, Unknown=0, NotChecked=0, Total=600 [2019-11-28 17:30:37,266 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 25 states. [2019-11-28 17:30:37,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:37,576 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-11-28 17:30:37,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 17:30:37,577 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 111 [2019-11-28 17:30:37,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:37,578 INFO L225 Difference]: With dead ends: 69 [2019-11-28 17:30:37,578 INFO L226 Difference]: Without dead ends: 65 [2019-11-28 17:30:37,579 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-28 17:30:37,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-28 17:30:37,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-11-28 17:30:37,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 17:30:37,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-11-28 17:30:37,588 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 111 [2019-11-28 17:30:37,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:37,589 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-11-28 17:30:37,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-28 17:30:37,589 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-11-28 17:30:37,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-28 17:30:37,591 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:37,591 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:37,791 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:37,792 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:37,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:37,792 INFO L82 PathProgramCache]: Analyzing trace with hash 450642089, now seen corresponding path program 18 times [2019-11-28 17:30:37,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:37,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527460882] [2019-11-28 17:30:37,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:38,506 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-28 17:30:38,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527460882] [2019-11-28 17:30:38,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5950503] [2019-11-28 17:30:38,507 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-28 17:30:38,587 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-11-28 17:30:38,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:38,588 INFO L264 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-28 17:30:38,591 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:38,635 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-28 17:30:38,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:38,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 26 [2019-11-28 17:30:38,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929826367] [2019-11-28 17:30:38,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-28 17:30:38,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:38,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-28 17:30:38,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=429, Unknown=0, NotChecked=0, Total=650 [2019-11-28 17:30:38,640 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 26 states. [2019-11-28 17:30:38,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:38,936 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-11-28 17:30:38,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-28 17:30:38,936 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 117 [2019-11-28 17:30:38,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:38,938 INFO L225 Difference]: With dead ends: 72 [2019-11-28 17:30:38,938 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 17:30:38,940 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=658, Invalid=1322, Unknown=0, NotChecked=0, Total=1980 [2019-11-28 17:30:38,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 17:30:38,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-28 17:30:38,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 17:30:38,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-11-28 17:30:38,945 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 117 [2019-11-28 17:30:38,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:38,946 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-11-28 17:30:38,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-28 17:30:38,946 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-11-28 17:30:38,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-28 17:30:38,947 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:38,948 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:39,152 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:39,153 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:39,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:39,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1141244269, now seen corresponding path program 19 times [2019-11-28 17:30:39,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:39,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036881172] [2019-11-28 17:30:39,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:39,963 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-28 17:30:39,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036881172] [2019-11-28 17:30:39,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774526264] [2019-11-28 17:30:39,964 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-28 17:30:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:40,023 INFO L264 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-28 17:30:40,025 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:40,080 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-28 17:30:40,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:40,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 27 [2019-11-28 17:30:40,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591287370] [2019-11-28 17:30:40,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-28 17:30:40,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:40,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-28 17:30:40,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=460, Unknown=0, NotChecked=0, Total=702 [2019-11-28 17:30:40,082 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 27 states. [2019-11-28 17:30:40,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:40,371 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-11-28 17:30:40,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 17:30:40,371 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 123 [2019-11-28 17:30:40,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:40,373 INFO L225 Difference]: With dead ends: 75 [2019-11-28 17:30:40,373 INFO L226 Difference]: Without dead ends: 71 [2019-11-28 17:30:40,374 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-28 17:30:40,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-28 17:30:40,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-28 17:30:40,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-28 17:30:40,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-11-28 17:30:40,381 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 123 [2019-11-28 17:30:40,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:40,382 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-11-28 17:30:40,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-28 17:30:40,382 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-11-28 17:30:40,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-28 17:30:40,383 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:40,383 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:40,587 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:40,587 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:40,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:40,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1280276695, now seen corresponding path program 20 times [2019-11-28 17:30:40,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:40,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732750194] [2019-11-28 17:30:40,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:40,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:41,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-11-28 17:30:41,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732750194] [2019-11-28 17:30:41,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378306151] [2019-11-28 17:30:41,580 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:41,671 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:30:41,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:41,673 INFO L264 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-28 17:30:41,676 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:41,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-11-28 17:30:41,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:41,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 28 [2019-11-28 17:30:41,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228963029] [2019-11-28 17:30:41,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-28 17:30:41,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:41,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-28 17:30:41,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=492, Unknown=0, NotChecked=0, Total=756 [2019-11-28 17:30:41,733 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 28 states. [2019-11-28 17:30:42,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:42,030 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2019-11-28 17:30:42,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-28 17:30:42,030 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 129 [2019-11-28 17:30:42,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:42,031 INFO L225 Difference]: With dead ends: 78 [2019-11-28 17:30:42,031 INFO L226 Difference]: Without dead ends: 74 [2019-11-28 17:30:42,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=789, Invalid=1563, Unknown=0, NotChecked=0, Total=2352 [2019-11-28 17:30:42,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-28 17:30:42,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-28 17:30:42,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-28 17:30:42,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-11-28 17:30:42,046 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 129 [2019-11-28 17:30:42,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:42,047 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-11-28 17:30:42,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-28 17:30:42,047 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-11-28 17:30:42,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-28 17:30:42,048 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:42,049 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:42,252 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:42,252 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:42,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:42,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1463802477, now seen corresponding path program 21 times [2019-11-28 17:30:42,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:42,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314881316] [2019-11-28 17:30:42,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:43,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-11-28 17:30:43,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314881316] [2019-11-28 17:30:43,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710802737] [2019-11-28 17:30:43,220 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:43,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-11-28 17:30:43,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:43,299 INFO L264 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-28 17:30:43,302 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:43,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-11-28 17:30:43,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:43,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 29 [2019-11-28 17:30:43,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976612750] [2019-11-28 17:30:43,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-28 17:30:43,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:43,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-28 17:30:43,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=525, Unknown=0, NotChecked=0, Total=812 [2019-11-28 17:30:43,376 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 29 states. [2019-11-28 17:30:43,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:43,748 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2019-11-28 17:30:43,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-28 17:30:43,748 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 135 [2019-11-28 17:30:43,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:43,749 INFO L225 Difference]: With dead ends: 81 [2019-11-28 17:30:43,749 INFO L226 Difference]: Without dead ends: 77 [2019-11-28 17:30:43,750 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=859, Invalid=1691, Unknown=0, NotChecked=0, Total=2550 [2019-11-28 17:30:43,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-28 17:30:43,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-11-28 17:30:43,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-28 17:30:43,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-11-28 17:30:43,755 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 135 [2019-11-28 17:30:43,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:43,755 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-11-28 17:30:43,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-28 17:30:43,755 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-11-28 17:30:43,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-28 17:30:43,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:43,757 INFO L410 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:43,961 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:43,961 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:43,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:43,962 INFO L82 PathProgramCache]: Analyzing trace with hash -555819607, now seen corresponding path program 22 times [2019-11-28 17:30:43,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:43,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734856497] [2019-11-28 17:30:43,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:45,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-11-28 17:30:45,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734856497] [2019-11-28 17:30:45,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043208561] [2019-11-28 17:30:45,006 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:45,075 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 17:30:45,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:45,077 INFO L264 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-28 17:30:45,079 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:45,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-11-28 17:30:45,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:45,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 30 [2019-11-28 17:30:45,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127747301] [2019-11-28 17:30:45,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-28 17:30:45,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:45,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-28 17:30:45,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=559, Unknown=0, NotChecked=0, Total=870 [2019-11-28 17:30:45,140 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 30 states. [2019-11-28 17:30:45,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:45,523 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2019-11-28 17:30:45,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-28 17:30:45,524 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 141 [2019-11-28 17:30:45,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:45,525 INFO L225 Difference]: With dead ends: 84 [2019-11-28 17:30:45,526 INFO L226 Difference]: Without dead ends: 80 [2019-11-28 17:30:45,527 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=932, Invalid=1824, Unknown=0, NotChecked=0, Total=2756 [2019-11-28 17:30:45,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-28 17:30:45,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-28 17:30:45,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-28 17:30:45,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-11-28 17:30:45,532 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 141 [2019-11-28 17:30:45,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:45,532 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-11-28 17:30:45,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-28 17:30:45,533 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-11-28 17:30:45,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-28 17:30:45,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:45,534 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:45,737 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:45,737 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:45,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:45,738 INFO L82 PathProgramCache]: Analyzing trace with hash -945685357, now seen corresponding path program 23 times [2019-11-28 17:30:45,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:45,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740802986] [2019-11-28 17:30:45,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:46,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:46,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2019-11-28 17:30:46,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740802986] [2019-11-28 17:30:46,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259371518] [2019-11-28 17:30:46,737 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:46,824 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-11-28 17:30:46,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:46,826 INFO L264 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-28 17:30:46,829 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:46,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2019-11-28 17:30:46,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:46,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 31 [2019-11-28 17:30:46,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848213703] [2019-11-28 17:30:46,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-28 17:30:46,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:46,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-28 17:30:46,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=594, Unknown=0, NotChecked=0, Total=930 [2019-11-28 17:30:46,891 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 31 states. [2019-11-28 17:30:47,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:47,245 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2019-11-28 17:30:47,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-28 17:30:47,245 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 147 [2019-11-28 17:30:47,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:47,247 INFO L225 Difference]: With dead ends: 87 [2019-11-28 17:30:47,247 INFO L226 Difference]: Without dead ends: 83 [2019-11-28 17:30:47,248 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1008, Invalid=1962, Unknown=0, NotChecked=0, Total=2970 [2019-11-28 17:30:47,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-28 17:30:47,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-11-28 17:30:47,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-28 17:30:47,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-11-28 17:30:47,253 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 147 [2019-11-28 17:30:47,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:47,254 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-11-28 17:30:47,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-28 17:30:47,254 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-11-28 17:30:47,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-28 17:30:47,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:47,255 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:47,458 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:47,459 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:47,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:47,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1588806697, now seen corresponding path program 24 times [2019-11-28 17:30:47,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:47,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364486994] [2019-11-28 17:30:47,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:47,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:48,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2019-11-28 17:30:48,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364486994] [2019-11-28 17:30:48,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351308809] [2019-11-28 17:30:48,504 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:48,599 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-11-28 17:30:48,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:48,601 INFO L264 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-28 17:30:48,604 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:48,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2019-11-28 17:30:48,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:48,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 32 [2019-11-28 17:30:48,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935945757] [2019-11-28 17:30:48,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-28 17:30:48,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:48,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-28 17:30:48,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2019-11-28 17:30:48,681 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 32 states. [2019-11-28 17:30:49,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:49,083 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2019-11-28 17:30:49,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-28 17:30:49,083 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 153 [2019-11-28 17:30:49,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:49,085 INFO L225 Difference]: With dead ends: 90 [2019-11-28 17:30:49,085 INFO L226 Difference]: Without dead ends: 86 [2019-11-28 17:30:49,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1087, Invalid=2105, Unknown=0, NotChecked=0, Total=3192 [2019-11-28 17:30:49,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-28 17:30:49,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-11-28 17:30:49,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-28 17:30:49,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2019-11-28 17:30:49,091 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 153 [2019-11-28 17:30:49,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:49,091 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2019-11-28 17:30:49,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-28 17:30:49,091 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2019-11-28 17:30:49,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-28 17:30:49,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:49,093 INFO L410 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:49,296 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:49,297 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:49,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:49,297 INFO L82 PathProgramCache]: Analyzing trace with hash 959677331, now seen corresponding path program 25 times [2019-11-28 17:30:49,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:49,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180235105] [2019-11-28 17:30:49,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:30:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:30:49,379 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:30:49,379 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:30:49,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:30:49 BoogieIcfgContainer [2019-11-28 17:30:49,434 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:30:49,435 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:30:49,435 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:30:49,435 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:30:49,435 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:30:22" (3/4) ... [2019-11-28 17:30:49,438 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:30:49,504 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:30:49,505 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:30:49,507 INFO L168 Benchmark]: Toolchain (without parser) took 28151.63 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 691.5 MB). Free memory was 957.7 MB in the beginning and 1.5 GB in the end (delta: -514.7 MB). Peak memory consumption was 176.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:30:49,507 INFO L168 Benchmark]: CDTParser took 0.80 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-28 17:30:49,508 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.09 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:30:49,508 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.40 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:30:49,509 INFO L168 Benchmark]: Boogie Preprocessor took 110.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 946.9 MB in the beginning and 1.2 GB in the end (delta: -209.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:30:49,509 INFO L168 Benchmark]: RCFGBuilder took 225.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-11-28 17:30:49,509 INFO L168 Benchmark]: TraceAbstraction took 27414.78 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 531.6 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -353.1 MB). Peak memory consumption was 178.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:30:49,510 INFO L168 Benchmark]: Witness Printer took 70.21 ms. Allocated memory is still 1.7 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:30:49,512 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.80 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 289.09 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 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 36.40 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 110.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 946.9 MB in the beginning and 1.2 GB in the end (delta: -209.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 225.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27414.78 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 531.6 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -353.1 MB). Peak memory consumption was 178.5 MB. Max. memory is 11.5 GB. * Witness Printer took 70.21 ms. Allocated memory is still 1.7 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. 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 = 25; [L13] int b = 0; [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=25] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=25, m=0, n=25] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=24] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=24, m=1, n=24] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=23] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=23, m=2, n=23] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=22] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=22, m=3, n=22] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=21] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=21, m=4, n=21] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=20] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=20, m=5, n=20] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=19] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=19, m=6, n=19] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=18] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=18, m=7, n=18] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=17] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=17, m=8, n=17] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=16] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=16, m=9, n=16] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=15] [L4] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=15, m=10, n=15] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=14] [L4] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=14, m=11, n=14] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=13] [L4] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=13, m=12, n=13] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=12] [L4] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=12, m=13, n=12] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=11] [L4] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=11, m=14, n=11] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=15, \old(n)=10, m=15, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=16, \old(n)=9, m=16, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=17, \old(n)=8, m=17, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=18, \old(n)=7, m=18, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=19, \old(n)=6, m=19, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=20, \old(n)=5, m=20, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=21, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=21, \old(n)=4, m=21, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=22, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=22, \old(n)=3, m=22, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=23, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=23, \old(n)=2, m=23, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=24, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=24, \old(n)=1, m=24, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=25, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=25, \old(n)=0, \result=25, m=25, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=24, \old(n)=1, m=24, n=1, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=23, \old(n)=2, m=23, n=2, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=22, \old(n)=3, m=22, n=3, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=21, \old(n)=4, m=21, n=4, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=5, m=20, n=5, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=6, m=19, n=6, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=7, m=18, n=7, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=8, m=17, n=8, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=9, m=16, n=9, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=10, m=15, n=10, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=11, m=14, n=11, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=12, m=13, n=12, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=13, m=12, n=13, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=14, m=11, n=14, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=15, m=10, n=15, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=16, m=9, n=16, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=17, m=8, n=17, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=18, m=7, n=18, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=19, m=6, n=19, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=20, m=5, n=20, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=21, m=4, n=21, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=22, m=3, n=22, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=23, m=2, n=23, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=24, m=1, n=24, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=25, m=0, n=25, sum(n - 1, m + 1)=25] [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: 27.3s, OverallIterations: 26, TraceHistogramMax: 26, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 202 SDtfs, 1131 SDslu, 1350 SDs, 0 SdLazy, 1561 SolverSat, 250 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3392 GetRequests, 2618 SyntacticMatches, 0 SemanticMatches, 774 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5200 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=25, 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, 25 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 4200 NumberOfCodeBlocks, 4200 NumberOfCodeBlocksAsserted, 222 NumberOfCheckSat, 3992 ConstructedInterpolants, 0 QuantifiedInterpolants, 1105472 SizeOfPredicates, 348 NumberOfNonLiveVariables, 6096 ConjunctsInSsa, 696 ConjunctsInUnsatCore, 49 InterpolantComputations, 1 PerfectInterpolantSequences, 15000/30000 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...