./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Ackermann01-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Ackermann01-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 c2f1e635c5c806286d01eb0b8ff07448b8253a7a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 17:28:05,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:28:05,831 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:28:05,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:28:05,843 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:28:05,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:28:05,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:28:05,848 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:28:05,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:28:05,851 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:28:05,853 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:28:05,854 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:28:05,859 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:28:05,860 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:28:05,863 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:28:05,865 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:28:05,866 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:28:05,871 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:28:05,874 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:28:05,877 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:28:05,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:28:05,885 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:28:05,887 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:28:05,889 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:28:05,893 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:28:05,895 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:28:05,896 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:28:05,897 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:28:05,898 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:28:05,899 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:28:05,900 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:28:05,901 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:28:05,902 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:28:05,903 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:28:05,907 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:28:05,908 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:28:05,909 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:28:05,909 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:28:05,910 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:28:05,914 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:28:05,916 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:28:05,917 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:28:05,933 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:28:05,934 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:28:05,936 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:28:05,937 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:28:05,937 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:28:05,938 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:28:05,938 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:28:05,938 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:28:05,938 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:28:05,939 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:28:05,940 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:28:05,940 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:28:05,940 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:28:05,941 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:28:05,941 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:28:05,942 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:28:05,942 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:28:05,942 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:28:05,942 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:28:05,943 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:28:05,943 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:28:05,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:28:05,944 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:28:05,944 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:28:05,944 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:28:05,944 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:28:05,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:28:05,945 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:28:05,945 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:28:05,945 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 -> c2f1e635c5c806286d01eb0b8ff07448b8253a7a [2019-11-28 17:28:06,315 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:28:06,338 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:28:06,342 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:28:06,344 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:28:06,344 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:28:06,345 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Ackermann01-2.c [2019-11-28 17:28:06,415 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/396ec579c/b10b6df6762f41e2adcfb8de9c663b2b/FLAG0f0dbf43b [2019-11-28 17:28:06,902 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:28:06,903 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann01-2.c [2019-11-28 17:28:06,910 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/396ec579c/b10b6df6762f41e2adcfb8de9c663b2b/FLAG0f0dbf43b [2019-11-28 17:28:07,261 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/396ec579c/b10b6df6762f41e2adcfb8de9c663b2b [2019-11-28 17:28:07,264 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:28:07,267 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:28:07,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:28:07,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:28:07,272 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:28:07,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:28:07" (1/1) ... [2019-11-28 17:28:07,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@630bb98c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:07, skipping insertion in model container [2019-11-28 17:28:07,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:28:07" (1/1) ... [2019-11-28 17:28:07,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:28:07,303 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:28:07,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:28:07,470 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:28:07,487 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:28:07,498 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:28:07,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:07 WrapperNode [2019-11-28 17:28:07,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:28:07,499 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:28:07,499 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:28:07,499 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:28:07,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:07" (1/1) ... [2019-11-28 17:28:07,513 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:07" (1/1) ... [2019-11-28 17:28:07,584 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:28:07,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:28:07,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:28:07,585 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:28:07,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:07" (1/1) ... [2019-11-28 17:28:07,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:07" (1/1) ... [2019-11-28 17:28:07,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:07" (1/1) ... [2019-11-28 17:28:07,594 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:07" (1/1) ... [2019-11-28 17:28:07,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:07" (1/1) ... [2019-11-28 17:28:07,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:07" (1/1) ... [2019-11-28 17:28:07,605 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:07" (1/1) ... [2019-11-28 17:28:07,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:28:07,609 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:28:07,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:28:07,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:28:07,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:28:07,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:28:07,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:28:07,673 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2019-11-28 17:28:07,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2019-11-28 17:28:07,870 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:28:07,870 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 17:28:07,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:28:07 BoogieIcfgContainer [2019-11-28 17:28:07,872 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:28:07,873 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:28:07,873 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:28:07,877 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:28:07,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:28:07" (1/3) ... [2019-11-28 17:28:07,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2621dcf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:28:07, skipping insertion in model container [2019-11-28 17:28:07,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:07" (2/3) ... [2019-11-28 17:28:07,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2621dcf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:28:07, skipping insertion in model container [2019-11-28 17:28:07,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:28:07" (3/3) ... [2019-11-28 17:28:07,882 INFO L109 eAbstractionObserver]: Analyzing ICFG Ackermann01-2.c [2019-11-28 17:28:07,898 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:28:07,917 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 17:28:07,934 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 17:28:07,967 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:28:07,968 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:28:07,968 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:28:07,968 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:28:07,968 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:28:07,969 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:28:07,969 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:28:07,969 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:28:07,989 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-11-28 17:28:07,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 17:28:07,997 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:07,998 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:07,999 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:08,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:08,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1260755674, now seen corresponding path program 1 times [2019-11-28 17:28:08,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:08,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223568426] [2019-11-28 17:28:08,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:08,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:28:08,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223568426] [2019-11-28 17:28:08,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:28:08,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 17:28:08,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694636744] [2019-11-28 17:28:08,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 17:28:08,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:08,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 17:28:08,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:28:08,301 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 7 states. [2019-11-28 17:28:08,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:08,521 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2019-11-28 17:28:08,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 17:28:08,524 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-11-28 17:28:08,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:08,536 INFO L225 Difference]: With dead ends: 37 [2019-11-28 17:28:08,536 INFO L226 Difference]: Without dead ends: 21 [2019-11-28 17:28:08,540 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-28 17:28:08,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-28 17:28:08,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-28 17:28:08,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 17:28:08,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2019-11-28 17:28:08,593 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 11 [2019-11-28 17:28:08,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:08,594 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-11-28 17:28:08,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 17:28:08,595 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2019-11-28 17:28:08,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 17:28:08,597 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:08,597 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:08,598 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:08,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:08,598 INFO L82 PathProgramCache]: Analyzing trace with hash 963920485, now seen corresponding path program 1 times [2019-11-28 17:28:08,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:08,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664394927] [2019-11-28 17:28:08,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:08,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 17:28:08,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664394927] [2019-11-28 17:28:08,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:28:08,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 17:28:08,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993565441] [2019-11-28 17:28:08,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 17:28:08,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:08,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 17:28:08,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:28:08,803 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 8 states. [2019-11-28 17:28:09,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:09,012 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2019-11-28 17:28:09,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:28:09,013 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-11-28 17:28:09,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:09,015 INFO L225 Difference]: With dead ends: 28 [2019-11-28 17:28:09,015 INFO L226 Difference]: Without dead ends: 24 [2019-11-28 17:28:09,017 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-28 17:28:09,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-28 17:28:09,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-11-28 17:28:09,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 17:28:09,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-11-28 17:28:09,026 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 18 [2019-11-28 17:28:09,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:09,026 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-11-28 17:28:09,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 17:28:09,027 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2019-11-28 17:28:09,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 17:28:09,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:09,029 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:09,029 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:09,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:09,030 INFO L82 PathProgramCache]: Analyzing trace with hash -193744714, now seen corresponding path program 1 times [2019-11-28 17:28:09,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:09,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681978478] [2019-11-28 17:28:09,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:09,134 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 17:28:09,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681978478] [2019-11-28 17:28:09,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866499480] [2019-11-28 17:28:09,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 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:09,184 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 17:28:09,191 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:09,282 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 17:28:09,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:09,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2019-11-28 17:28:09,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938503859] [2019-11-28 17:28:09,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 17:28:09,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:09,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 17:28:09,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 17:28:09,285 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 10 states. [2019-11-28 17:28:09,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:09,470 INFO L93 Difference]: Finished difference Result 47 states and 74 transitions. [2019-11-28 17:28:09,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:28:09,472 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-11-28 17:28:09,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:09,476 INFO L225 Difference]: With dead ends: 47 [2019-11-28 17:28:09,476 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 17:28:09,479 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-28 17:28:09,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 17:28:09,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2019-11-28 17:28:09,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 17:28:09,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2019-11-28 17:28:09,498 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 24 [2019-11-28 17:28:09,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:09,499 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-11-28 17:28:09,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 17:28:09,499 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2019-11-28 17:28:09,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 17:28:09,506 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:09,506 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:09,715 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:09,715 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:09,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:09,716 INFO L82 PathProgramCache]: Analyzing trace with hash 416247163, now seen corresponding path program 1 times [2019-11-28 17:28:09,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:09,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368295374] [2019-11-28 17:28:09,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:09,987 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-28 17:28:09,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368295374] [2019-11-28 17:28:09,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354992834] [2019-11-28 17:28:09,988 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:10,031 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 17:28:10,033 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:10,070 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 17:28:10,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:10,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2019-11-28 17:28:10,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847538519] [2019-11-28 17:28:10,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 17:28:10,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:10,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 17:28:10,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-28 17:28:10,073 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand 14 states. [2019-11-28 17:28:10,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:10,649 INFO L93 Difference]: Finished difference Result 50 states and 83 transitions. [2019-11-28 17:28:10,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 17:28:10,650 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-11-28 17:28:10,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:10,657 INFO L225 Difference]: With dead ends: 50 [2019-11-28 17:28:10,657 INFO L226 Difference]: Without dead ends: 46 [2019-11-28 17:28:10,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2019-11-28 17:28:10,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-28 17:28:10,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 32. [2019-11-28 17:28:10,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 17:28:10,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions. [2019-11-28 17:28:10,685 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 49 transitions. Word has length 31 [2019-11-28 17:28:10,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:10,685 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 49 transitions. [2019-11-28 17:28:10,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 17:28:10,685 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 49 transitions. [2019-11-28 17:28:10,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 17:28:10,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:10,688 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:10,891 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:10,892 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:10,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:10,893 INFO L82 PathProgramCache]: Analyzing trace with hash -781004688, now seen corresponding path program 2 times [2019-11-28 17:28:10,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:10,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632647060] [2019-11-28 17:28:10,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:11,158 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-28 17:28:11,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632647060] [2019-11-28 17:28:11,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020336389] [2019-11-28 17:28:11,160 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:11,213 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:28:11,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:11,215 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 17:28:11,218 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:11,266 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-28 17:28:11,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:11,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 15 [2019-11-28 17:28:11,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027864101] [2019-11-28 17:28:11,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 17:28:11,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:11,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 17:28:11,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-11-28 17:28:11,271 INFO L87 Difference]: Start difference. First operand 32 states and 49 transitions. Second operand 15 states. [2019-11-28 17:28:11,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:11,783 INFO L93 Difference]: Finished difference Result 61 states and 112 transitions. [2019-11-28 17:28:11,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 17:28:11,784 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2019-11-28 17:28:11,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:11,787 INFO L225 Difference]: With dead ends: 61 [2019-11-28 17:28:11,787 INFO L226 Difference]: Without dead ends: 57 [2019-11-28 17:28:11,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2019-11-28 17:28:11,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-28 17:28:11,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 30. [2019-11-28 17:28:11,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 17:28:11,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2019-11-28 17:28:11,804 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 38 [2019-11-28 17:28:11,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:11,805 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2019-11-28 17:28:11,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 17:28:11,805 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2019-11-28 17:28:11,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 17:28:11,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:11,807 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:12,010 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:12,014 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:12,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:12,015 INFO L82 PathProgramCache]: Analyzing trace with hash 947442768, now seen corresponding path program 3 times [2019-11-28 17:28:12,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:12,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542395198] [2019-11-28 17:28:12,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:12,294 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 17:28:12,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542395198] [2019-11-28 17:28:12,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224460498] [2019-11-28 17:28:12,296 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:12,338 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 17:28:12,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:12,340 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 17:28:12,342 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:12,645 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-28 17:28:12,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:12,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2019-11-28 17:28:12,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489247421] [2019-11-28 17:28:12,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 17:28:12,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:12,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 17:28:12,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2019-11-28 17:28:12,648 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 21 states. [2019-11-28 17:28:13,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:13,194 INFO L93 Difference]: Finished difference Result 80 states and 152 transitions. [2019-11-28 17:28:13,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 17:28:13,195 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2019-11-28 17:28:13,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:13,197 INFO L225 Difference]: With dead ends: 80 [2019-11-28 17:28:13,198 INFO L226 Difference]: Without dead ends: 52 [2019-11-28 17:28:13,200 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2019-11-28 17:28:13,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-28 17:28:13,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2019-11-28 17:28:13,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 17:28:13,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 71 transitions. [2019-11-28 17:28:13,213 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 71 transitions. Word has length 38 [2019-11-28 17:28:13,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:13,214 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 71 transitions. [2019-11-28 17:28:13,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 17:28:13,215 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 71 transitions. [2019-11-28 17:28:13,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-28 17:28:13,217 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:13,218 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:13,429 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:13,430 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:13,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:13,431 INFO L82 PathProgramCache]: Analyzing trace with hash 2112206418, now seen corresponding path program 4 times [2019-11-28 17:28:13,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:13,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459878987] [2019-11-28 17:28:13,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,846 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 63 proven. 57 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-28 17:28:13,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459878987] [2019-11-28 17:28:13,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881647843] [2019-11-28 17:28:13,847 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:13,899 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 17:28:13,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:13,901 INFO L264 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 17:28:13,905 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:14,056 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 86 proven. 35 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-28 17:28:14,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:14,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9] total 26 [2019-11-28 17:28:14,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495883677] [2019-11-28 17:28:14,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-28 17:28:14,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:14,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-28 17:28:14,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-11-28 17:28:14,059 INFO L87 Difference]: Start difference. First operand 42 states and 71 transitions. Second operand 26 states. [2019-11-28 17:28:15,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:15,731 INFO L93 Difference]: Finished difference Result 147 states and 385 transitions. [2019-11-28 17:28:15,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-28 17:28:15,732 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 64 [2019-11-28 17:28:15,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:15,736 INFO L225 Difference]: With dead ends: 147 [2019-11-28 17:28:15,736 INFO L226 Difference]: Without dead ends: 109 [2019-11-28 17:28:15,739 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=528, Invalid=2124, Unknown=0, NotChecked=0, Total=2652 [2019-11-28 17:28:15,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-28 17:28:15,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2019-11-28 17:28:15,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-28 17:28:15,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 182 transitions. [2019-11-28 17:28:15,764 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 182 transitions. Word has length 64 [2019-11-28 17:28:15,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:15,764 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 182 transitions. [2019-11-28 17:28:15,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-28 17:28:15,765 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 182 transitions. [2019-11-28 17:28:15,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-28 17:28:15,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:15,771 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 10, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:15,983 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:15,984 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:15,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:15,985 INFO L82 PathProgramCache]: Analyzing trace with hash -2068462442, now seen corresponding path program 5 times [2019-11-28 17:28:15,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:15,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320009767] [2019-11-28 17:28:15,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:16,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:16,543 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 230 proven. 184 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-11-28 17:28:16,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320009767] [2019-11-28 17:28:16,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273462365] [2019-11-28 17:28:16,545 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:16,629 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-28 17:28:16,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:16,630 INFO L264 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-28 17:28:16,651 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:16,739 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 333 proven. 114 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2019-11-28 17:28:16,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:16,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14] total 24 [2019-11-28 17:28:16,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144323586] [2019-11-28 17:28:16,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-28 17:28:16,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:16,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-28 17:28:16,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2019-11-28 17:28:16,743 INFO L87 Difference]: Start difference. First operand 90 states and 182 transitions. Second operand 24 states. [2019-11-28 17:28:18,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:18,144 INFO L93 Difference]: Finished difference Result 224 states and 654 transitions. [2019-11-28 17:28:18,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-28 17:28:18,144 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 117 [2019-11-28 17:28:18,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:18,145 INFO L225 Difference]: With dead ends: 224 [2019-11-28 17:28:18,146 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 17:28:18,151 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=533, Invalid=2437, Unknown=0, NotChecked=0, Total=2970 [2019-11-28 17:28:18,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 17:28:18,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 17:28:18,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 17:28:18,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 17:28:18,153 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 117 [2019-11-28 17:28:18,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:18,153 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 17:28:18,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-28 17:28:18,154 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 17:28:18,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 17:28:18,359 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:18,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 17:28:19,482 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 25 [2019-11-28 17:28:19,579 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 17:28:19,579 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 17:28:19,579 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 17:28:19,579 INFO L246 CegarLoopResult]: For program point L28(lines 28 32) no Hoare annotation was computed. [2019-11-28 17:28:19,580 INFO L249 CegarLoopResult]: At program point L26(lines 26 46) the Hoare annotation is: true [2019-11-28 17:28:19,580 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2019-11-28 17:28:19,580 INFO L246 CegarLoopResult]: For program point L44(line 44) no Hoare annotation was computed. [2019-11-28 17:28:19,580 INFO L246 CegarLoopResult]: For program point L41(lines 41 45) no Hoare annotation was computed. [2019-11-28 17:28:19,580 INFO L242 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (<= 0 ULTIMATE.start_main_~n~0) [2019-11-28 17:28:19,581 INFO L246 CegarLoopResult]: For program point L40-1(line 40) no Hoare annotation was computed. [2019-11-28 17:28:19,582 INFO L246 CegarLoopResult]: For program point L34(lines 34 39) no Hoare annotation was computed. [2019-11-28 17:28:19,582 INFO L246 CegarLoopResult]: For program point ackermannEXIT(lines 15 23) no Hoare annotation was computed. [2019-11-28 17:28:19,582 INFO L242 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|) (not (= ackermann_~m 0))) [2019-11-28 17:28:19,582 INFO L249 CegarLoopResult]: At program point ackermannENTRY(lines 15 23) the Hoare annotation is: true [2019-11-28 17:28:19,582 INFO L246 CegarLoopResult]: For program point L22-1(line 22) no Hoare annotation was computed. [2019-11-28 17:28:19,582 INFO L242 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (= |ackermann_#in~n| 0) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|) (not (= ackermann_~m 0))) [2019-11-28 17:28:19,583 INFO L242 CegarLoopResult]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse1 (= ackermann_~m |ackermann_#in~m|)) (.cse2 (= ackermann_~n |ackermann_#in~n|)) (.cse3 (not (= ackermann_~m 0)))) (let ((.cse0 (and (<= 3 |ackermann_#t~ret1|) .cse1 .cse2 .cse3))) (and (<= 0 |ackermann_#in~m|) (not (<= |ackermann_#in~n| 0)) (or .cse0 (and .cse1 .cse2 (<= |ackermann_#in~m| 1) .cse3 (<= 2 |ackermann_#t~ret1|))) (or (<= |ackermann_#in~n| 1) .cse0)))) [2019-11-28 17:28:19,583 INFO L246 CegarLoopResult]: For program point L19(lines 19 21) no Hoare annotation was computed. [2019-11-28 17:28:19,583 INFO L246 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-11-28 17:28:19,583 INFO L246 CegarLoopResult]: For program point L22-3(line 22) no Hoare annotation was computed. [2019-11-28 17:28:19,583 INFO L246 CegarLoopResult]: For program point L16(lines 16 18) no Hoare annotation was computed. [2019-11-28 17:28:19,583 INFO L246 CegarLoopResult]: For program point ackermannFINAL(lines 15 23) no Hoare annotation was computed. [2019-11-28 17:28:19,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:28:19 BoogieIcfgContainer [2019-11-28 17:28:19,598 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:28:19,599 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:28:19,599 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:28:19,599 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:28:19,600 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:28:07" (3/4) ... [2019-11-28 17:28:19,606 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 17:28:19,614 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ackermann [2019-11-28 17:28:19,625 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 17:28:19,625 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 17:28:19,726 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:28:19,727 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:28:19,729 INFO L168 Benchmark]: Toolchain (without parser) took 12462.70 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 309.3 MB). Free memory was 957.7 MB in the beginning and 975.0 MB in the end (delta: -17.3 MB). Peak memory consumption was 292.0 MB. Max. memory is 11.5 GB. [2019-11-28 17:28:19,732 INFO L168 Benchmark]: CDTParser took 0.94 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:28:19,734 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.00 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:28:19,735 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -191.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:28:19,737 INFO L168 Benchmark]: Boogie Preprocessor took 23.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:28:19,740 INFO L168 Benchmark]: RCFGBuilder took 262.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. [2019-11-28 17:28:19,741 INFO L168 Benchmark]: TraceAbstraction took 11725.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.8 MB). Free memory was 1.1 GB in the beginning and 975.0 MB in the end (delta: 145.6 MB). Peak memory consumption was 313.3 MB. Max. memory is 11.5 GB. [2019-11-28 17:28:19,742 INFO L168 Benchmark]: Witness Printer took 128.04 ms. Allocated memory is still 1.3 GB. Free memory was 975.0 MB in the beginning and 975.0 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-28 17:28:19,751 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.94 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 231.00 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 85.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -191.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 262.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11725.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.8 MB). Free memory was 1.1 GB in the beginning and 975.0 MB in the end (delta: 145.6 MB). Peak memory consumption was 313.3 MB. Max. memory is 11.5 GB. * Witness Printer took 128.04 ms. Allocated memory is still 1.3 GB. Free memory was 975.0 MB in the beginning and 975.0 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 1 error locations. Result: SAFE, OverallTime: 10.3s, OverallIterations: 8, TraceHistogramMax: 17, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, HoareTripleCheckerStatistics: 145 SDtfs, 330 SDslu, 779 SDs, 0 SdLazy, 2759 SolverSat, 692 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 614 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1150 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=7, 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, 8 MinimizatonAttempts, 77 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 234 PreInvPairs, 377 NumberOfFragments, 88 HoareAnnotationTreeSize, 234 FomulaSimplifications, 52561 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 6 FomulaSimplificationsInter, 2314 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 653 NumberOfCodeBlocks, 601 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 639 ConstructedInterpolants, 0 QuantifiedInterpolants, 95043 SizeOfPredicates, 26 NumberOfNonLiveVariables, 785 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 1472/1916 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 correct! Received shutdown request...