./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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/fibo_2calls_6-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d98587a14b872cd91c7aef8f28f1f51cdacaf3d4 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:11,203 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 18:58:11,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 18:58:11,224 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 18:58:11,225 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 18:58:11,227 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 18:58:11,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 18:58:11,239 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 18:58:11,244 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 18:58:11,248 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 18:58:11,249 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 18:58:11,251 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 18:58:11,251 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 18:58:11,254 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 18:58:11,255 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 18:58:11,257 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 18:58:11,258 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 18:58:11,259 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 18:58:11,262 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 18:58:11,266 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 18:58:11,270 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 18:58:11,273 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 18:58:11,275 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 18:58:11,277 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 18:58:11,279 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 18:58:11,280 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 18:58:11,280 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 18:58:11,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 18:58:11,282 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 18:58:11,283 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 18:58:11,284 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 18:58:11,284 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 18:58:11,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 18:58:11,287 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 18:58:11,289 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 18:58:11,289 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 18:58:11,290 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 18:58:11,290 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 18:58:11,291 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 18:58:11,291 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 18:58:11,293 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 18:58:11,294 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:11,324 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 18:58:11,324 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 18:58:11,326 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 18:58:11,326 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 18:58:11,327 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 18:58:11,327 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 18:58:11,327 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 18:58:11,327 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 18:58:11,328 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 18:58:11,328 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 18:58:11,328 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 18:58:11,329 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 18:58:11,329 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 18:58:11,329 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 18:58:11,329 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 18:58:11,330 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 18:58:11,330 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 18:58:11,330 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 18:58:11,331 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 18:58:11,331 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 18:58:11,331 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 18:58:11,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 18:58:11,332 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 18:58:11,332 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 18:58:11,332 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 18:58:11,333 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 18:58:11,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 18:58:11,333 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 18:58:11,333 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 -> d98587a14b872cd91c7aef8f28f1f51cdacaf3d4 [2019-11-19 18:58:11,655 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 18:58:11,668 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 18:58:11,672 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 18:58:11,673 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 18:58:11,673 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 18:58:11,674 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c [2019-11-19 18:58:11,741 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2fdaf54d/1a4e002f2e92420b92b77695244d6a7e/FLAGbf30dcdac [2019-11-19 18:58:12,180 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 18:58:12,181 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c [2019-11-19 18:58:12,189 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2fdaf54d/1a4e002f2e92420b92b77695244d6a7e/FLAGbf30dcdac [2019-11-19 18:58:12,571 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2fdaf54d/1a4e002f2e92420b92b77695244d6a7e [2019-11-19 18:58:12,575 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 18:58:12,576 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 18:58:12,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 18:58:12,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 18:58:12,583 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 18:58:12,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:58:12" (1/1) ... [2019-11-19 18:58:12,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4094a97d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:12, skipping insertion in model container [2019-11-19 18:58:12,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:58:12" (1/1) ... [2019-11-19 18:58:12,598 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 18:58:12,614 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 18:58:12,817 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:58:12,821 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 18:58:12,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:58:12,857 INFO L192 MainTranslator]: Completed translation [2019-11-19 18:58:12,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:12 WrapperNode [2019-11-19 18:58:12,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 18:58:12,860 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 18:58:12,860 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 18:58:12,860 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 18:58:12,868 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:12" (1/1) ... [2019-11-19 18:58:12,874 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:12" (1/1) ... [2019-11-19 18:58:12,948 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 18:58:12,949 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 18:58:12,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 18:58:12,949 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 18:58:12,957 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:12" (1/1) ... [2019-11-19 18:58:12,958 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:12" (1/1) ... [2019-11-19 18:58:12,959 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:12" (1/1) ... [2019-11-19 18:58:12,959 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:12" (1/1) ... [2019-11-19 18:58:12,961 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:12" (1/1) ... [2019-11-19 18:58:12,964 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:12" (1/1) ... [2019-11-19 18:58:12,965 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:12" (1/1) ... [2019-11-19 18:58:12,966 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 18:58:12,967 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 18:58:12,967 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 18:58:12,967 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 18:58:12,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:12" (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:13,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 18:58:13,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 18:58:13,033 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-11-19 18:58:13,033 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-11-19 18:58:13,033 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-11-19 18:58:13,034 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-11-19 18:58:13,261 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 18:58:13,261 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-19 18:58:13,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:58:13 BoogieIcfgContainer [2019-11-19 18:58:13,264 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 18:58:13,265 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 18:58:13,266 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 18:58:13,272 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 18:58:13,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:58:12" (1/3) ... [2019-11-19 18:58:13,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ece84be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:58:13, skipping insertion in model container [2019-11-19 18:58:13,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:12" (2/3) ... [2019-11-19 18:58:13,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ece84be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:58:13, skipping insertion in model container [2019-11-19 18:58:13,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:58:13" (3/3) ... [2019-11-19 18:58:13,277 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-2.c [2019-11-19 18:58:13,291 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 18:58:13,299 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 18:58:13,329 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 18:58:13,363 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 18:58:13,363 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 18:58:13,363 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 18:58:13,364 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 18:58:13,364 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 18:58:13,364 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 18:58:13,364 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 18:58:13,364 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 18:58:13,382 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-11-19 18:58:13,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-19 18:58:13,387 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:13,388 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:13,388 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:13,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:13,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2019-11-19 18:58:13,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:13,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189326963] [2019-11-19 18:58:13,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:13,638 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:13,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189326963] [2019-11-19 18:58:13,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:58:13,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 18:58:13,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82943949] [2019-11-19 18:58:13,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 18:58:13,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:13,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 18:58:13,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 18:58:13,660 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 7 states. [2019-11-19 18:58:13,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:13,825 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2019-11-19 18:58:13,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 18:58:13,828 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-11-19 18:58:13,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:13,837 INFO L225 Difference]: With dead ends: 38 [2019-11-19 18:58:13,837 INFO L226 Difference]: Without dead ends: 26 [2019-11-19 18:58:13,840 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-19 18:58:13,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-19 18:58:13,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-19 18:58:13,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-19 18:58:13,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-19 18:58:13,881 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2019-11-19 18:58:13,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:13,882 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-19 18:58:13,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 18:58:13,882 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-19 18:58:13,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-19 18:58:13,884 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:13,884 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:13,884 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:13,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:13,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2019-11-19 18:58:13,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:13,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197192090] [2019-11-19 18:58:13,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:13,991 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:13,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197192090] [2019-11-19 18:58:13,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:58:13,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 18:58:13,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436371961] [2019-11-19 18:58:13,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 18:58:13,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:13,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 18:58:13,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 18:58:13,997 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 7 states. [2019-11-19 18:58:14,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:14,073 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-11-19 18:58:14,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 18:58:14,075 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-11-19 18:58:14,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:14,076 INFO L225 Difference]: With dead ends: 32 [2019-11-19 18:58:14,077 INFO L226 Difference]: Without dead ends: 28 [2019-11-19 18:58:14,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-19 18:58:14,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-19 18:58:14,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-11-19 18:58:14,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-19 18:58:14,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-19 18:58:14,088 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2019-11-19 18:58:14,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:14,088 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-19 18:58:14,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 18:58:14,089 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-19 18:58:14,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 18:58:14,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:14,091 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:14,091 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:14,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:14,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2019-11-19 18:58:14,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:14,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785291062] [2019-11-19 18:58:14,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:14,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 18:58:14,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785291062] [2019-11-19 18:58:14,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833611208] [2019-11-19 18:58:14,335 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:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:14,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 18:58:14,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:14,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 18:58:14,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:14,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-11-19 18:58:14,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105173580] [2019-11-19 18:58:14,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 18:58:14,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:14,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 18:58:14,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-19 18:58:14,485 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 12 states. [2019-11-19 18:58:14,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:14,690 INFO L93 Difference]: Finished difference Result 59 states and 83 transitions. [2019-11-19 18:58:14,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 18:58:14,690 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-11-19 18:58:14,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:14,692 INFO L225 Difference]: With dead ends: 59 [2019-11-19 18:58:14,693 INFO L226 Difference]: Without dead ends: 35 [2019-11-19 18:58:14,694 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-19 18:58:14,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-19 18:58:14,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-11-19 18:58:14,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-19 18:58:14,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2019-11-19 18:58:14,705 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 22 [2019-11-19 18:58:14,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:14,706 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-11-19 18:58:14,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 18:58:14,706 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2019-11-19 18:58:14,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 18:58:14,708 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:14,708 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:14,912 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:14,913 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:14,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:14,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1285987244, now seen corresponding path program 1 times [2019-11-19 18:58:14,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:14,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248998169] [2019-11-19 18:58:14,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:15,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 18:58:15,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248998169] [2019-11-19 18:58:15,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287287597] [2019-11-19 18:58:15,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-19 18:58:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:15,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 18:58:15,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:15,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 18:58:15,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:15,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-11-19 18:58:15,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966208024] [2019-11-19 18:58:15,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 18:58:15,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:15,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 18:58:15,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-19 18:58:15,225 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 12 states. [2019-11-19 18:58:15,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:15,470 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2019-11-19 18:58:15,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 18:58:15,470 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-11-19 18:58:15,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:15,474 INFO L225 Difference]: With dead ends: 55 [2019-11-19 18:58:15,474 INFO L226 Difference]: Without dead ends: 51 [2019-11-19 18:58:15,475 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-19 18:58:15,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-19 18:58:15,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-11-19 18:58:15,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-19 18:58:15,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2019-11-19 18:58:15,488 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 23 [2019-11-19 18:58:15,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:15,489 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2019-11-19 18:58:15,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 18:58:15,489 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2019-11-19 18:58:15,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-19 18:58:15,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:15,492 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:15,702 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:15,703 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:15,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:15,705 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2019-11-19 18:58:15,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:15,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656710047] [2019-11-19 18:58:15,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-19 18:58:15,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656710047] [2019-11-19 18:58:15,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404212055] [2019-11-19 18:58:15,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:15,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 18:58:15,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:16,072 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-19 18:58:16,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:16,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2019-11-19 18:58:16,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365296112] [2019-11-19 18:58:16,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-19 18:58:16,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:16,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-19 18:58:16,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-11-19 18:58:16,076 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand 14 states. [2019-11-19 18:58:16,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:16,509 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2019-11-19 18:58:16,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-19 18:58:16,509 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2019-11-19 18:58:16,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:16,512 INFO L225 Difference]: With dead ends: 114 [2019-11-19 18:58:16,516 INFO L226 Difference]: Without dead ends: 68 [2019-11-19 18:58:16,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-11-19 18:58:16,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-19 18:58:16,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-19 18:58:16,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-19 18:58:16,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2019-11-19 18:58:16,535 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 35 [2019-11-19 18:58:16,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:16,536 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2019-11-19 18:58:16,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-19 18:58:16,536 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2019-11-19 18:58:16,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-19 18:58:16,539 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:16,539 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:16,742 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:16,746 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:16,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:16,747 INFO L82 PathProgramCache]: Analyzing trace with hash 2000747716, now seen corresponding path program 1 times [2019-11-19 18:58:16,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:16,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039560305] [2019-11-19 18:58:16,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:16,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:16,867 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-19 18:58:16,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039560305] [2019-11-19 18:58:16,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969780035] [2019-11-19 18:58:16,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:16,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 18:58:16,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:16,999 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-19 18:58:16,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:16,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-11-19 18:58:17,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981040090] [2019-11-19 18:58:17,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-19 18:58:17,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:17,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-19 18:58:17,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-19 18:58:17,003 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand 14 states. [2019-11-19 18:58:17,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:17,338 INFO L93 Difference]: Finished difference Result 147 states and 239 transitions. [2019-11-19 18:58:17,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 18:58:17,339 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2019-11-19 18:58:17,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:17,342 INFO L225 Difference]: With dead ends: 147 [2019-11-19 18:58:17,342 INFO L226 Difference]: Without dead ends: 83 [2019-11-19 18:58:17,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-11-19 18:58:17,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-19 18:58:17,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 66. [2019-11-19 18:58:17,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-19 18:58:17,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 96 transitions. [2019-11-19 18:58:17,362 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 96 transitions. Word has length 36 [2019-11-19 18:58:17,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:17,363 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 96 transitions. [2019-11-19 18:58:17,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-19 18:58:17,365 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 96 transitions. [2019-11-19 18:58:17,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-19 18:58:17,371 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:17,371 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:17,572 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:17,573 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:17,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:17,573 INFO L82 PathProgramCache]: Analyzing trace with hash -434541687, now seen corresponding path program 1 times [2019-11-19 18:58:17,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:17,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322198790] [2019-11-19 18:58:17,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:17,875 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-19 18:58:17,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322198790] [2019-11-19 18:58:17,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643328331] [2019-11-19 18:58:17,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:17,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 18:58:17,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:18,005 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-19 18:58:18,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:18,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 18 [2019-11-19 18:58:18,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878946433] [2019-11-19 18:58:18,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-19 18:58:18,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:18,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-19 18:58:18,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-11-19 18:58:18,008 INFO L87 Difference]: Start difference. First operand 66 states and 96 transitions. Second operand 18 states. [2019-11-19 18:58:18,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:18,554 INFO L93 Difference]: Finished difference Result 164 states and 279 transitions. [2019-11-19 18:58:18,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-19 18:58:18,555 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2019-11-19 18:58:18,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:18,558 INFO L225 Difference]: With dead ends: 164 [2019-11-19 18:58:18,558 INFO L226 Difference]: Without dead ends: 100 [2019-11-19 18:58:18,560 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2019-11-19 18:58:18,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-19 18:58:18,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2019-11-19 18:58:18,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-19 18:58:18,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 145 transitions. [2019-11-19 18:58:18,579 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 145 transitions. Word has length 50 [2019-11-19 18:58:18,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:18,580 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 145 transitions. [2019-11-19 18:58:18,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-19 18:58:18,580 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 145 transitions. [2019-11-19 18:58:18,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-19 18:58:18,584 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:18,584 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:18,788 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:18,789 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:18,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:18,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1917551255, now seen corresponding path program 1 times [2019-11-19 18:58:18,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:18,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953904193] [2019-11-19 18:58:18,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:19,258 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 33 proven. 58 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-19 18:58:19,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953904193] [2019-11-19 18:58:19,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656716464] [2019-11-19 18:58:19,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:19,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 18:58:19,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:19,461 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 13 proven. 90 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-19 18:58:19,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:19,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 20 [2019-11-19 18:58:19,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821019749] [2019-11-19 18:58:19,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-19 18:58:19,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:19,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-19 18:58:19,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2019-11-19 18:58:19,466 INFO L87 Difference]: Start difference. First operand 89 states and 145 transitions. Second operand 20 states. [2019-11-19 18:58:20,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:20,136 INFO L93 Difference]: Finished difference Result 207 states and 388 transitions. [2019-11-19 18:58:20,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-19 18:58:20,137 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 91 [2019-11-19 18:58:20,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:20,140 INFO L225 Difference]: With dead ends: 207 [2019-11-19 18:58:20,141 INFO L226 Difference]: Without dead ends: 114 [2019-11-19 18:58:20,143 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=783, Unknown=0, NotChecked=0, Total=930 [2019-11-19 18:58:20,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-19 18:58:20,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 88. [2019-11-19 18:58:20,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-19 18:58:20,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 135 transitions. [2019-11-19 18:58:20,161 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 135 transitions. Word has length 91 [2019-11-19 18:58:20,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:20,161 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 135 transitions. [2019-11-19 18:58:20,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-19 18:58:20,161 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 135 transitions. [2019-11-19 18:58:20,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-19 18:58:20,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:20,164 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:20,368 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:20,368 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:20,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:20,369 INFO L82 PathProgramCache]: Analyzing trace with hash -463941571, now seen corresponding path program 1 times [2019-11-19 18:58:20,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:20,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815641440] [2019-11-19 18:58:20,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,797 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 53 proven. 117 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-11-19 18:58:20,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815641440] [2019-11-19 18:58:20,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573430754] [2019-11-19 18:58:20,799 INFO L94 rtionOrderModulation]: Keeping assertion order 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:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:20,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 18:58:20,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:20,984 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 48 proven. 89 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2019-11-19 18:58:20,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:20,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 20 [2019-11-19 18:58:20,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498378435] [2019-11-19 18:58:20,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-19 18:58:20,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:20,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-19 18:58:20,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-11-19 18:58:20,990 INFO L87 Difference]: Start difference. First operand 88 states and 135 transitions. Second operand 20 states. [2019-11-19 18:58:21,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:21,529 INFO L93 Difference]: Finished difference Result 209 states and 348 transitions. [2019-11-19 18:58:21,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-19 18:58:21,530 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 119 [2019-11-19 18:58:21,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:21,533 INFO L225 Difference]: With dead ends: 209 [2019-11-19 18:58:21,533 INFO L226 Difference]: Without dead ends: 121 [2019-11-19 18:58:21,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2019-11-19 18:58:21,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-19 18:58:21,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2019-11-19 18:58:21,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-19 18:58:21,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 175 transitions. [2019-11-19 18:58:21,556 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 175 transitions. Word has length 119 [2019-11-19 18:58:21,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:21,557 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 175 transitions. [2019-11-19 18:58:21,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-19 18:58:21,557 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 175 transitions. [2019-11-19 18:58:21,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-19 18:58:21,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:21,560 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 11, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:21,764 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:21,765 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:21,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:21,765 INFO L82 PathProgramCache]: Analyzing trace with hash 332281067, now seen corresponding path program 2 times [2019-11-19 18:58:21,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:21,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153505452] [2019-11-19 18:58:21,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:22,459 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 311 proven. 245 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-11-19 18:58:22,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153505452] [2019-11-19 18:58:22,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887528422] [2019-11-19 18:58:22,460 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:22,548 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 18:58:22,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:22,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 18:58:22,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:22,728 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 89 proven. 154 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2019-11-19 18:58:22,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:22,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 9] total 29 [2019-11-19 18:58:22,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692553655] [2019-11-19 18:58:22,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-19 18:58:22,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:22,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-19 18:58:22,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2019-11-19 18:58:22,738 INFO L87 Difference]: Start difference. First operand 111 states and 175 transitions. Second operand 29 states. [2019-11-19 18:58:23,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:23,710 INFO L93 Difference]: Finished difference Result 233 states and 404 transitions. [2019-11-19 18:58:23,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-19 18:58:23,710 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 188 [2019-11-19 18:58:23,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:23,713 INFO L225 Difference]: With dead ends: 233 [2019-11-19 18:58:23,714 INFO L226 Difference]: Without dead ends: 113 [2019-11-19 18:58:23,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=247, Invalid=1733, Unknown=0, NotChecked=0, Total=1980 [2019-11-19 18:58:23,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-19 18:58:23,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 97. [2019-11-19 18:58:23,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-19 18:58:23,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 131 transitions. [2019-11-19 18:58:23,728 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 131 transitions. Word has length 188 [2019-11-19 18:58:23,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:23,729 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 131 transitions. [2019-11-19 18:58:23,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-19 18:58:23,729 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 131 transitions. [2019-11-19 18:58:23,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-19 18:58:23,731 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:23,731 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:23,942 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:23,943 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:23,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:23,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1392033305, now seen corresponding path program 3 times [2019-11-19 18:58:23,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:23,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687025012] [2019-11-19 18:58:23,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,348 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 170 proven. 127 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-11-19 18:58:24,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687025012] [2019-11-19 18:58:24,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662721012] [2019-11-19 18:58:24,349 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:24,393 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-19 18:58:24,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:24,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 18:58:24,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:24,482 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 110 proven. 28 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2019-11-19 18:58:24,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:24,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 21 [2019-11-19 18:58:24,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330073914] [2019-11-19 18:58:24,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-19 18:58:24,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:24,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-19 18:58:24,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2019-11-19 18:58:24,487 INFO L87 Difference]: Start difference. First operand 97 states and 131 transitions. Second operand 21 states. [2019-11-19 18:58:24,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:24,981 INFO L93 Difference]: Finished difference Result 221 states and 330 transitions. [2019-11-19 18:58:24,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-19 18:58:24,981 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 147 [2019-11-19 18:58:24,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:24,984 INFO L225 Difference]: With dead ends: 221 [2019-11-19 18:58:24,984 INFO L226 Difference]: Without dead ends: 129 [2019-11-19 18:58:24,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2019-11-19 18:58:24,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-19 18:58:25,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 109. [2019-11-19 18:58:25,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-19 18:58:25,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 148 transitions. [2019-11-19 18:58:25,009 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 148 transitions. Word has length 147 [2019-11-19 18:58:25,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:25,013 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 148 transitions. [2019-11-19 18:58:25,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-19 18:58:25,013 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 148 transitions. [2019-11-19 18:58:25,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-19 18:58:25,022 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:25,022 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 12, 11, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:25,228 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:25,229 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:25,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:25,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1543071082, now seen corresponding path program 4 times [2019-11-19 18:58:25,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:25,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896659631] [2019-11-19 18:58:25,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:26,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 146 proven. 332 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-11-19 18:58:26,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896659631] [2019-11-19 18:58:26,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796235886] [2019-11-19 18:58:26,032 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,111 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 18:58:26,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:26,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-19 18:58:26,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:26,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 160 proven. 177 refuted. 0 times theorem prover too weak. 736 trivial. 0 not checked. [2019-11-19 18:58:26,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:26,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11] total 27 [2019-11-19 18:58:26,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981021246] [2019-11-19 18:58:26,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-19 18:58:26,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:26,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-19 18:58:26,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2019-11-19 18:58:26,266 INFO L87 Difference]: Start difference. First operand 109 states and 148 transitions. Second operand 27 states. [2019-11-19 18:58:27,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:27,318 INFO L93 Difference]: Finished difference Result 284 states and 454 transitions. [2019-11-19 18:58:27,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-19 18:58:27,319 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 200 [2019-11-19 18:58:27,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:27,323 INFO L225 Difference]: With dead ends: 284 [2019-11-19 18:58:27,323 INFO L226 Difference]: Without dead ends: 150 [2019-11-19 18:58:27,325 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=192, Invalid=1140, Unknown=0, NotChecked=0, Total=1332 [2019-11-19 18:58:27,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-19 18:58:27,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 123. [2019-11-19 18:58:27,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-19 18:58:27,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 167 transitions. [2019-11-19 18:58:27,336 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 167 transitions. Word has length 200 [2019-11-19 18:58:27,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:27,336 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 167 transitions. [2019-11-19 18:58:27,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-19 18:58:27,337 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 167 transitions. [2019-11-19 18:58:27,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-19 18:58:27,339 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:27,339 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:27,544 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:27,545 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:27,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:27,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1112792143, now seen corresponding path program 5 times [2019-11-19 18:58:27,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:27,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036779976] [2019-11-19 18:58:27,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 18:58:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 18:58:27,616 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 18:58:27,616 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 18:58:27,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:58:27 BoogieIcfgContainer [2019-11-19 18:58:27,697 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 18:58:27,698 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 18:58:27,698 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 18:58:27,698 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 18:58:27,698 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:13" (3/4) ... [2019-11-19 18:58:27,701 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 18:58:27,790 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 18:58:27,791 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 18:58:27,793 INFO L168 Benchmark]: Toolchain (without parser) took 15216.35 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 372.8 MB). Free memory was 961.7 MB in the beginning and 902.4 MB in the end (delta: 59.3 MB). Peak memory consumption was 432.1 MB. Max. memory is 11.5 GB. [2019-11-19 18:58:27,794 INFO L168 Benchmark]: CDTParser took 0.18 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:27,794 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.12 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 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:27,795 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -158.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-19 18:58:27,796 INFO L168 Benchmark]: Boogie Preprocessor took 17.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-19 18:58:27,796 INFO L168 Benchmark]: RCFGBuilder took 297.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-11-19 18:58:27,797 INFO L168 Benchmark]: TraceAbstraction took 14432.17 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 259.5 MB). Free memory was 1.1 GB in the beginning and 902.4 MB in the end (delta: 186.6 MB). Peak memory consumption was 446.1 MB. Max. memory is 11.5 GB. [2019-11-19 18:58:27,797 INFO L168 Benchmark]: Witness Printer took 93.31 ms. Allocated memory is still 1.4 GB. Free memory is still 902.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:58:27,800 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.18 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 281.12 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 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 88.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -158.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 297.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14432.17 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 259.5 MB). Free memory was 1.1 GB in the beginning and 902.4 MB in the end (delta: 186.6 MB). Peak memory consumption was 446.1 MB. Max. memory is 11.5 GB. * Witness Printer took 93.31 ms. Allocated memory is still 1.4 GB. Free memory is still 902.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 6; [L37] CALL, EXPR fibo1(x) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) [L37] int result = fibo1(x); [L38] COND TRUE result == 8 [L39] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Result: UNSAFE, OverallTime: 14.3s, OverallIterations: 13, TraceHistogramMax: 15, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 315 SDtfs, 670 SDslu, 2763 SDs, 0 SdLazy, 4941 SolverSat, 674 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1418 GetRequests, 1161 SyntacticMatches, 1 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1257 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=12, 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, 12 MinimizatonAttempts, 136 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 2014 NumberOfCodeBlocks, 1888 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1819 ConstructedInterpolants, 0 QuantifiedInterpolants, 436701 SizeOfPredicates, 45 NumberOfNonLiveVariables, 1750 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 22 InterpolantComputations, 2 PerfectInterpolantSequences, 4906/6398 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...