./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Ackermann03.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/Ackermann03.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 33d0641b9a339cc7e30dea71c1d04be4d72dcf57 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:06,193 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:28:06,196 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:28:06,214 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:28:06,214 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:28:06,216 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:28:06,218 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:28:06,228 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:28:06,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:28:06,237 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:28:06,238 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:28:06,240 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:28:06,240 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:28:06,243 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:28:06,244 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:28:06,246 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:28:06,247 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:28:06,248 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:28:06,251 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:28:06,255 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:28:06,259 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:28:06,265 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:28:06,266 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:28:06,268 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:28:06,271 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:28:06,271 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:28:06,271 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:28:06,272 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:28:06,273 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:28:06,274 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:28:06,274 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:28:06,275 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:28:06,276 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:28:06,276 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:28:06,277 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:28:06,278 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:28:06,279 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:28:06,279 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:28:06,279 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:28:06,280 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:28:06,281 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:28:06,282 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:06,296 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:28:06,297 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:28:06,298 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:28:06,298 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:28:06,299 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:28:06,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:28:06,299 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:28:06,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:28:06,300 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:28:06,300 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:28:06,300 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:28:06,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:28:06,301 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:28:06,301 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:28:06,301 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:28:06,302 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:28:06,302 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:28:06,302 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:28:06,303 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:28:06,303 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:28:06,303 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:28:06,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:28:06,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:28:06,306 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:28:06,307 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:28:06,307 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:28:06,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:28:06,308 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:28:06,308 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:28:06,308 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 -> 33d0641b9a339cc7e30dea71c1d04be4d72dcf57 [2019-11-28 17:28:06,627 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:28:06,647 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:28:06,652 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:28:06,654 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:28:06,655 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:28:06,656 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Ackermann03.c [2019-11-28 17:28:06,732 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a4e8097e/9f9b7e72177a4cbfa11dd4c06f60a062/FLAG98e707a35 [2019-11-28 17:28:07,273 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:28:07,274 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann03.c [2019-11-28 17:28:07,282 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a4e8097e/9f9b7e72177a4cbfa11dd4c06f60a062/FLAG98e707a35 [2019-11-28 17:28:07,583 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a4e8097e/9f9b7e72177a4cbfa11dd4c06f60a062 [2019-11-28 17:28:07,586 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:28:07,588 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:28:07,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:28:07,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:28:07,592 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:28:07,593 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,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13fc762e 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,597 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,604 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:28:07,623 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:28:07,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:28:07,808 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:28:07,831 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:28:07,849 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:28:07,849 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,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:28:07,850 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:28:07,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:28:07,850 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:28:07,859 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,864 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,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:28:07,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:28:07,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:28:07,882 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:28:07,948 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,948 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,949 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,949 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,954 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,957 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,958 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,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:28:07,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:28:07,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:28:07,960 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:28:07,963 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:08,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:28:08,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:28:08,018 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2019-11-28 17:28:08,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2019-11-28 17:28:08,215 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:28:08,216 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 17:28:08,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:28:08 BoogieIcfgContainer [2019-11-28 17:28:08,218 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:28:08,219 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:28:08,219 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:28:08,223 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:28:08,223 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:08,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f12b179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:28:08, skipping insertion in model container [2019-11-28 17:28:08,226 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:08,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f12b179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:28:08, skipping insertion in model container [2019-11-28 17:28:08,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:28:08" (3/3) ... [2019-11-28 17:28:08,230 INFO L109 eAbstractionObserver]: Analyzing ICFG Ackermann03.c [2019-11-28 17:28:08,248 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:28:08,258 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 17:28:08,276 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 17:28:08,333 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:28:08,334 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:28:08,334 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:28:08,334 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:28:08,334 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:28:08,334 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:28:08,335 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:28:08,335 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:28:08,353 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-11-28 17:28:08,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 17:28:08,359 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:08,360 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:08,361 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:08,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:08,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1260755674, now seen corresponding path program 1 times [2019-11-28 17:28:08,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:08,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52913000] [2019-11-28 17:28:08,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:08,580 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,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52913000] [2019-11-28 17:28:08,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:28:08,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:28:08,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187617280] [2019-11-28 17:28:08,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:28:08,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:08,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:28:08,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:28:08,604 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 5 states. [2019-11-28 17:28:08,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:08,761 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2019-11-28 17:28:08,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:28:08,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-28 17:28:08,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:08,775 INFO L225 Difference]: With dead ends: 50 [2019-11-28 17:28:08,775 INFO L226 Difference]: Without dead ends: 24 [2019-11-28 17:28:08,779 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:28:08,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-28 17:28:08,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-28 17:28:08,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 17:28:08,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2019-11-28 17:28:08,830 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 11 [2019-11-28 17:28:08,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:08,830 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-11-28 17:28:08,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:28:08,831 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2019-11-28 17:28:08,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 17:28:08,833 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:08,833 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,834 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:08,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:08,834 INFO L82 PathProgramCache]: Analyzing trace with hash 963920485, now seen corresponding path program 1 times [2019-11-28 17:28:08,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:08,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562254853] [2019-11-28 17:28:08,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:09,050 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-28 17:28:09,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562254853] [2019-11-28 17:28:09,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171131275] [2019-11-28 17:28:09,051 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,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:09,116 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 17:28:09,125 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:09,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 17:28:09,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:09,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-11-28 17:28:09,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339846231] [2019-11-28 17:28:09,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 17:28:09,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:09,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 17:28:09,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-28 17:28:09,235 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand 11 states. [2019-11-28 17:28:09,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:09,503 INFO L93 Difference]: Finished difference Result 53 states and 82 transitions. [2019-11-28 17:28:09,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:28:09,505 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-11-28 17:28:09,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:09,508 INFO L225 Difference]: With dead ends: 53 [2019-11-28 17:28:09,508 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 17:28:09,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-11-28 17:28:09,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 17:28:09,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-11-28 17:28:09,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 17:28:09,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-11-28 17:28:09,527 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 18 [2019-11-28 17:28:09,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:09,528 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-11-28 17:28:09,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 17:28:09,528 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2019-11-28 17:28:09,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 17:28:09,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:09,532 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,732 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:09,733 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:09,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:09,733 INFO L82 PathProgramCache]: Analyzing trace with hash 416247163, now seen corresponding path program 1 times [2019-11-28 17:28:09,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:09,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318029811] [2019-11-28 17:28:09,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:10,056 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-28 17:28:10,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318029811] [2019-11-28 17:28:10,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843941216] [2019-11-28 17:28:10,059 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,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:10,110 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 17:28:10,114 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:10,201 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,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:10,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2019-11-28 17:28:10,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866726920] [2019-11-28 17:28:10,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 17:28:10,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:10,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 17:28:10,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-11-28 17:28:10,207 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand 14 states. [2019-11-28 17:28:10,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:10,800 INFO L93 Difference]: Finished difference Result 83 states and 166 transitions. [2019-11-28 17:28:10,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 17:28:10,802 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-11-28 17:28:10,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:10,811 INFO L225 Difference]: With dead ends: 83 [2019-11-28 17:28:10,812 INFO L226 Difference]: Without dead ends: 57 [2019-11-28 17:28:10,817 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2019-11-28 17:28:10,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-28 17:28:10,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2019-11-28 17:28:10,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 17:28:10,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2019-11-28 17:28:10,848 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 31 [2019-11-28 17:28:10,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:10,849 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2019-11-28 17:28:10,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 17:28:10,850 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2019-11-28 17:28:10,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 17:28:10,857 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:10,857 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:11,069 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:11,069 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:11,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:11,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1827824897, now seen corresponding path program 2 times [2019-11-28 17:28:11,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:11,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962712097] [2019-11-28 17:28:11,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:11,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:11,274 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-28 17:28:11,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962712097] [2019-11-28 17:28:11,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010622944] [2019-11-28 17:28:11,275 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,333 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:28:11,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:11,334 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 17:28:11,338 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:11,381 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-28 17:28:11,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:11,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-11-28 17:28:11,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88451792] [2019-11-28 17:28:11,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 17:28:11,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:11,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 17:28:11,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-28 17:28:11,385 INFO L87 Difference]: Start difference. First operand 49 states and 75 transitions. Second operand 9 states. [2019-11-28 17:28:11,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:11,514 INFO L93 Difference]: Finished difference Result 119 states and 226 transitions. [2019-11-28 17:28:11,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:28:11,515 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2019-11-28 17:28:11,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:11,518 INFO L225 Difference]: With dead ends: 119 [2019-11-28 17:28:11,518 INFO L226 Difference]: Without dead ends: 52 [2019-11-28 17:28:11,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-28 17:28:11,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-28 17:28:11,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-11-28 17:28:11,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 17:28:11,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2019-11-28 17:28:11,534 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 44 [2019-11-28 17:28:11,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:11,535 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2019-11-28 17:28:11,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 17:28:11,535 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2019-11-28 17:28:11,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-28 17:28:11,538 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:11,539 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:11,742 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:11,743 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:11,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:11,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1207723706, now seen corresponding path program 3 times [2019-11-28 17:28:11,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:11,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089468753] [2019-11-28 17:28:11,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:12,206 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 101 proven. 59 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-28 17:28:12,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089468753] [2019-11-28 17:28:12,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647733138] [2019-11-28 17:28:12,207 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,261 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-28 17:28:12,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:12,263 INFO L264 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 17:28:12,267 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:12,343 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 98 proven. 19 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-28 17:28:12,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:12,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 18 [2019-11-28 17:28:12,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623719342] [2019-11-28 17:28:12,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 17:28:12,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:12,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 17:28:12,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-11-28 17:28:12,346 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. Second operand 18 states. [2019-11-28 17:28:13,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:13,028 INFO L93 Difference]: Finished difference Result 118 states and 221 transitions. [2019-11-28 17:28:13,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 17:28:13,030 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2019-11-28 17:28:13,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:13,034 INFO L225 Difference]: With dead ends: 118 [2019-11-28 17:28:13,034 INFO L226 Difference]: Without dead ends: 70 [2019-11-28 17:28:13,036 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=261, Invalid=999, Unknown=0, NotChecked=0, Total=1260 [2019-11-28 17:28:13,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-28 17:28:13,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-11-28 17:28:13,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 17:28:13,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2019-11-28 17:28:13,058 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 78 [2019-11-28 17:28:13,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:13,059 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2019-11-28 17:28:13,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 17:28:13,059 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2019-11-28 17:28:13,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-28 17:28:13,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:13,063 INFO L410 BasicCegarLoop]: trace histogram [23, 23, 14, 9, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:13,275 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:13,276 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:13,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:13,277 INFO L82 PathProgramCache]: Analyzing trace with hash -554167378, now seen corresponding path program 4 times [2019-11-28 17:28:13,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:13,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92252970] [2019-11-28 17:28:13,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:14,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1245 backedges. 364 proven. 420 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2019-11-28 17:28:14,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92252970] [2019-11-28 17:28:14,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544487399] [2019-11-28 17:28:14,087 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:14,182 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 17:28:14,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:14,184 INFO L264 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 17:28:14,209 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:14,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1245 backedges. 374 proven. 140 refuted. 0 times theorem prover too weak. 731 trivial. 0 not checked. [2019-11-28 17:28:14,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:14,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 8] total 28 [2019-11-28 17:28:14,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864555850] [2019-11-28 17:28:14,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-28 17:28:14,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:14,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-28 17:28:14,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2019-11-28 17:28:14,445 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand 28 states. [2019-11-28 17:28:18,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:18,045 INFO L93 Difference]: Finished difference Result 176 states and 446 transitions. [2019-11-28 17:28:18,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-11-28 17:28:18,046 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 157 [2019-11-28 17:28:18,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:18,048 INFO L225 Difference]: With dead ends: 176 [2019-11-28 17:28:18,049 INFO L226 Difference]: Without dead ends: 66 [2019-11-28 17:28:18,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2280 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1700, Invalid=7420, Unknown=0, NotChecked=0, Total=9120 [2019-11-28 17:28:18,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-28 17:28:18,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2019-11-28 17:28:18,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-28 17:28:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2019-11-28 17:28:18,065 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 157 [2019-11-28 17:28:18,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:18,066 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2019-11-28 17:28:18,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-28 17:28:18,066 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2019-11-28 17:28:18,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-28 17:28:18,068 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:18,069 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 11, 8, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:18,272 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:18,273 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:18,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:18,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1646083662, now seen corresponding path program 5 times [2019-11-28 17:28:18,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:18,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712915241] [2019-11-28 17:28:18,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:18,661 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 240 proven. 264 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2019-11-28 17:28:18,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712915241] [2019-11-28 17:28:18,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451449619] [2019-11-28 17:28:18,662 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:18,726 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-28 17:28:18,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:18,727 INFO L264 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-28 17:28:18,731 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 475 proven. 114 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2019-11-28 17:28:18,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:18,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 19 [2019-11-28 17:28:18,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121426964] [2019-11-28 17:28:18,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 17:28:18,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:18,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 17:28:18,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-11-28 17:28:18,807 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand 19 states. [2019-11-28 17:28:19,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:19,495 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-11-28 17:28:19,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-28 17:28:19,495 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 130 [2019-11-28 17:28:19,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:19,497 INFO L225 Difference]: With dead ends: 121 [2019-11-28 17:28:19,497 INFO L226 Difference]: Without dead ends: 76 [2019-11-28 17:28:19,498 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=364, Invalid=1528, Unknown=0, NotChecked=0, Total=1892 [2019-11-28 17:28:19,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-28 17:28:19,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2019-11-28 17:28:19,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 17:28:19,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2019-11-28 17:28:19,516 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 130 [2019-11-28 17:28:19,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:19,517 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2019-11-28 17:28:19,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 17:28:19,517 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2019-11-28 17:28:19,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-28 17:28:19,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:19,521 INFO L410 BasicCegarLoop]: trace histogram [23, 23, 13, 10, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:19,725 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:19,726 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:19,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:19,727 INFO L82 PathProgramCache]: Analyzing trace with hash -437561620, now seen corresponding path program 6 times [2019-11-28 17:28:19,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:19,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580004352] [2019-11-28 17:28:19,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:20,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 446 proven. 274 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2019-11-28 17:28:20,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580004352] [2019-11-28 17:28:20,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146932342] [2019-11-28 17:28:20,246 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:20,355 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-11-28 17:28:20,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:20,358 INFO L264 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-28 17:28:20,361 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:20,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 421 proven. 286 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2019-11-28 17:28:20,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:20,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 24 [2019-11-28 17:28:20,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865664236] [2019-11-28 17:28:20,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-28 17:28:20,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:20,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-28 17:28:20,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2019-11-28 17:28:20,440 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand 24 states. [2019-11-28 17:28:21,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:21,405 INFO L93 Difference]: Finished difference Result 133 states and 167 transitions. [2019-11-28 17:28:21,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-28 17:28:21,406 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 156 [2019-11-28 17:28:21,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:21,408 INFO L225 Difference]: With dead ends: 133 [2019-11-28 17:28:21,408 INFO L226 Difference]: Without dead ends: 89 [2019-11-28 17:28:21,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=500, Invalid=2470, Unknown=0, NotChecked=0, Total=2970 [2019-11-28 17:28:21,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-28 17:28:21,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 73. [2019-11-28 17:28:21,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-28 17:28:21,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. [2019-11-28 17:28:21,423 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 91 transitions. Word has length 156 [2019-11-28 17:28:21,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:21,424 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 91 transitions. [2019-11-28 17:28:21,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-28 17:28:21,425 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 91 transitions. [2019-11-28 17:28:21,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-11-28 17:28:21,427 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:21,428 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 14, 11, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:21,631 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:21,632 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:21,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:21,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1768194034, now seen corresponding path program 7 times [2019-11-28 17:28:21,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:21,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077156735] [2019-11-28 17:28:21,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:22,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:22,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 503 proven. 360 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2019-11-28 17:28:22,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077156735] [2019-11-28 17:28:22,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162613848] [2019-11-28 17:28:22,214 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:22,308 INFO L264 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-28 17:28:22,313 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:22,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 477 proven. 372 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2019-11-28 17:28:22,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:22,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 25 [2019-11-28 17:28:22,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157540918] [2019-11-28 17:28:22,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-28 17:28:22,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:22,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 17:28:22,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2019-11-28 17:28:22,421 INFO L87 Difference]: Start difference. First operand 73 states and 91 transitions. Second operand 25 states. [2019-11-28 17:28:23,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:23,510 INFO L93 Difference]: Finished difference Result 151 states and 194 transitions. [2019-11-28 17:28:23,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-11-28 17:28:23,514 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 169 [2019-11-28 17:28:23,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:23,516 INFO L225 Difference]: With dead ends: 151 [2019-11-28 17:28:23,516 INFO L226 Difference]: Without dead ends: 102 [2019-11-28 17:28:23,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=619, Invalid=3041, Unknown=0, NotChecked=0, Total=3660 [2019-11-28 17:28:23,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-28 17:28:23,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 78. [2019-11-28 17:28:23,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 17:28:23,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2019-11-28 17:28:23,530 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 169 [2019-11-28 17:28:23,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:23,531 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2019-11-28 17:28:23,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-28 17:28:23,531 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2019-11-28 17:28:23,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-28 17:28:23,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:23,534 INFO L410 BasicCegarLoop]: trace histogram [27, 27, 15, 12, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:23,746 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:23,746 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:23,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:23,746 INFO L82 PathProgramCache]: Analyzing trace with hash -728546296, now seen corresponding path program 8 times [2019-11-28 17:28:23,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:23,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104517126] [2019-11-28 17:28:23,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 600 proven. 156 refuted. 0 times theorem prover too weak. 985 trivial. 0 not checked. [2019-11-28 17:28:24,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104517126] [2019-11-28 17:28:24,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258813408] [2019-11-28 17:28:24,665 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:24,789 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:28:24,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:24,792 INFO L264 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 79 conjunts are in the unsatisfiable core [2019-11-28 17:28:24,796 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 583 proven. 158 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2019-11-28 17:28:25,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:25,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 25 [2019-11-28 17:28:25,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870757569] [2019-11-28 17:28:25,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-28 17:28:25,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:25,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 17:28:25,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=550, Unknown=0, NotChecked=0, Total=600 [2019-11-28 17:28:25,086 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand 25 states. [2019-11-28 17:28:26,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:26,756 INFO L93 Difference]: Finished difference Result 125 states and 164 transitions. [2019-11-28 17:28:26,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-28 17:28:26,757 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 182 [2019-11-28 17:28:26,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:26,759 INFO L225 Difference]: With dead ends: 125 [2019-11-28 17:28:26,759 INFO L226 Difference]: Without dead ends: 115 [2019-11-28 17:28:26,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 234 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=247, Invalid=2615, Unknown=0, NotChecked=0, Total=2862 [2019-11-28 17:28:26,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-28 17:28:26,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 92. [2019-11-28 17:28:26,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-28 17:28:26,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 123 transitions. [2019-11-28 17:28:26,775 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 123 transitions. Word has length 182 [2019-11-28 17:28:26,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:26,776 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 123 transitions. [2019-11-28 17:28:26,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-28 17:28:26,776 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 123 transitions. [2019-11-28 17:28:26,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-28 17:28:26,779 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:26,779 INFO L410 BasicCegarLoop]: trace histogram [29, 29, 16, 13, 12, 12, 12, 12, 12, 12, 12, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:26,986 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:26,986 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:26,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:26,987 INFO L82 PathProgramCache]: Analyzing trace with hash -215902222, now seen corresponding path program 9 times [2019-11-28 17:28:26,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:26,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058121126] [2019-11-28 17:28:26,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 665 proven. 517 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2019-11-28 17:28:27,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058121126] [2019-11-28 17:28:27,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4903396] [2019-11-28 17:28:27,752 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:27,875 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-11-28 17:28:27,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:27,878 INFO L264 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-28 17:28:27,881 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:27,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 647 proven. 519 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2019-11-28 17:28:27,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:27,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 27 [2019-11-28 17:28:27,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729701402] [2019-11-28 17:28:27,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-28 17:28:27,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:27,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-28 17:28:27,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2019-11-28 17:28:27,970 INFO L87 Difference]: Start difference. First operand 92 states and 123 transitions. Second operand 27 states. [2019-11-28 17:28:28,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:28,825 INFO L93 Difference]: Finished difference Result 206 states and 269 transitions. [2019-11-28 17:28:28,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-28 17:28:28,826 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 195 [2019-11-28 17:28:28,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:28,829 INFO L225 Difference]: With dead ends: 206 [2019-11-28 17:28:28,829 INFO L226 Difference]: Without dead ends: 133 [2019-11-28 17:28:28,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=439, Invalid=2213, Unknown=0, NotChecked=0, Total=2652 [2019-11-28 17:28:28,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-28 17:28:28,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 97. [2019-11-28 17:28:28,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-28 17:28:28,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 128 transitions. [2019-11-28 17:28:28,848 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 128 transitions. Word has length 195 [2019-11-28 17:28:28,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:28,849 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 128 transitions. [2019-11-28 17:28:28,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-28 17:28:28,849 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 128 transitions. [2019-11-28 17:28:28,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-28 17:28:28,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:28,853 INFO L410 BasicCegarLoop]: trace histogram [31, 31, 17, 14, 13, 13, 13, 13, 13, 13, 13, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:29,058 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:29,059 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:29,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:29,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1299313862, now seen corresponding path program 10 times [2019-11-28 17:28:29,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:29,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681034624] [2019-11-28 17:28:29,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:29,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2320 backedges. 268 proven. 783 refuted. 0 times theorem prover too weak. 1269 trivial. 0 not checked. [2019-11-28 17:28:29,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681034624] [2019-11-28 17:28:29,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329163779] [2019-11-28 17:28:29,704 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:29,802 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 17:28:29,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:29,805 INFO L264 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-28 17:28:29,808 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:29,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2320 backedges. 1340 proven. 196 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-11-28 17:28:29,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:29,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 20 [2019-11-28 17:28:29,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760534404] [2019-11-28 17:28:29,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-28 17:28:29,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:29,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-28 17:28:29,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-11-28 17:28:29,894 INFO L87 Difference]: Start difference. First operand 97 states and 128 transitions. Second operand 20 states. [2019-11-28 17:28:30,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:30,399 INFO L93 Difference]: Finished difference Result 174 states and 226 transitions. [2019-11-28 17:28:30,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 17:28:30,399 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 208 [2019-11-28 17:28:30,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:30,401 INFO L225 Difference]: With dead ends: 174 [2019-11-28 17:28:30,401 INFO L226 Difference]: Without dead ends: 103 [2019-11-28 17:28:30,402 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=248, Invalid=1084, Unknown=0, NotChecked=0, Total=1332 [2019-11-28 17:28:30,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-28 17:28:30,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 92. [2019-11-28 17:28:30,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-28 17:28:30,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2019-11-28 17:28:30,414 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 208 [2019-11-28 17:28:30,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:30,414 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2019-11-28 17:28:30,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-28 17:28:30,415 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2019-11-28 17:28:30,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-11-28 17:28:30,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:30,420 INFO L410 BasicCegarLoop]: trace histogram [42, 42, 23, 19, 18, 18, 18, 18, 18, 18, 18, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:30,624 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:30,625 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:30,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:30,626 INFO L82 PathProgramCache]: Analyzing trace with hash -261718049, now seen corresponding path program 11 times [2019-11-28 17:28:30,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:30,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530612859] [2019-11-28 17:28:30,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:30,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:31,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:31,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 1521 proven. 761 refuted. 0 times theorem prover too weak. 2047 trivial. 0 not checked. [2019-11-28 17:28:31,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530612859] [2019-11-28 17:28:31,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253041705] [2019-11-28 17:28:31,677 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:31,844 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-11-28 17:28:31,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:31,847 INFO L264 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-28 17:28:31,852 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 1483 proven. 777 refuted. 0 times theorem prover too weak. 2069 trivial. 0 not checked. [2019-11-28 17:28:31,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:31,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 29] total 34 [2019-11-28 17:28:31,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061232098] [2019-11-28 17:28:31,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-28 17:28:31,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:31,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-28 17:28:31,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=978, Unknown=0, NotChecked=0, Total=1122 [2019-11-28 17:28:31,994 INFO L87 Difference]: Start difference. First operand 92 states and 115 transitions. Second operand 34 states. [2019-11-28 17:28:33,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:33,995 INFO L93 Difference]: Finished difference Result 191 states and 250 transitions. [2019-11-28 17:28:33,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-11-28 17:28:33,996 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 280 [2019-11-28 17:28:33,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:33,999 INFO L225 Difference]: With dead ends: 191 [2019-11-28 17:28:33,999 INFO L226 Difference]: Without dead ends: 126 [2019-11-28 17:28:34,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1634 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1037, Invalid=5935, Unknown=0, NotChecked=0, Total=6972 [2019-11-28 17:28:34,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-28 17:28:34,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 97. [2019-11-28 17:28:34,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-28 17:28:34,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2019-11-28 17:28:34,023 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 280 [2019-11-28 17:28:34,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:34,026 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2019-11-28 17:28:34,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-28 17:28:34,027 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2019-11-28 17:28:34,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-11-28 17:28:34,031 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:34,031 INFO L410 BasicCegarLoop]: trace histogram [44, 44, 24, 20, 19, 19, 19, 19, 19, 19, 19, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:34,237 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:34,238 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:34,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:34,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1710761897, now seen corresponding path program 12 times [2019-11-28 17:28:34,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:34,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103957986] [2019-11-28 17:28:34,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:35,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4764 backedges. 233 proven. 548 refuted. 0 times theorem prover too weak. 3983 trivial. 0 not checked. [2019-11-28 17:28:35,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103957986] [2019-11-28 17:28:35,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015496978] [2019-11-28 17:28:35,059 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:35,273 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2019-11-28 17:28:35,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:35,277 INFO L264 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 17:28:35,284 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:35,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4764 backedges. 215 proven. 426 refuted. 0 times theorem prover too weak. 4123 trivial. 0 not checked. [2019-11-28 17:28:35,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:35,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-11-28 17:28:35,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358743081] [2019-11-28 17:28:35,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 17:28:35,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:35,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 17:28:35,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-28 17:28:35,380 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand 12 states. [2019-11-28 17:28:35,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:35,568 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2019-11-28 17:28:35,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 17:28:35,568 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 293 [2019-11-28 17:28:35,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:35,569 INFO L225 Difference]: With dead ends: 97 [2019-11-28 17:28:35,569 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 17:28:35,570 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2019-11-28 17:28:35,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 17:28:35,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 17:28:35,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 17:28:35,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 17:28:35,574 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 293 [2019-11-28 17:28:35,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:35,574 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 17:28:35,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 17:28:35,574 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 17:28:35,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 17:28:35,778 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:35,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 17:28:37,155 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 20 [2019-11-28 17:28:38,879 WARN L192 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 177 DAG size of output: 74 [2019-11-28 17:28:39,009 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 9 [2019-11-28 17:28:39,050 INFO L246 CegarLoopResult]: For program point L33(lines 33 38) no Hoare annotation was computed. [2019-11-28 17:28:39,050 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 17:28:39,050 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 17:28:39,050 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 17:28:39,050 INFO L246 CegarLoopResult]: For program point L27(lines 27 31) no Hoare annotation was computed. [2019-11-28 17:28:39,050 INFO L249 CegarLoopResult]: At program point L25(lines 25 45) the Hoare annotation is: true [2019-11-28 17:28:39,051 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed. [2019-11-28 17:28:39,051 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-28 17:28:39,051 INFO L246 CegarLoopResult]: For program point L40(lines 40 44) no Hoare annotation was computed. [2019-11-28 17:28:39,051 INFO L249 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: true [2019-11-28 17:28:39,051 INFO L246 CegarLoopResult]: For program point L39-1(line 39) no Hoare annotation was computed. [2019-11-28 17:28:39,051 INFO L246 CegarLoopResult]: For program point ackermannEXIT(lines 14 22) no Hoare annotation was computed. [2019-11-28 17:28:39,052 INFO L249 CegarLoopResult]: At program point ackermannENTRY(lines 14 22) the Hoare annotation is: true [2019-11-28 17:28:39,052 INFO L242 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|) (not (= |ackermann_#in~n| 0)) (or (not (<= 0 |ackermann_#in~m|)) (not (<= 1 |ackermann_#in~n|)) (<= 1 |ackermann_#in~m|) (not (<= |ackermann_#in~n| 1)))) [2019-11-28 17:28:39,052 INFO L246 CegarLoopResult]: For program point L21-1(line 21) no Hoare annotation was computed. [2019-11-28 17:28:39,052 INFO L242 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (= |ackermann_#in~n| 0) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|)) [2019-11-28 17:28:39,052 INFO L242 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: (let ((.cse12 (<= 3 |ackermann_#t~ret1|)) (.cse10 (= ackermann_~m |ackermann_#in~m|)) (.cse13 (= |ackermann_#in~n| 1)) (.cse11 (= ackermann_~n |ackermann_#in~n|)) (.cse9 (<= 2 |ackermann_#in~m|))) (let ((.cse6 (<= |ackermann_#t~ret1| 5)) (.cse3 (<= |ackermann_#t~ret1| 3)) (.cse0 (<= 3 |ackermann_#in~n|)) (.cse4 (<= 5 |ackermann_#t~ret1|)) (.cse5 (<= |ackermann_#in~n| 2)) (.cse8 (not (<= 1 |ackermann_#in~m|))) (.cse1 (<= 7 |ackermann_#t~ret1|)) (.cse14 (and .cse12 .cse10 (or (<= 2 |ackermann_#res|) (not .cse13)) .cse11 .cse9)) (.cse2 (<= |ackermann_#in~n| 1)) (.cse7 (<= ackermann_~m 1)) (.cse15 (= |ackermann_#in~m| 0))) (and (or (and .cse0 .cse1) (<= 3 |ackermann_#in~m|) (and .cse2 .cse3) (and (<= 2 |ackermann_#in~n|) .cse4 .cse5 .cse6) .cse7) (or (and .cse6 (<= 4 |ackermann_#in~n|)) .cse8 .cse9 .cse3 (and .cse0 (<= |ackermann_#t~ret1| 4)) (<= 5 |ackermann_#in~n|)) (or (and .cse10 .cse11 (<= |ackermann_#t~ret1| 6) (<= 6 |ackermann_#t~ret1|)) .cse8 (and .cse4 .cse10 .cse11 (<= |ackermann_#in~n| 4)) (and .cse12 .cse5 .cse10 .cse11) (and (<= 4 |ackermann_#t~ret1|) .cse10 (<= |ackermann_#in~n| 3) .cse11) .cse13 (and .cse10 .cse11 (<= 6 |ackermann_#in~n|)) .cse14) (or (<= |ackermann_#in~n| 5) .cse8 .cse1 .cse14) (or .cse15 (and .cse12 .cse10 .cse11 .cse9) (not .cse2) (and .cse10 .cse11 .cse7 (<= 2 |ackermann_#t~ret1|) (<= |ackermann_#t~ret1| 2))) (or .cse15 (not (<= |ackermann_#in~n| 0))) (or (not (<= |ackermann_#in~m| 0)) (and .cse10 .cse15 .cse11))))) [2019-11-28 17:28:39,052 INFO L246 CegarLoopResult]: For program point L18(lines 18 20) no Hoare annotation was computed. [2019-11-28 17:28:39,053 INFO L246 CegarLoopResult]: For program point L19-1(line 19) no Hoare annotation was computed. [2019-11-28 17:28:39,053 INFO L246 CegarLoopResult]: For program point L21-3(line 21) no Hoare annotation was computed. [2019-11-28 17:28:39,053 INFO L246 CegarLoopResult]: For program point L15(lines 15 17) no Hoare annotation was computed. [2019-11-28 17:28:39,053 INFO L246 CegarLoopResult]: For program point ackermannFINAL(lines 14 22) no Hoare annotation was computed. [2019-11-28 17:28:39,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:28:39 BoogieIcfgContainer [2019-11-28 17:28:39,065 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:28:39,066 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:28:39,066 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:28:39,066 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:28:39,067 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:08" (3/4) ... [2019-11-28 17:28:39,071 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 17:28:39,082 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ackermann [2019-11-28 17:28:39,087 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 17:28:39,088 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 17:28:39,172 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:28:39,173 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:28:39,174 INFO L168 Benchmark]: Toolchain (without parser) took 31587.08 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 648.5 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -181.0 MB). Peak memory consumption was 467.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:28:39,175 INFO L168 Benchmark]: CDTParser took 0.71 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:28:39,175 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.84 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:28:39,175 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.98 ms. Allocated memory is still 1.0 GB. Free memory is still 941.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:28:39,176 INFO L168 Benchmark]: Boogie Preprocessor took 77.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:28:39,176 INFO L168 Benchmark]: RCFGBuilder took 258.18 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.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. [2019-11-28 17:28:39,179 INFO L168 Benchmark]: TraceAbstraction took 30846.46 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 526.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -33.1 MB). Peak memory consumption was 730.0 MB. Max. memory is 11.5 GB. [2019-11-28 17:28:39,179 INFO L168 Benchmark]: Witness Printer took 106.98 ms. Allocated memory is still 1.7 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:28:39,181 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.71 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 260.84 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.98 ms. Allocated memory is still 1.0 GB. Free memory is still 941.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 77.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 258.18 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.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30846.46 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 526.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -33.1 MB). Peak memory consumption was 730.0 MB. Max. memory is 11.5 GB. * Witness Printer took 106.98 ms. Allocated memory is still 1.7 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: 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: 25]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 1 error locations. Result: SAFE, OverallTime: 27.4s, OverallIterations: 14, TraceHistogramMax: 44, AutomataDifference: 13.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.2s, HoareTripleCheckerStatistics: 365 SDtfs, 574 SDslu, 2235 SDs, 0 SdLazy, 7749 SolverSat, 1479 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3112 GetRequests, 2540 SyntacticMatches, 7 SemanticMatches, 565 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7406 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 179 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 538 PreInvPairs, 1158 NumberOfFragments, 286 HoareAnnotationTreeSize, 538 FomulaSimplifications, 258652 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 20970 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 3893 NumberOfCodeBlocks, 3758 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 3866 ConstructedInterpolants, 0 QuantifiedInterpolants, 1389250 SizeOfPredicates, 111 NumberOfNonLiveVariables, 5351 ConjunctsInSsa, 353 ConjunctsInUnsatCore, 27 InterpolantComputations, 1 PerfectInterpolantSequences, 33464/40688 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...