./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 f6fb2bb1 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-f6fb2bb [2019-11-19 18:58:16,344 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 18:58:16,347 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 18:58:16,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 18:58:16,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 18:58:16,361 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 18:58:16,363 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 18:58:16,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 18:58:16,367 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 18:58:16,368 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 18:58:16,369 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 18:58:16,370 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 18:58:16,371 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 18:58:16,372 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 18:58:16,373 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 18:58:16,374 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 18:58:16,375 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 18:58:16,379 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 18:58:16,381 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 18:58:16,385 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 18:58:16,386 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 18:58:16,390 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 18:58:16,391 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 18:58:16,394 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 18:58:16,396 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 18:58:16,398 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 18:58:16,398 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 18:58:16,400 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 18:58:16,400 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 18:58:16,402 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 18:58:16,402 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 18:58:16,403 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 18:58:16,404 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 18:58:16,405 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 18:58:16,409 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 18:58:16,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 18:58:16,410 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 18:58:16,410 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 18:58:16,410 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 18:58:16,414 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 18:58:16,415 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 18:58:16,416 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 18:58:16,435 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 18:58:16,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 18:58:16,438 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 18:58:16,438 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 18:58:16,438 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 18:58:16,438 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 18:58:16,439 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 18:58:16,439 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 18:58:16,439 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 18:58:16,439 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 18:58:16,440 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 18:58:16,440 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 18:58:16,441 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 18:58:16,441 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 18:58:16,441 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 18:58:16,441 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 18:58:16,442 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 18:58:16,442 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 18:58:16,442 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 18:58:16,442 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 18:58:16,442 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 18:58:16,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 18:58:16,443 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 18:58:16,443 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 18:58:16,443 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 18:58:16,444 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 18:58:16,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 18:58:16,444 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 18:58:16,444 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-19 18:58:16,782 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 18:58:16,801 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 18:58:16,806 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 18:58:16,808 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 18:58:16,809 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 18:58:16,810 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-19 18:58:16,891 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1d204b31/276728b8f0124580be4535a836c0c191/FLAG0bf4f4060 [2019-11-19 18:58:17,397 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 18:58:17,398 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i20_o20-2.c [2019-11-19 18:58:17,403 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1d204b31/276728b8f0124580be4535a836c0c191/FLAG0bf4f4060 [2019-11-19 18:58:17,769 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1d204b31/276728b8f0124580be4535a836c0c191 [2019-11-19 18:58:17,775 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 18:58:17,777 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 18:58:17,781 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 18:58:17,781 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 18:58:17,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 18:58:17,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:58:17" (1/1) ... [2019-11-19 18:58:17,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dd97c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:17, skipping insertion in model container [2019-11-19 18:58:17,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:58:17" (1/1) ... [2019-11-19 18:58:17,800 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 18:58:17,820 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 18:58:18,038 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:58:18,043 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 18:58:18,065 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:58:18,085 INFO L192 MainTranslator]: Completed translation [2019-11-19 18:58:18,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:18 WrapperNode [2019-11-19 18:58:18,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 18:58:18,087 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 18:58:18,087 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 18:58:18,087 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 18:58:18,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:18" (1/1) ... [2019-11-19 18:58:18,104 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:18" (1/1) ... [2019-11-19 18:58:18,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 18:58:18,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 18:58:18,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 18:58:18,129 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 18:58:18,202 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:18" (1/1) ... [2019-11-19 18:58:18,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:18" (1/1) ... [2019-11-19 18:58:18,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:18" (1/1) ... [2019-11-19 18:58:18,203 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:18" (1/1) ... [2019-11-19 18:58:18,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:18" (1/1) ... [2019-11-19 18:58:18,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:18" (1/1) ... [2019-11-19 18:58:18,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:18" (1/1) ... [2019-11-19 18:58:18,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 18:58:18,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 18:58:18,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 18:58:18,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 18:58:18,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 18:58:18,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 18:58:18,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 18:58:18,283 INFO L130 BoogieDeclarations]: Found specification of procedure id [2019-11-19 18:58:18,283 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2019-11-19 18:58:18,441 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 18:58:18,441 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-19 18:58:18,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:58:18 BoogieIcfgContainer [2019-11-19 18:58:18,443 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 18:58:18,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 18:58:18,446 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 18:58:18,450 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 18:58:18,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:58:17" (1/3) ... [2019-11-19 18:58:18,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be43d23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:58:18, skipping insertion in model container [2019-11-19 18:58:18,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:18" (2/3) ... [2019-11-19 18:58:18,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be43d23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:58:18, skipping insertion in model container [2019-11-19 18:58:18,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:58:18" (3/3) ... [2019-11-19 18:58:18,453 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i20_o20-2.c [2019-11-19 18:58:18,461 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 18:58:18,471 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 18:58:18,482 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 18:58:18,512 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 18:58:18,512 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 18:58:18,512 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 18:58:18,512 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 18:58:18,514 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 18:58:18,515 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 18:58:18,515 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 18:58:18,515 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 18:58:18,535 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-11-19 18:58:18,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-19 18:58:18,540 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:18,540 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:18,541 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:18,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:18,547 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2019-11-19 18:58:18,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:18,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107283958] [2019-11-19 18:58:18,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:18,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:58:18,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107283958] [2019-11-19 18:58:18,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:58:18,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 18:58:18,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280384417] [2019-11-19 18:58:18,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 18:58:18,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:18,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 18:58:18,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 18:58:18,877 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 7 states. [2019-11-19 18:58:18,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:18,992 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-11-19 18:58:18,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 18:58:18,995 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-11-19 18:58:18,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:19,005 INFO L225 Difference]: With dead ends: 24 [2019-11-19 18:58:19,005 INFO L226 Difference]: Without dead ends: 14 [2019-11-19 18:58:19,009 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-19 18:58:19,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-19 18:58:19,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-19 18:58:19,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-19 18:58:19,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-11-19 18:58:19,051 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-11-19 18:58:19,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:19,052 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-11-19 18:58:19,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 18:58:19,052 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-11-19 18:58:19,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 18:58:19,053 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:19,054 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:19,054 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:19,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:19,054 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2019-11-19 18:58:19,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:19,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369102333] [2019-11-19 18:58:19,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:19,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 18:58:19,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369102333] [2019-11-19 18:58:19,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409045811] [2019-11-19 18:58:19,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:19,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 18:58:19,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:19,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 18:58:19,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:19,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2019-11-19 18:58:19,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454904646] [2019-11-19 18:58:19,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 18:58:19,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:19,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 18:58:19,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-19 18:58:19,340 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 10 states. [2019-11-19 18:58:19,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:19,415 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-11-19 18:58:19,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 18:58:19,416 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-11-19 18:58:19,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:19,417 INFO L225 Difference]: With dead ends: 21 [2019-11-19 18:58:19,417 INFO L226 Difference]: Without dead ends: 17 [2019-11-19 18:58:19,419 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-19 18:58:19,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-19 18:58:19,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-19 18:58:19,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-19 18:58:19,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-11-19 18:58:19,424 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-11-19 18:58:19,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:19,425 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-19 18:58:19,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 18:58:19,425 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-11-19 18:58:19,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-19 18:58:19,426 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:19,427 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:19,632 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:19,632 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:19,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:19,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2019-11-19 18:58:19,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:19,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655897188] [2019-11-19 18:58:19,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:19,871 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-19 18:58:19,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655897188] [2019-11-19 18:58:19,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347684509] [2019-11-19 18:58:19,872 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:19,921 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 18:58:19,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:19,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 18:58:19,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:19,975 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-19 18:58:19,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:19,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2019-11-19 18:58:19,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127417776] [2019-11-19 18:58:19,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 18:58:19,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:19,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 18:58:19,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-19 18:58:19,980 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 11 states. [2019-11-19 18:58:20,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:20,084 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-11-19 18:58:20,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 18:58:20,085 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-11-19 18:58:20,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:20,086 INFO L225 Difference]: With dead ends: 24 [2019-11-19 18:58:20,086 INFO L226 Difference]: Without dead ends: 20 [2019-11-19 18:58:20,087 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-19 18:58:20,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-19 18:58:20,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-19 18:58:20,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-19 18:58:20,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-11-19 18:58:20,093 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2019-11-19 18:58:20,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:20,094 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-11-19 18:58:20,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 18:58:20,094 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-11-19 18:58:20,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 18:58:20,096 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:20,097 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:20,300 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:20,300 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:20,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:20,301 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2019-11-19 18:58:20,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:20,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136634728] [2019-11-19 18:58:20,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-19 18:58:20,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136634728] [2019-11-19 18:58:20,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62159614] [2019-11-19 18:58:20,530 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:20,568 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-19 18:58:20,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:20,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 18:58:20,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:20,630 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-19 18:58:20,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:20,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2019-11-19 18:58:20,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434116908] [2019-11-19 18:58:20,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 18:58:20,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:20,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 18:58:20,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-19 18:58:20,636 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 12 states. [2019-11-19 18:58:20,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:20,758 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-11-19 18:58:20,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 18:58:20,759 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-11-19 18:58:20,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:20,761 INFO L225 Difference]: With dead ends: 27 [2019-11-19 18:58:20,761 INFO L226 Difference]: Without dead ends: 23 [2019-11-19 18:58:20,762 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-19 18:58:20,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-19 18:58:20,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-19 18:58:20,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-19 18:58:20,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-11-19 18:58:20,776 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2019-11-19 18:58:20,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:20,778 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-19 18:58:20,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 18:58:20,779 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-11-19 18:58:20,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-19 18:58:20,782 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:20,782 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:20,985 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:20,987 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:20,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:20,988 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2019-11-19 18:58:20,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:20,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564323622] [2019-11-19 18:58:20,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:21,261 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-19 18:58:21,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564323622] [2019-11-19 18:58:21,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196343771] [2019-11-19 18:58:21,262 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:21,297 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 18:58:21,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:21,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 18:58:21,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:21,354 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-19 18:58:21,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:21,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 13 [2019-11-19 18:58:21,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803829879] [2019-11-19 18:58:21,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 18:58:21,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:21,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 18:58:21,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-19 18:58:21,358 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 13 states. [2019-11-19 18:58:21,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:21,468 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-11-19 18:58:21,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 18:58:21,469 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2019-11-19 18:58:21,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:21,470 INFO L225 Difference]: With dead ends: 30 [2019-11-19 18:58:21,470 INFO L226 Difference]: Without dead ends: 26 [2019-11-19 18:58:21,471 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-19 18:58:21,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-19 18:58:21,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-19 18:58:21,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-19 18:58:21,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-11-19 18:58:21,477 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2019-11-19 18:58:21,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:21,478 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-11-19 18:58:21,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 18:58:21,478 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-11-19 18:58:21,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-19 18:58:21,480 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:21,480 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:21,683 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:21,683 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:21,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:21,684 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2019-11-19 18:58:21,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:21,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013169354] [2019-11-19 18:58:21,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:21,887 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-19 18:58:21,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013169354] [2019-11-19 18:58:21,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407473017] [2019-11-19 18:58:21,888 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:21,938 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-19 18:58:21,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:21,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-19 18:58:21,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:21,985 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-19 18:58:21,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:21,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 14 [2019-11-19 18:58:21,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151802453] [2019-11-19 18:58:21,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-19 18:58:21,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:21,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-19 18:58:21,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-19 18:58:21,987 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 14 states. [2019-11-19 18:58:22,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:22,100 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-11-19 18:58:22,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 18:58:22,101 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2019-11-19 18:58:22,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:22,104 INFO L225 Difference]: With dead ends: 33 [2019-11-19 18:58:22,104 INFO L226 Difference]: Without dead ends: 29 [2019-11-19 18:58:22,105 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-19 18:58:22,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-19 18:58:22,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-19 18:58:22,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-19 18:58:22,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-11-19 18:58:22,115 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2019-11-19 18:58:22,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:22,117 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-11-19 18:58:22,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-19 18:58:22,117 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-11-19 18:58:22,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-19 18:58:22,121 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:22,121 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:22,326 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:22,327 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:22,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:22,328 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2019-11-19 18:58:22,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:22,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289169097] [2019-11-19 18:58:22,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,617 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-19 18:58:22,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289169097] [2019-11-19 18:58:22,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683617284] [2019-11-19 18:58:22,618 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:22,669 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-19 18:58:22,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:22,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-19 18:58:22,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:23,000 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-19 18:58:23,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:23,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 28 [2019-11-19 18:58:23,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426410472] [2019-11-19 18:58:23,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-19 18:58:23,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:23,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-19 18:58:23,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2019-11-19 18:58:23,003 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 28 states. [2019-11-19 18:58:23,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:23,359 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-11-19 18:58:23,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-19 18:58:23,359 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 45 [2019-11-19 18:58:23,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:23,362 INFO L225 Difference]: With dead ends: 36 [2019-11-19 18:58:23,362 INFO L226 Difference]: Without dead ends: 32 [2019-11-19 18:58:23,364 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=285, Invalid=1355, Unknown=0, NotChecked=0, Total=1640 [2019-11-19 18:58:23,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-19 18:58:23,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-19 18:58:23,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-19 18:58:23,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-11-19 18:58:23,374 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2019-11-19 18:58:23,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:23,375 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-11-19 18:58:23,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-19 18:58:23,375 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-11-19 18:58:23,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-19 18:58:23,379 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:23,380 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:23,583 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:23,584 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:23,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:23,584 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2019-11-19 18:58:23,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:23,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006225479] [2019-11-19 18:58:23,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:23,812 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-19 18:58:23,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006225479] [2019-11-19 18:58:23,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053030431] [2019-11-19 18:58:23,814 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:23,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-19 18:58:23,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:23,927 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-19 18:58:23,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:23,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 16 [2019-11-19 18:58:23,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227486981] [2019-11-19 18:58:23,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-19 18:58:23,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:23,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-19 18:58:23,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-11-19 18:58:23,932 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 16 states. [2019-11-19 18:58:24,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:24,065 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-11-19 18:58:24,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 18:58:24,065 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2019-11-19 18:58:24,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:24,067 INFO L225 Difference]: With dead ends: 39 [2019-11-19 18:58:24,067 INFO L226 Difference]: Without dead ends: 35 [2019-11-19 18:58:24,068 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-19 18:58:24,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-19 18:58:24,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-11-19 18:58:24,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-19 18:58:24,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-11-19 18:58:24,073 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2019-11-19 18:58:24,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:24,073 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-11-19 18:58:24,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-19 18:58:24,074 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-11-19 18:58:24,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-19 18:58:24,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:24,075 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:24,278 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:24,279 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:24,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:24,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2019-11-19 18:58:24,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:24,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954436565] [2019-11-19 18:58:24,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,526 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-19 18:58:24,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954436565] [2019-11-19 18:58:24,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907863548] [2019-11-19 18:58:24,527 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:24,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 18:58:24,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:24,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-19 18:58:24,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:24,615 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-19 18:58:24,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:24,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 17 [2019-11-19 18:58:24,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122502833] [2019-11-19 18:58:24,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-19 18:58:24,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:24,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-19 18:58:24,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-11-19 18:58:24,618 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 17 states. [2019-11-19 18:58:24,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:24,761 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-11-19 18:58:24,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 18:58:24,763 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2019-11-19 18:58:24,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:24,764 INFO L225 Difference]: With dead ends: 42 [2019-11-19 18:58:24,764 INFO L226 Difference]: Without dead ends: 38 [2019-11-19 18:58:24,765 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-19 18:58:24,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-19 18:58:24,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-19 18:58:24,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-19 18:58:24,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-11-19 18:58:24,771 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2019-11-19 18:58:24,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:24,772 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-11-19 18:58:24,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-19 18:58:24,772 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-11-19 18:58:24,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-19 18:58:24,773 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:24,773 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:24,985 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:24,985 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:24,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:24,986 INFO L82 PathProgramCache]: Analyzing trace with hash -2055304301, now seen corresponding path program 9 times [2019-11-19 18:58:24,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:24,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154149282] [2019-11-19 18:58:24,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,322 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-19 18:58:25,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154149282] [2019-11-19 18:58:25,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875484471] [2019-11-19 18:58:25,323 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:25,386 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-19 18:58:25,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:25,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-19 18:58:25,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:25,838 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-19 18:58:25,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:25,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23] total 37 [2019-11-19 18:58:25,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673870993] [2019-11-19 18:58:25,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-19 18:58:25,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:25,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-19 18:58:25,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2019-11-19 18:58:25,841 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 37 states. [2019-11-19 18:58:26,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:26,419 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-11-19 18:58:26,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-19 18:58:26,420 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 63 [2019-11-19 18:58:26,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:26,421 INFO L225 Difference]: With dead ends: 45 [2019-11-19 18:58:26,421 INFO L226 Difference]: Without dead ends: 41 [2019-11-19 18:58:26,428 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=537, Invalid=2543, Unknown=0, NotChecked=0, Total=3080 [2019-11-19 18:58:26,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-19 18:58:26,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-19 18:58:26,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-19 18:58:26,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-11-19 18:58:26,441 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2019-11-19 18:58:26,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:26,441 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-11-19 18:58:26,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-19 18:58:26,442 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-11-19 18:58:26,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-19 18:58:26,443 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:26,444 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:26,655 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:26,656 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:26,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:26,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1172322647, now seen corresponding path program 10 times [2019-11-19 18:58:26,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:26,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456311210] [2019-11-19 18:58:26,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:26,951 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-19 18:58:26,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456311210] [2019-11-19 18:58:26,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680747155] [2019-11-19 18:58:26,952 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:26,984 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 18:58:26,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:26,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-19 18:58:26,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:27,051 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-19 18:58:27,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:27,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 19 [2019-11-19 18:58:27,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372586416] [2019-11-19 18:58:27,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-19 18:58:27,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:27,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-19 18:58:27,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2019-11-19 18:58:27,053 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 19 states. [2019-11-19 18:58:27,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:27,217 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-11-19 18:58:27,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-19 18:58:27,217 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 69 [2019-11-19 18:58:27,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:27,219 INFO L225 Difference]: With dead ends: 48 [2019-11-19 18:58:27,219 INFO L226 Difference]: Without dead ends: 44 [2019-11-19 18:58:27,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=268, Invalid=602, Unknown=0, NotChecked=0, Total=870 [2019-11-19 18:58:27,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-19 18:58:27,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-19 18:58:27,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-19 18:58:27,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-11-19 18:58:27,226 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2019-11-19 18:58:27,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:27,226 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-11-19 18:58:27,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-19 18:58:27,226 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-11-19 18:58:27,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-19 18:58:27,227 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:27,227 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:27,431 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:27,431 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:27,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:27,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1452916077, now seen corresponding path program 11 times [2019-11-19 18:58:27,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:27,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144757003] [2019-11-19 18:58:27,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:27,804 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-11-19 18:58:27,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144757003] [2019-11-19 18:58:27,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337397936] [2019-11-19 18:58:27,805 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:27,862 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-11-19 18:58:27,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:27,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-19 18:58:27,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:27,940 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-11-19 18:58:27,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:27,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 20 [2019-11-19 18:58:27,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776712695] [2019-11-19 18:58:27,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-19 18:58:27,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:27,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-19 18:58:27,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-11-19 18:58:27,943 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 20 states. [2019-11-19 18:58:28,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:28,166 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-11-19 18:58:28,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-19 18:58:28,167 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 75 [2019-11-19 18:58:28,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:28,168 INFO L225 Difference]: With dead ends: 51 [2019-11-19 18:58:28,168 INFO L226 Difference]: Without dead ends: 47 [2019-11-19 18:58:28,169 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-19 18:58:28,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-19 18:58:28,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-19 18:58:28,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-19 18:58:28,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-11-19 18:58:28,175 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2019-11-19 18:58:28,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:28,176 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-11-19 18:58:28,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-19 18:58:28,176 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-11-19 18:58:28,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-19 18:58:28,177 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:28,177 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:28,381 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:28,382 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:28,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:28,383 INFO L82 PathProgramCache]: Analyzing trace with hash -461124311, now seen corresponding path program 12 times [2019-11-19 18:58:28,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:28,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110105320] [2019-11-19 18:58:28,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:28,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:28,770 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-11-19 18:58:28,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110105320] [2019-11-19 18:58:28,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153505452] [2019-11-19 18:58:28,771 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:28,836 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-11-19 18:58:28,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:28,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-19 18:58:28,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:28,910 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-11-19 18:58:28,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:28,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 21 [2019-11-19 18:58:28,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943799227] [2019-11-19 18:58:28,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-19 18:58:28,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:28,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-19 18:58:28,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2019-11-19 18:58:28,913 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 21 states. [2019-11-19 18:58:29,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:29,133 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-11-19 18:58:29,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-19 18:58:29,133 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 81 [2019-11-19 18:58:29,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:29,134 INFO L225 Difference]: With dead ends: 54 [2019-11-19 18:58:29,135 INFO L226 Difference]: Without dead ends: 50 [2019-11-19 18:58:29,136 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=353, Invalid=769, Unknown=0, NotChecked=0, Total=1122 [2019-11-19 18:58:29,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-19 18:58:29,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-11-19 18:58:29,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-19 18:58:29,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-11-19 18:58:29,141 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2019-11-19 18:58:29,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:29,142 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-11-19 18:58:29,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-19 18:58:29,142 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-11-19 18:58:29,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-19 18:58:29,143 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:29,143 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:29,347 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:29,348 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:29,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:29,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1887065709, now seen corresponding path program 13 times [2019-11-19 18:58:29,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:29,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227693677] [2019-11-19 18:58:29,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:29,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:29,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:29,916 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-11-19 18:58:29,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227693677] [2019-11-19 18:58:29,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566817406] [2019-11-19 18:58:29,919 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:29,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-19 18:58:29,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:30,036 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-11-19 18:58:30,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:30,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 22 [2019-11-19 18:58:30,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655456461] [2019-11-19 18:58:30,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-19 18:58:30,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:30,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-19 18:58:30,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2019-11-19 18:58:30,042 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 22 states. [2019-11-19 18:58:30,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:30,324 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-11-19 18:58:30,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-19 18:58:30,324 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 87 [2019-11-19 18:58:30,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:30,325 INFO L225 Difference]: With dead ends: 57 [2019-11-19 18:58:30,325 INFO L226 Difference]: Without dead ends: 53 [2019-11-19 18:58:30,326 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=400, Invalid=860, Unknown=0, NotChecked=0, Total=1260 [2019-11-19 18:58:30,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-19 18:58:30,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-19 18:58:30,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-19 18:58:30,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-11-19 18:58:30,344 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2019-11-19 18:58:30,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:30,344 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-11-19 18:58:30,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-19 18:58:30,345 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-11-19 18:58:30,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-19 18:58:30,346 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:30,347 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:30,553 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:30,553 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:30,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:30,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1777212503, now seen corresponding path program 14 times [2019-11-19 18:58:30,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:30,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655428063] [2019-11-19 18:58:30,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:31,121 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-19 18:58:31,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655428063] [2019-11-19 18:58:31,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462558274] [2019-11-19 18:58:31,121 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:31,181 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 18:58:31,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:31,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-19 18:58:31,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:31,246 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-19 18:58:31,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:31,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 23 [2019-11-19 18:58:31,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225085012] [2019-11-19 18:58:31,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-19 18:58:31,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:31,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-19 18:58:31,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2019-11-19 18:58:31,250 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 23 states. [2019-11-19 18:58:31,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:31,498 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-11-19 18:58:31,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-19 18:58:31,499 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 93 [2019-11-19 18:58:31,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:31,500 INFO L225 Difference]: With dead ends: 60 [2019-11-19 18:58:31,500 INFO L226 Difference]: Without dead ends: 56 [2019-11-19 18:58:31,501 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=450, Invalid=956, Unknown=0, NotChecked=0, Total=1406 [2019-11-19 18:58:31,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-19 18:58:31,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-19 18:58:31,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-19 18:58:31,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-11-19 18:58:31,508 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2019-11-19 18:58:31,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:31,509 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-11-19 18:58:31,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-19 18:58:31,509 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-11-19 18:58:31,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-19 18:58:31,510 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:31,511 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:31,711 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:31,712 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:31,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:31,712 INFO L82 PathProgramCache]: Analyzing trace with hash -948911981, now seen corresponding path program 15 times [2019-11-19 18:58:31,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:31,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681201272] [2019-11-19 18:58:31,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:32,362 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-11-19 18:58:32,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681201272] [2019-11-19 18:58:32,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400328745] [2019-11-19 18:58:32,363 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:32,423 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-11-19 18:58:32,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:32,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-19 18:58:32,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:32,508 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-11-19 18:58:32,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:32,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 24 [2019-11-19 18:58:32,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031957984] [2019-11-19 18:58:32,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-19 18:58:32,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:32,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-19 18:58:32,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2019-11-19 18:58:32,513 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 24 states. [2019-11-19 18:58:32,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:32,813 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-11-19 18:58:32,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-19 18:58:32,814 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 99 [2019-11-19 18:58:32,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:32,815 INFO L225 Difference]: With dead ends: 63 [2019-11-19 18:58:32,816 INFO L226 Difference]: Without dead ends: 59 [2019-11-19 18:58:32,818 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-19 18:58:32,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-19 18:58:32,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-19 18:58:32,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-19 18:58:32,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-11-19 18:58:32,824 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 99 [2019-11-19 18:58:32,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:32,825 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-11-19 18:58:32,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-19 18:58:32,825 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-11-19 18:58:32,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-19 18:58:32,826 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:32,827 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:33,030 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:33,031 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:33,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:33,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1159072297, now seen corresponding path program 16 times [2019-11-19 18:58:33,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:33,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161906447] [2019-11-19 18:58:33,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,664 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-11-19 18:58:33,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161906447] [2019-11-19 18:58:33,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747804980] [2019-11-19 18:58:33,665 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:33,721 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 18:58:33,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:33,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-19 18:58:33,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:33,787 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-11-19 18:58:33,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:33,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 25 [2019-11-19 18:58:33,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597074487] [2019-11-19 18:58:33,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-19 18:58:33,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:33,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-19 18:58:33,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=399, Unknown=0, NotChecked=0, Total=600 [2019-11-19 18:58:33,790 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 25 states. [2019-11-19 18:58:34,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:34,073 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-11-19 18:58:34,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-19 18:58:34,074 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 105 [2019-11-19 18:58:34,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:34,075 INFO L225 Difference]: With dead ends: 66 [2019-11-19 18:58:34,075 INFO L226 Difference]: Without dead ends: 62 [2019-11-19 18:58:34,076 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=559, Invalid=1163, Unknown=0, NotChecked=0, Total=1722 [2019-11-19 18:58:34,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-19 18:58:34,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-19 18:58:34,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-19 18:58:34,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-11-19 18:58:34,081 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 105 [2019-11-19 18:58:34,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:34,081 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-11-19 18:58:34,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-19 18:58:34,081 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-11-19 18:58:34,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-19 18:58:34,082 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:34,083 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:34,287 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:34,287 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:34,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:34,287 INFO L82 PathProgramCache]: Analyzing trace with hash 2109441939, now seen corresponding path program 17 times [2019-11-19 18:58:34,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:34,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132517613] [2019-11-19 18:58:34,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,966 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-11-19 18:58:34,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132517613] [2019-11-19 18:58:34,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773398955] [2019-11-19 18:58:34,966 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:35,026 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-11-19 18:58:35,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:35,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-19 18:58:35,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:35,115 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-11-19 18:58:35,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:35,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 26 [2019-11-19 18:58:35,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012910708] [2019-11-19 18:58:35,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-19 18:58:35,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:35,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-19 18:58:35,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=429, Unknown=0, NotChecked=0, Total=650 [2019-11-19 18:58:35,117 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 26 states. [2019-11-19 18:58:35,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:35,383 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-11-19 18:58:35,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-19 18:58:35,384 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 111 [2019-11-19 18:58:35,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:35,385 INFO L225 Difference]: With dead ends: 69 [2019-11-19 18:58:35,385 INFO L226 Difference]: Without dead ends: 65 [2019-11-19 18:58:35,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=618, Invalid=1274, Unknown=0, NotChecked=0, Total=1892 [2019-11-19 18:58:35,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-19 18:58:35,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-11-19 18:58:35,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-19 18:58:35,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-11-19 18:58:35,392 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 111 [2019-11-19 18:58:35,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:35,392 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-11-19 18:58:35,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-19 18:58:35,393 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-11-19 18:58:35,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-19 18:58:35,394 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:35,394 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:35,605 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:35,605 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:35,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:35,606 INFO L82 PathProgramCache]: Analyzing trace with hash 450642089, now seen corresponding path program 18 times [2019-11-19 18:58:35,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:35,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108307299] [2019-11-19 18:58:35,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:36,295 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-11-19 18:58:36,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108307299] [2019-11-19 18:58:36,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043118211] [2019-11-19 18:58:36,295 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:36,369 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-11-19 18:58:36,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:36,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-19 18:58:36,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:36,442 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-11-19 18:58:36,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:36,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 27 [2019-11-19 18:58:36,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849859611] [2019-11-19 18:58:36,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-19 18:58:36,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:36,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-19 18:58:36,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=460, Unknown=0, NotChecked=0, Total=702 [2019-11-19 18:58:36,444 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 27 states. [2019-11-19 18:58:36,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:36,735 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-11-19 18:58:36,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-19 18:58:36,735 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 117 [2019-11-19 18:58:36,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:36,737 INFO L225 Difference]: With dead ends: 72 [2019-11-19 18:58:36,737 INFO L226 Difference]: Without dead ends: 68 [2019-11-19 18:58:36,739 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-19 18:58:36,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-19 18:58:36,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-19 18:58:36,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-19 18:58:36,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-11-19 18:58:36,744 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 117 [2019-11-19 18:58:36,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:36,744 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-11-19 18:58:36,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-19 18:58:36,745 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-11-19 18:58:36,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-19 18:58:36,746 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:36,746 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:36,950 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:36,951 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:36,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:36,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1141244269, now seen corresponding path program 19 times [2019-11-19 18:58:36,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:36,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453933402] [2019-11-19 18:58:36,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-11-19 18:58:37,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453933402] [2019-11-19 18:58:37,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565151594] [2019-11-19 18:58:37,741 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-19 18:58:37,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:37,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-11-19 18:58:37,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:37,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 28 [2019-11-19 18:58:37,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576019238] [2019-11-19 18:58:37,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-19 18:58:37,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:37,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-19 18:58:37,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=492, Unknown=0, NotChecked=0, Total=756 [2019-11-19 18:58:37,875 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 28 states. [2019-11-19 18:58:38,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:38,200 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-11-19 18:58:38,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-19 18:58:38,200 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 123 [2019-11-19 18:58:38,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:38,202 INFO L225 Difference]: With dead ends: 75 [2019-11-19 18:58:38,202 INFO L226 Difference]: Without dead ends: 71 [2019-11-19 18:58:38,204 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-19 18:58:38,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-19 18:58:38,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-19 18:58:38,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-19 18:58:38,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-11-19 18:58:38,209 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 123 [2019-11-19 18:58:38,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:38,210 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-11-19 18:58:38,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-19 18:58:38,210 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-11-19 18:58:38,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-19 18:58:38,211 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:38,211 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:38,414 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:38,415 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:38,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:38,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1280276695, now seen corresponding path program 20 times [2019-11-19 18:58:38,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:38,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696364111] [2019-11-19 18:58:38,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 18:58:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 18:58:38,475 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 18:58:38,476 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 18:58:38,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:58:38 BoogieIcfgContainer [2019-11-19 18:58:38,549 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 18:58:38,549 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 18:58:38,549 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 18:58:38,550 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 18:58:38,550 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:58:18" (3/4) ... [2019-11-19 18:58:38,554 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 18:58:38,682 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 18:58:38,682 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 18:58:38,686 INFO L168 Benchmark]: Toolchain (without parser) took 20907.70 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 461.9 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -131.4 MB). Peak memory consumption was 330.5 MB. Max. memory is 11.5 GB. [2019-11-19 18:58:38,686 INFO L168 Benchmark]: CDTParser took 0.74 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:58:38,687 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.42 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-19 18:58:38,687 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.90 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:58:38,688 INFO L168 Benchmark]: Boogie Preprocessor took 86.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -199.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-19 18:58:38,689 INFO L168 Benchmark]: RCFGBuilder took 228.32 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: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2019-11-19 18:58:38,689 INFO L168 Benchmark]: TraceAbstraction took 20103.39 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 309.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.4 MB). Peak memory consumption was 346.8 MB. Max. memory is 11.5 GB. [2019-11-19 18:58:38,690 INFO L168 Benchmark]: Witness Printer took 133.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:58:38,692 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.74 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 305.42 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.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 40.90 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 86.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -199.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 228.32 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: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20103.39 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 309.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.4 MB). Peak memory consumption was 346.8 MB. Max. memory is 11.5 GB. * Witness Printer took 133.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. 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.0s, 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.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2227 GetRequests, 1642 SyntacticMatches, 0 SemanticMatches, 585 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3493 ImplicationChecksByTransitivity, 7.5s 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.5s 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...