./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_i20_o20-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab 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/id_i20_o20-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 7d05936c4bb1bb97a4b24ebc11d02c0e844c743b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:25:45,084 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:25:45,087 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:25:45,106 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:25:45,106 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:25:45,108 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:25:45,111 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:25:45,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:25:45,126 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:25:45,130 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:25:45,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:25:45,133 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:25:45,134 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:25:45,137 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:25:45,139 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:25:45,140 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:25:45,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:25:45,143 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:25:45,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:25:45,150 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:25:45,154 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:25:45,159 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:25:45,160 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:25:45,162 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:25:45,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:25:45,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:25:45,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:25:45,167 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:25:45,167 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:25:45,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:25:45,168 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:25:45,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:25:45,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:25:45,171 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:25:45,173 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:25:45,173 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:25:45,174 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:25:45,175 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:25:45,175 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:25:45,176 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:25:45,178 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:25:45,179 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:25:45,209 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:25:45,216 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:25:45,217 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:25:45,217 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:25:45,218 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:25:45,218 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:25:45,218 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:25:45,218 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:25:45,219 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:25:45,222 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:25:45,222 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:25:45,222 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:25:45,223 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:25:45,223 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:25:45,223 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:25:45,223 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:25:45,223 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:25:45,224 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:25:45,224 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:25:45,224 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:25:45,224 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:25:45,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:25:45,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:25:45,228 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:25:45,228 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:25:45,228 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:25:45,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:25:45,229 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:25:45,229 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 -> 7d05936c4bb1bb97a4b24ebc11d02c0e844c743b [2019-11-28 00:25:45,515 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:25:45,526 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:25:45,530 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:25:45,531 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:25:45,531 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:25:45,533 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i20_o20-2.c [2019-11-28 00:25:45,603 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/485418d42/eb510d652ab64649894ab7af44f02bb3/FLAG49ba57ee1 [2019-11-28 00:25:46,045 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:25:46,045 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i20_o20-2.c [2019-11-28 00:25:46,050 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/485418d42/eb510d652ab64649894ab7af44f02bb3/FLAG49ba57ee1 [2019-11-28 00:25:46,408 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/485418d42/eb510d652ab64649894ab7af44f02bb3 [2019-11-28 00:25:46,412 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:25:46,413 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:25:46,414 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:25:46,414 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:25:46,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:25:46,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:25:46" (1/1) ... [2019-11-28 00:25:46,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5323c1a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:46, skipping insertion in model container [2019-11-28 00:25:46,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:25:46" (1/1) ... [2019-11-28 00:25:46,430 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:25:46,449 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:25:46,666 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:25:46,673 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:25:46,692 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:25:46,711 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:25:46,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:46 WrapperNode [2019-11-28 00:25:46,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:25:46,713 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:25:46,713 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:25:46,713 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:25:46,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:46" (1/1) ... [2019-11-28 00:25:46,729 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:46" (1/1) ... [2019-11-28 00:25:46,749 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:25:46,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:25:46,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:25:46,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:25:46,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:46" (1/1) ... [2019-11-28 00:25:46,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:46" (1/1) ... [2019-11-28 00:25:46,817 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:46" (1/1) ... [2019-11-28 00:25:46,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:46" (1/1) ... [2019-11-28 00:25:46,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:46" (1/1) ... [2019-11-28 00:25:46,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:46" (1/1) ... [2019-11-28 00:25:46,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:46" (1/1) ... [2019-11-28 00:25:46,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:25:46,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:25:46,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:25:46,824 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:25:46,825 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:46" (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 00:25:46,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:25:46,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:25:46,888 INFO L130 BoogieDeclarations]: Found specification of procedure id [2019-11-28 00:25:46,888 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2019-11-28 00:25:47,042 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:25:47,042 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 00:25:47,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:47 BoogieIcfgContainer [2019-11-28 00:25:47,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:25:47,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:25:47,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:25:47,047 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:25:47,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:25:46" (1/3) ... [2019-11-28 00:25:47,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a7762b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:25:47, skipping insertion in model container [2019-11-28 00:25:47,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:46" (2/3) ... [2019-11-28 00:25:47,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a7762b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:25:47, skipping insertion in model container [2019-11-28 00:25:47,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:47" (3/3) ... [2019-11-28 00:25:47,051 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i20_o20-2.c [2019-11-28 00:25:47,059 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:25:47,066 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 00:25:47,078 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 00:25:47,104 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:25:47,105 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:25:47,105 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:25:47,105 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:25:47,105 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:25:47,105 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:25:47,105 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:25:47,105 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:25:47,121 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-11-28 00:25:47,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 00:25:47,125 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:47,126 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:47,127 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:47,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:47,131 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2019-11-28 00:25:47,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:47,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662627440] [2019-11-28 00:25:47,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:47,429 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 00:25:47,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662627440] [2019-11-28 00:25:47,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:25:47,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 00:25:47,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465298502] [2019-11-28 00:25:47,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 00:25:47,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:47,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 00:25:47,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:25:47,451 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 7 states. [2019-11-28 00:25:47,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:47,558 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-11-28 00:25:47,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:25:47,560 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-11-28 00:25:47,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:47,569 INFO L225 Difference]: With dead ends: 24 [2019-11-28 00:25:47,569 INFO L226 Difference]: Without dead ends: 14 [2019-11-28 00:25:47,572 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 00:25:47,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-28 00:25:47,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-28 00:25:47,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-28 00:25:47,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-11-28 00:25:47,608 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-11-28 00:25:47,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:47,608 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-11-28 00:25:47,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 00:25:47,609 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-11-28 00:25:47,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 00:25:47,610 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:47,611 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:47,611 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:47,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:47,612 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2019-11-28 00:25:47,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:47,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622373753] [2019-11-28 00:25:47,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:47,800 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 00:25:47,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622373753] [2019-11-28 00:25:47,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152131960] [2019-11-28 00:25:47,801 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 00:25:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:47,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:25:47,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:47,907 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 00:25:47,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:47,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2019-11-28 00:25:47,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065631519] [2019-11-28 00:25:47,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 00:25:47,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:47,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 00:25:47,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:25:47,911 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 10 states. [2019-11-28 00:25:48,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:48,017 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-11-28 00:25:48,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:25:48,018 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-11-28 00:25:48,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:48,020 INFO L225 Difference]: With dead ends: 21 [2019-11-28 00:25:48,020 INFO L226 Difference]: Without dead ends: 17 [2019-11-28 00:25:48,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:25:48,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-28 00:25:48,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 00:25:48,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 00:25:48,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-11-28 00:25:48,033 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-11-28 00:25:48,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:48,034 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-28 00:25:48,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 00:25:48,034 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-11-28 00:25:48,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 00:25:48,038 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:48,039 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:48,243 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:48,252 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:48,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:48,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2019-11-28 00:25:48,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:48,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374830447] [2019-11-28 00:25:48,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:48,494 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 00:25:48,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374830447] [2019-11-28 00:25:48,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141337446] [2019-11-28 00:25:48,495 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 00:25:48,539 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:25:48,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:48,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 00:25:48,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:48,584 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 00:25:48,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:48,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2019-11-28 00:25:48,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056269770] [2019-11-28 00:25:48,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 00:25:48,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:48,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 00:25:48,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-28 00:25:48,598 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 11 states. [2019-11-28 00:25:48,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:48,706 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-11-28 00:25:48,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:25:48,706 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-11-28 00:25:48,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:48,707 INFO L225 Difference]: With dead ends: 24 [2019-11-28 00:25:48,708 INFO L226 Difference]: Without dead ends: 20 [2019-11-28 00:25:48,708 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-11-28 00:25:48,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-28 00:25:48,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-28 00:25:48,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 00:25:48,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-11-28 00:25:48,716 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2019-11-28 00:25:48,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:48,716 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-11-28 00:25:48,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 00:25:48,716 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-11-28 00:25:48,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 00:25:48,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:48,718 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:48,922 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:48,922 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:48,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:48,923 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2019-11-28 00:25:48,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:48,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907823067] [2019-11-28 00:25:48,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:49,126 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 00:25:49,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907823067] [2019-11-28 00:25:49,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023168292] [2019-11-28 00:25:49,127 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 00:25:49,162 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 00:25:49,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:49,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 00:25:49,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:49,211 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 00:25:49,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:49,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2019-11-28 00:25:49,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151733543] [2019-11-28 00:25:49,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 00:25:49,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:49,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 00:25:49,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:25:49,214 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 12 states. [2019-11-28 00:25:49,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:49,331 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-11-28 00:25:49,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:25:49,332 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-11-28 00:25:49,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:49,333 INFO L225 Difference]: With dead ends: 27 [2019-11-28 00:25:49,333 INFO L226 Difference]: Without dead ends: 23 [2019-11-28 00:25:49,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-11-28 00:25:49,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-28 00:25:49,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-28 00:25:49,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 00:25:49,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-11-28 00:25:49,341 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2019-11-28 00:25:49,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:49,342 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-28 00:25:49,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 00:25:49,343 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-11-28 00:25:49,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:25:49,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:49,345 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:49,548 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:49,549 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:49,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:49,549 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2019-11-28 00:25:49,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:49,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875032704] [2019-11-28 00:25:49,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:49,790 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 00:25:49,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875032704] [2019-11-28 00:25:49,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495226727] [2019-11-28 00:25:49,792 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 00:25:49,825 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 00:25:49,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:49,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 00:25:49,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:49,887 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 00:25:49,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:49,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 13 [2019-11-28 00:25:49,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541139870] [2019-11-28 00:25:49,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 00:25:49,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:49,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 00:25:49,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-28 00:25:49,890 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 13 states. [2019-11-28 00:25:49,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:49,980 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-11-28 00:25:49,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:25:49,980 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2019-11-28 00:25:49,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:49,982 INFO L225 Difference]: With dead ends: 30 [2019-11-28 00:25:49,982 INFO L226 Difference]: Without dead ends: 26 [2019-11-28 00:25:49,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-11-28 00:25:49,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-28 00:25:49,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-28 00:25:49,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 00:25:49,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-11-28 00:25:49,989 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2019-11-28 00:25:49,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:49,989 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-11-28 00:25:49,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 00:25:49,990 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-11-28 00:25:49,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 00:25:49,991 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:49,991 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:50,195 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:50,196 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:50,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:50,197 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2019-11-28 00:25:50,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:50,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66452979] [2019-11-28 00:25:50,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:50,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:50,398 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 00:25:50,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66452979] [2019-11-28 00:25:50,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141360993] [2019-11-28 00:25:50,399 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 00:25:50,443 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-28 00:25:50,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:50,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 00:25:50,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:50,490 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 00:25:50,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:50,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 14 [2019-11-28 00:25:50,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353090135] [2019-11-28 00:25:50,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 00:25:50,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:50,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 00:25:50,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-28 00:25:50,493 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 14 states. [2019-11-28 00:25:50,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:50,621 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-11-28 00:25:50,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 00:25:50,621 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2019-11-28 00:25:50,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:50,622 INFO L225 Difference]: With dead ends: 33 [2019-11-28 00:25:50,622 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 00:25:50,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2019-11-28 00:25:50,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 00:25:50,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-28 00:25:50,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 00:25:50,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-11-28 00:25:50,629 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2019-11-28 00:25:50,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:50,630 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-11-28 00:25:50,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 00:25:50,630 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-11-28 00:25:50,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 00:25:50,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:50,631 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:50,838 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:50,839 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:50,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:50,840 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2019-11-28 00:25:50,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:50,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639477897] [2019-11-28 00:25:50,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:50,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:51,128 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 00:25:51,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639477897] [2019-11-28 00:25:51,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418285972] [2019-11-28 00:25:51,130 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 00:25:51,191 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-28 00:25:51,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:51,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 00:25:51,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:51,443 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 00:25:51,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:51,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 28 [2019-11-28 00:25:51,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076002909] [2019-11-28 00:25:51,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-28 00:25:51,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:51,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-28 00:25:51,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2019-11-28 00:25:51,446 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 28 states. [2019-11-28 00:25:51,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:51,825 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-11-28 00:25:51,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 00:25:51,825 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 45 [2019-11-28 00:25:51,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:51,826 INFO L225 Difference]: With dead ends: 36 [2019-11-28 00:25:51,827 INFO L226 Difference]: Without dead ends: 32 [2019-11-28 00:25:51,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=285, Invalid=1355, Unknown=0, NotChecked=0, Total=1640 [2019-11-28 00:25:51,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-28 00:25:51,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-28 00:25:51,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 00:25:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-11-28 00:25:51,833 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2019-11-28 00:25:51,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:51,834 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-11-28 00:25:51,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-28 00:25:51,834 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-11-28 00:25:51,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 00:25:51,835 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:51,838 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:52,038 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:52,040 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:52,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:52,041 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2019-11-28 00:25:52,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:52,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937531764] [2019-11-28 00:25:52,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,329 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 00:25:52,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937531764] [2019-11-28 00:25:52,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079349713] [2019-11-28 00:25:52,331 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 00:25:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 00:25:52,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:52,431 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 00:25:52,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:52,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 16 [2019-11-28 00:25:52,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996808586] [2019-11-28 00:25:52,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 00:25:52,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:52,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 00:25:52,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-11-28 00:25:52,434 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 16 states. [2019-11-28 00:25:52,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:52,578 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-11-28 00:25:52,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 00:25:52,579 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2019-11-28 00:25:52,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:52,580 INFO L225 Difference]: With dead ends: 39 [2019-11-28 00:25:52,580 INFO L226 Difference]: Without dead ends: 35 [2019-11-28 00:25:52,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2019-11-28 00:25:52,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-28 00:25:52,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-11-28 00:25:52,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 00:25:52,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-11-28 00:25:52,586 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2019-11-28 00:25:52,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:52,587 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-11-28 00:25:52,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 00:25:52,587 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-11-28 00:25:52,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-28 00:25:52,588 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:52,588 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:52,791 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:52,791 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:52,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:52,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2019-11-28 00:25:52,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:52,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870587511] [2019-11-28 00:25:52,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,081 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 00:25:53,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870587511] [2019-11-28 00:25:53,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309756835] [2019-11-28 00:25:53,082 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 00:25:53,121 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:25:53,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:53,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-28 00:25:53,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:53,181 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 00:25:53,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:53,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 17 [2019-11-28 00:25:53,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979959709] [2019-11-28 00:25:53,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 00:25:53,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:53,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 00:25:53,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-11-28 00:25:53,183 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 17 states. [2019-11-28 00:25:53,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:53,344 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-11-28 00:25:53,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 00:25:53,345 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2019-11-28 00:25:53,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:53,346 INFO L225 Difference]: With dead ends: 42 [2019-11-28 00:25:53,346 INFO L226 Difference]: Without dead ends: 38 [2019-11-28 00:25:53,347 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=455, Unknown=0, NotChecked=0, Total=650 [2019-11-28 00:25:53,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-28 00:25:53,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-28 00:25:53,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 00:25:53,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-11-28 00:25:53,354 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2019-11-28 00:25:53,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:53,355 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-11-28 00:25:53,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 00:25:53,355 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-11-28 00:25:53,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 00:25:53,356 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:53,357 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:53,561 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:53,561 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:53,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:53,561 INFO L82 PathProgramCache]: Analyzing trace with hash -2055304301, now seen corresponding path program 9 times [2019-11-28 00:25:53,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:53,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448477374] [2019-11-28 00:25:53,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,921 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 00:25:53,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448477374] [2019-11-28 00:25:53,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778229960] [2019-11-28 00:25:53,922 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 00:25:54,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-28 00:25:54,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:54,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 00:25:54,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:54,478 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 00:25:54,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:54,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23] total 37 [2019-11-28 00:25:54,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658493842] [2019-11-28 00:25:54,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-28 00:25:54,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:54,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-28 00:25:54,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2019-11-28 00:25:54,480 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 37 states. [2019-11-28 00:25:54,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:54,932 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-11-28 00:25:54,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-28 00:25:54,932 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 63 [2019-11-28 00:25:54,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:54,934 INFO L225 Difference]: With dead ends: 45 [2019-11-28 00:25:54,934 INFO L226 Difference]: Without dead ends: 41 [2019-11-28 00:25:54,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=537, Invalid=2543, Unknown=0, NotChecked=0, Total=3080 [2019-11-28 00:25:54,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-28 00:25:54,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-28 00:25:54,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 00:25:54,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-11-28 00:25:54,942 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2019-11-28 00:25:54,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:54,942 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-11-28 00:25:54,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-28 00:25:54,943 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-11-28 00:25:54,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-28 00:25:54,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:54,944 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:55,147 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:55,148 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:55,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:55,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1172322647, now seen corresponding path program 10 times [2019-11-28 00:25:55,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:55,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754792505] [2019-11-28 00:25:55,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:55,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,532 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 00:25:55,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754792505] [2019-11-28 00:25:55,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730187946] [2019-11-28 00:25:55,534 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 00:25:55,601 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 00:25:55,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:55,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 00:25:55,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:55,692 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 00:25:55,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:55,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 19 [2019-11-28 00:25:55,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282321226] [2019-11-28 00:25:55,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 00:25:55,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:55,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 00:25:55,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2019-11-28 00:25:55,695 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 19 states. [2019-11-28 00:25:55,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:55,950 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-11-28 00:25:55,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 00:25:55,951 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 69 [2019-11-28 00:25:55,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:55,952 INFO L225 Difference]: With dead ends: 48 [2019-11-28 00:25:55,952 INFO L226 Difference]: Without dead ends: 44 [2019-11-28 00:25:55,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=602, Unknown=0, NotChecked=0, Total=870 [2019-11-28 00:25:55,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-28 00:25:55,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-28 00:25:55,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-28 00:25:55,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-11-28 00:25:55,960 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2019-11-28 00:25:55,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:55,960 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-11-28 00:25:55,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 00:25:55,961 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-11-28 00:25:55,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-28 00:25:55,962 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:55,962 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:56,167 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:56,167 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:56,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:56,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1452916077, now seen corresponding path program 11 times [2019-11-28 00:25:56,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:56,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010225641] [2019-11-28 00:25:56,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,596 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 00:25:56,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010225641] [2019-11-28 00:25:56,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774253713] [2019-11-28 00:25:56,597 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 00:25:56,646 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-11-28 00:25:56,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:56,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-28 00:25:56,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:56,736 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 00:25:56,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:56,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 20 [2019-11-28 00:25:56,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43971123] [2019-11-28 00:25:56,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-28 00:25:56,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:56,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-28 00:25:56,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-11-28 00:25:56,739 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 20 states. [2019-11-28 00:25:56,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:56,927 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-11-28 00:25:56,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 00:25:56,927 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 75 [2019-11-28 00:25:56,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:56,928 INFO L225 Difference]: With dead ends: 51 [2019-11-28 00:25:56,929 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 00:25:56,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=309, Invalid=683, Unknown=0, NotChecked=0, Total=992 [2019-11-28 00:25:56,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 00:25:56,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-28 00:25:56,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 00:25:56,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-11-28 00:25:56,936 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2019-11-28 00:25:56,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:56,937 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-11-28 00:25:56,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-28 00:25:56,937 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-11-28 00:25:56,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-28 00:25:56,939 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:56,939 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:57,143 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:57,143 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:57,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:57,144 INFO L82 PathProgramCache]: Analyzing trace with hash -461124311, now seen corresponding path program 12 times [2019-11-28 00:25:57,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:57,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508283271] [2019-11-28 00:25:57,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,639 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 00:25:57,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508283271] [2019-11-28 00:25:57,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600528702] [2019-11-28 00:25:57,640 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 00:25:57,714 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-11-28 00:25:57,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:57,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-28 00:25:57,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:57,818 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 00:25:57,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:57,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 21 [2019-11-28 00:25:57,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9625237] [2019-11-28 00:25:57,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 00:25:57,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:57,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 00:25:57,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2019-11-28 00:25:57,823 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 21 states. [2019-11-28 00:25:58,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:58,041 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-11-28 00:25:58,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 00:25:58,042 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 81 [2019-11-28 00:25:58,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:58,043 INFO L225 Difference]: With dead ends: 54 [2019-11-28 00:25:58,043 INFO L226 Difference]: Without dead ends: 50 [2019-11-28 00:25:58,044 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=353, Invalid=769, Unknown=0, NotChecked=0, Total=1122 [2019-11-28 00:25:58,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-28 00:25:58,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-11-28 00:25:58,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 00:25:58,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-11-28 00:25:58,050 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2019-11-28 00:25:58,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:58,051 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-11-28 00:25:58,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 00:25:58,051 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-11-28 00:25:58,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-28 00:25:58,053 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:58,053 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:58,257 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:58,257 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:58,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:58,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1887065709, now seen corresponding path program 13 times [2019-11-28 00:25:58,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:58,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036431261] [2019-11-28 00:25:58,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,852 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 00:25:58,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036431261] [2019-11-28 00:25:58,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487196730] [2019-11-28 00:25:58,852 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 00:25:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-28 00:25:58,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:58,984 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 00:25:58,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:58,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 22 [2019-11-28 00:25:58,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208395632] [2019-11-28 00:25:58,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-28 00:25:58,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:58,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-28 00:25:58,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2019-11-28 00:25:58,991 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 22 states. [2019-11-28 00:25:59,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:59,291 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-11-28 00:25:59,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 00:25:59,292 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 87 [2019-11-28 00:25:59,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:59,294 INFO L225 Difference]: With dead ends: 57 [2019-11-28 00:25:59,294 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 00:25:59,295 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=400, Invalid=860, Unknown=0, NotChecked=0, Total=1260 [2019-11-28 00:25:59,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 00:25:59,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-28 00:25:59,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 00:25:59,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-11-28 00:25:59,306 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2019-11-28 00:25:59,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:59,308 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-11-28 00:25:59,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-28 00:25:59,309 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-11-28 00:25:59,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-28 00:25:59,312 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:59,313 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:59,517 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:59,518 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:59,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:59,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1777212503, now seen corresponding path program 14 times [2019-11-28 00:25:59,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:59,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030131523] [2019-11-28 00:25:59,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:00,078 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 00:26:00,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030131523] [2019-11-28 00:26:00,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144839719] [2019-11-28 00:26:00,079 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 00:26:00,140 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:26:00,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:00,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-28 00:26:00,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:00,208 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 00:26:00,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:00,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 23 [2019-11-28 00:26:00,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854012263] [2019-11-28 00:26:00,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-28 00:26:00,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:00,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 00:26:00,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2019-11-28 00:26:00,212 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 23 states. [2019-11-28 00:26:00,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:00,436 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-11-28 00:26:00,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 00:26:00,436 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 93 [2019-11-28 00:26:00,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:00,437 INFO L225 Difference]: With dead ends: 60 [2019-11-28 00:26:00,437 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 00:26:00,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=450, Invalid=956, Unknown=0, NotChecked=0, Total=1406 [2019-11-28 00:26:00,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 00:26:00,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-28 00:26:00,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-28 00:26:00,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-11-28 00:26:00,448 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2019-11-28 00:26:00,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:00,448 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-11-28 00:26:00,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-28 00:26:00,449 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-11-28 00:26:00,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-28 00:26:00,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:00,450 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:00,651 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:00,651 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:00,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:00,652 INFO L82 PathProgramCache]: Analyzing trace with hash -948911981, now seen corresponding path program 15 times [2019-11-28 00:26:00,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:00,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333960036] [2019-11-28 00:26:00,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:00,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:01,286 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 00:26:01,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333960036] [2019-11-28 00:26:01,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756121609] [2019-11-28 00:26:01,287 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 00:26:01,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-11-28 00:26:01,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:01,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-28 00:26:01,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:01,434 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 00:26:01,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:01,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 24 [2019-11-28 00:26:01,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119586616] [2019-11-28 00:26:01,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-28 00:26:01,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:01,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-28 00:26:01,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2019-11-28 00:26:01,438 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 24 states. [2019-11-28 00:26:01,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:01,711 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-11-28 00:26:01,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 00:26:01,712 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 99 [2019-11-28 00:26:01,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:01,713 INFO L225 Difference]: With dead ends: 63 [2019-11-28 00:26:01,713 INFO L226 Difference]: Without dead ends: 59 [2019-11-28 00:26:01,714 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=503, Invalid=1057, Unknown=0, NotChecked=0, Total=1560 [2019-11-28 00:26:01,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-28 00:26:01,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-28 00:26:01,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-28 00:26:01,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-11-28 00:26:01,720 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 99 [2019-11-28 00:26:01,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:01,720 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-11-28 00:26:01,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-28 00:26:01,720 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-11-28 00:26:01,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-28 00:26:01,721 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:01,721 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:01,925 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:01,926 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:01,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:01,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1159072297, now seen corresponding path program 16 times [2019-11-28 00:26:01,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:01,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129164227] [2019-11-28 00:26:01,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:02,519 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 00:26:02,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129164227] [2019-11-28 00:26:02,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94277612] [2019-11-28 00:26:02,520 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 00:26:02,576 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 00:26:02,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:02,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-28 00:26:02,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:02,661 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 00:26:02,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:02,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 25 [2019-11-28 00:26:02,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717018055] [2019-11-28 00:26:02,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-28 00:26:02,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:02,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 00:26:02,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=399, Unknown=0, NotChecked=0, Total=600 [2019-11-28 00:26:02,665 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 25 states. [2019-11-28 00:26:02,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:02,942 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-11-28 00:26:02,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-28 00:26:02,942 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 105 [2019-11-28 00:26:02,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:02,943 INFO L225 Difference]: With dead ends: 66 [2019-11-28 00:26:02,943 INFO L226 Difference]: Without dead ends: 62 [2019-11-28 00:26:02,946 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=559, Invalid=1163, Unknown=0, NotChecked=0, Total=1722 [2019-11-28 00:26:02,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-28 00:26:02,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-28 00:26:02,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-28 00:26:02,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-11-28 00:26:02,960 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 105 [2019-11-28 00:26:02,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:02,964 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-11-28 00:26:02,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-28 00:26:02,964 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-11-28 00:26:02,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-28 00:26:02,965 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:02,966 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:03,166 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:03,167 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:03,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:03,167 INFO L82 PathProgramCache]: Analyzing trace with hash 2109441939, now seen corresponding path program 17 times [2019-11-28 00:26:03,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:03,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309555295] [2019-11-28 00:26:03,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:03,812 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 00:26:03,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309555295] [2019-11-28 00:26:03,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946837609] [2019-11-28 00:26:03,813 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 00:26:03,891 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-11-28 00:26:03,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:03,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-28 00:26:03,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:03,964 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 00:26:03,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:03,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 26 [2019-11-28 00:26:03,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273944501] [2019-11-28 00:26:03,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-28 00:26:03,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:03,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-28 00:26:03,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=429, Unknown=0, NotChecked=0, Total=650 [2019-11-28 00:26:03,967 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 26 states. [2019-11-28 00:26:04,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:04,227 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-11-28 00:26:04,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 00:26:04,227 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 111 [2019-11-28 00:26:04,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:04,228 INFO L225 Difference]: With dead ends: 69 [2019-11-28 00:26:04,228 INFO L226 Difference]: Without dead ends: 65 [2019-11-28 00:26:04,229 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=618, Invalid=1274, Unknown=0, NotChecked=0, Total=1892 [2019-11-28 00:26:04,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-28 00:26:04,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-11-28 00:26:04,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 00:26:04,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-11-28 00:26:04,234 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 111 [2019-11-28 00:26:04,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:04,234 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-11-28 00:26:04,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-28 00:26:04,235 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-11-28 00:26:04,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-28 00:26:04,236 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:04,236 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:04,440 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:04,440 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:04,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:04,441 INFO L82 PathProgramCache]: Analyzing trace with hash 450642089, now seen corresponding path program 18 times [2019-11-28 00:26:04,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:04,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737680288] [2019-11-28 00:26:04,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:05,090 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 00:26:05,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737680288] [2019-11-28 00:26:05,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23858249] [2019-11-28 00:26:05,091 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 00:26:05,166 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-11-28 00:26:05,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:05,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-28 00:26:05,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:05,240 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 00:26:05,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:05,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 27 [2019-11-28 00:26:05,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482443412] [2019-11-28 00:26:05,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-28 00:26:05,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:05,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-28 00:26:05,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=460, Unknown=0, NotChecked=0, Total=702 [2019-11-28 00:26:05,244 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 27 states. [2019-11-28 00:26:05,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:05,578 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-11-28 00:26:05,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-28 00:26:05,578 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 117 [2019-11-28 00:26:05,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:05,579 INFO L225 Difference]: With dead ends: 72 [2019-11-28 00:26:05,579 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 00:26:05,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=680, Invalid=1390, Unknown=0, NotChecked=0, Total=2070 [2019-11-28 00:26:05,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 00:26:05,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-28 00:26:05,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 00:26:05,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-11-28 00:26:05,586 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 117 [2019-11-28 00:26:05,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:05,586 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-11-28 00:26:05,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-28 00:26:05,586 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-11-28 00:26:05,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-28 00:26:05,588 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:05,588 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:05,791 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:05,792 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:05,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:05,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1141244269, now seen corresponding path program 19 times [2019-11-28 00:26:05,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:05,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721253522] [2019-11-28 00:26:05,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,514 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 00:26:06,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721253522] [2019-11-28 00:26:06,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679838550] [2019-11-28 00:26:06,515 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 00:26:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-28 00:26:06,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:06,641 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 00:26:06,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:06,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 28 [2019-11-28 00:26:06,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279146922] [2019-11-28 00:26:06,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-28 00:26:06,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:06,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-28 00:26:06,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=492, Unknown=0, NotChecked=0, Total=756 [2019-11-28 00:26:06,645 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 28 states. [2019-11-28 00:26:06,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:06,948 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-11-28 00:26:06,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 00:26:06,949 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 123 [2019-11-28 00:26:06,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:06,951 INFO L225 Difference]: With dead ends: 75 [2019-11-28 00:26:06,951 INFO L226 Difference]: Without dead ends: 71 [2019-11-28 00:26:06,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=745, Invalid=1511, Unknown=0, NotChecked=0, Total=2256 [2019-11-28 00:26:06,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-28 00:26:06,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-28 00:26:06,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-28 00:26:06,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-11-28 00:26:06,957 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 123 [2019-11-28 00:26:06,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:06,957 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-11-28 00:26:06,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-28 00:26:06,958 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-11-28 00:26:06,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-28 00:26:06,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:06,959 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:07,167 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:07,167 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:07,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:07,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1280276695, now seen corresponding path program 20 times [2019-11-28 00:26:07,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:07,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980162667] [2019-11-28 00:26:07,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:26:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:26:07,225 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:26:07,225 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:26:07,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:26:07 BoogieIcfgContainer [2019-11-28 00:26:07,287 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:26:07,287 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:26:07,288 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:26:07,288 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:26:07,289 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:47" (3/4) ... [2019-11-28 00:26:07,291 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:26:07,386 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:26:07,388 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:26:07,391 INFO L168 Benchmark]: Toolchain (without parser) took 20976.88 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 451.4 MB). Free memory was 952.3 MB in the beginning and 1.0 GB in the end (delta: -65.8 MB). Peak memory consumption was 385.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:07,392 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:26:07,393 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.10 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:07,393 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.65 ms. Allocated memory is still 1.0 GB. Free memory is still 941.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:26:07,394 INFO L168 Benchmark]: Boogie Preprocessor took 71.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -205.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:07,394 INFO L168 Benchmark]: RCFGBuilder took 219.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:07,395 INFO L168 Benchmark]: TraceAbstraction took 20242.72 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 300.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 99.8 MB). Peak memory consumption was 400.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:07,396 INFO L168 Benchmark]: Witness Printer took 100.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-28 00:26:07,399 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 298.10 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 941.6 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 38.65 ms. Allocated memory is still 1.0 GB. Free memory is still 941.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -205.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 219.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20242.72 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 300.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 99.8 MB). Peak memory consumption was 400.8 MB. Max. memory is 11.5 GB. * Witness Printer took 100.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int input = 20; [L11] CALL, EXPR id(input) VAL [\old(x)=20] [L5] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L6] CALL, EXPR id(x-1) VAL [\old(x)=19] [L5] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L6] CALL, EXPR id(x-1) VAL [\old(x)=18] [L5] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L6] CALL, EXPR id(x-1) VAL [\old(x)=17] [L5] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L6] CALL, EXPR id(x-1) VAL [\old(x)=16] [L5] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L6] CALL, EXPR id(x-1) VAL [\old(x)=15] [L5] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L6] CALL, EXPR id(x-1) VAL [\old(x)=14] [L5] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L6] CALL, EXPR id(x-1) VAL [\old(x)=13] [L5] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L6] CALL, EXPR id(x-1) VAL [\old(x)=12] [L5] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L6] CALL, EXPR id(x-1) VAL [\old(x)=11] [L5] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L6] CALL, EXPR id(x-1) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) [L11] int result = id(input); [L12] COND TRUE result == 20 [L13] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. Result: UNSAFE, OverallTime: 20.1s, OverallIterations: 21, TraceHistogramMax: 21, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 181 SDtfs, 715 SDslu, 1213 SDs, 0 SdLazy, 1196 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2227 GetRequests, 1642 SyntacticMatches, 0 SemanticMatches, 585 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3493 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 2760 NumberOfCodeBlocks, 2760 NumberOfCodeBlocksAsserted, 142 NumberOfCheckSat, 2592 ConstructedInterpolants, 0 QuantifiedInterpolants, 567664 SizeOfPredicates, 211 NumberOfNonLiveVariables, 3116 ConjunctsInSsa, 456 ConjunctsInUnsatCore, 39 InterpolantComputations, 1 PerfectInterpolantSequences, 7600/15200 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...