./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loops/sum01_bug02_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/loops/sum01_bug02_false-unreach-call_true-termination.i -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 c5465a084053aead702161d951dd339bfa1665d5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 10:48:28,063 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 10:48:28,065 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 10:48:28,077 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 10:48:28,077 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 10:48:28,078 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 10:48:28,080 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 10:48:28,082 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 10:48:28,084 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 10:48:28,085 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 10:48:28,086 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 10:48:28,086 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 10:48:28,088 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 10:48:28,089 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 10:48:28,090 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 10:48:28,091 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 10:48:28,092 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 10:48:28,095 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 10:48:28,097 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 10:48:28,099 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 10:48:28,100 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 10:48:28,102 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 10:48:28,105 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 10:48:28,105 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 10:48:28,105 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 10:48:28,107 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 10:48:28,108 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 10:48:28,109 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 10:48:28,110 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 10:48:28,112 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 10:48:28,112 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 10:48:28,113 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 10:48:28,113 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 10:48:28,113 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 10:48:28,115 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 10:48:28,116 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 10:48:28,116 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 10:48:28,145 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 10:48:28,145 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 10:48:28,148 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 10:48:28,148 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 10:48:28,148 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 10:48:28,148 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 10:48:28,148 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 10:48:28,149 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 10:48:28,149 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 10:48:28,149 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 10:48:28,149 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 10:48:28,149 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 10:48:28,149 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 10:48:28,150 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 10:48:28,151 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 10:48:28,151 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 10:48:28,152 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 10:48:28,153 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 10:48:28,153 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 10:48:28,154 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 10:48:28,154 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 10:48:28,154 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 10:48:28,154 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 10:48:28,154 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 10:48:28,154 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 10:48:28,155 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 10:48:28,156 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 10:48:28,156 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 10:48:28,156 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> c5465a084053aead702161d951dd339bfa1665d5 [2019-01-12 10:48:28,203 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 10:48:28,222 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 10:48:28,227 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 10:48:28,229 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 10:48:28,229 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 10:48:28,232 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/sum01_bug02_false-unreach-call_true-termination.i [2019-01-12 10:48:28,311 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f913dee6c/5b004dfe29d348008d4b0d8100c4f09e/FLAG22189ac7a [2019-01-12 10:48:28,754 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 10:48:28,755 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/sum01_bug02_false-unreach-call_true-termination.i [2019-01-12 10:48:28,762 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f913dee6c/5b004dfe29d348008d4b0d8100c4f09e/FLAG22189ac7a [2019-01-12 10:48:29,119 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f913dee6c/5b004dfe29d348008d4b0d8100c4f09e [2019-01-12 10:48:29,123 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 10:48:29,125 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 10:48:29,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 10:48:29,126 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 10:48:29,130 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 10:48:29,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:48:29" (1/1) ... [2019-01-12 10:48:29,134 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c7a5c16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:29, skipping insertion in model container [2019-01-12 10:48:29,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:48:29" (1/1) ... [2019-01-12 10:48:29,143 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 10:48:29,158 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 10:48:29,318 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 10:48:29,322 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 10:48:29,340 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 10:48:29,357 INFO L195 MainTranslator]: Completed translation [2019-01-12 10:48:29,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:29 WrapperNode [2019-01-12 10:48:29,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 10:48:29,358 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 10:48:29,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 10:48:29,358 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 10:48:29,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:29" (1/1) ... [2019-01-12 10:48:29,375 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:29" (1/1) ... [2019-01-12 10:48:29,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 10:48:29,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 10:48:29,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 10:48:29,398 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 10:48:29,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:29" (1/1) ... [2019-01-12 10:48:29,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:29" (1/1) ... [2019-01-12 10:48:29,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:29" (1/1) ... [2019-01-12 10:48:29,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:29" (1/1) ... [2019-01-12 10:48:29,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:29" (1/1) ... [2019-01-12 10:48:29,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:29" (1/1) ... [2019-01-12 10:48:29,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:29" (1/1) ... [2019-01-12 10:48:29,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 10:48:29,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 10:48:29,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 10:48:29,422 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 10:48:29,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:29" (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-01-12 10:48:29,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 10:48:29,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 10:48:29,923 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 10:48:29,924 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 10:48:29,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:48:29 BoogieIcfgContainer [2019-01-12 10:48:29,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 10:48:29,926 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 10:48:29,926 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 10:48:29,930 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 10:48:29,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 10:48:29" (1/3) ... [2019-01-12 10:48:29,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c5ee822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:48:29, skipping insertion in model container [2019-01-12 10:48:29,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:29" (2/3) ... [2019-01-12 10:48:29,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c5ee822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:48:29, skipping insertion in model container [2019-01-12 10:48:29,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:48:29" (3/3) ... [2019-01-12 10:48:29,934 INFO L112 eAbstractionObserver]: Analyzing ICFG sum01_bug02_false-unreach-call_true-termination.i [2019-01-12 10:48:29,946 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 10:48:29,955 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 10:48:29,974 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 10:48:30,011 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 10:48:30,012 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 10:48:30,012 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 10:48:30,012 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 10:48:30,012 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 10:48:30,013 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 10:48:30,013 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 10:48:30,013 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 10:48:30,013 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 10:48:30,032 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2019-01-12 10:48:30,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-12 10:48:30,039 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:48:30,040 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-12 10:48:30,045 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:48:30,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:48:30,052 INFO L82 PathProgramCache]: Analyzing trace with hash 30170436, now seen corresponding path program 1 times [2019-01-12 10:48:30,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:48:30,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:48:30,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:30,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:48:30,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:48:30,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:48:30,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:48:30,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 10:48:30,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 10:48:30,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 10:48:30,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 10:48:30,203 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2019-01-12 10:48:30,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:48:30,220 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-01-12 10:48:30,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 10:48:30,221 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-01-12 10:48:30,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:48:30,232 INFO L225 Difference]: With dead ends: 19 [2019-01-12 10:48:30,232 INFO L226 Difference]: Without dead ends: 9 [2019-01-12 10:48:30,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 10:48:30,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-12 10:48:30,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-12 10:48:30,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-12 10:48:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-12 10:48:30,275 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 5 [2019-01-12 10:48:30,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:48:30,275 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-12 10:48:30,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 10:48:30,276 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-01-12 10:48:30,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-12 10:48:30,276 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:48:30,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-12 10:48:30,277 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:48:30,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:48:30,277 INFO L82 PathProgramCache]: Analyzing trace with hash 29783153, now seen corresponding path program 1 times [2019-01-12 10:48:30,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:48:30,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:48:30,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:30,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:48:30,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:48:30,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:48:30,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:48:30,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 10:48:30,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 10:48:30,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 10:48:30,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 10:48:30,462 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 4 states. [2019-01-12 10:48:30,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:48:30,559 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-01-12 10:48:30,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 10:48:30,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-12 10:48:30,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:48:30,565 INFO L225 Difference]: With dead ends: 17 [2019-01-12 10:48:30,565 INFO L226 Difference]: Without dead ends: 13 [2019-01-12 10:48:30,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 10:48:30,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-12 10:48:30,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-12 10:48:30,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-12 10:48:30,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-01-12 10:48:30,571 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 5 [2019-01-12 10:48:30,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:48:30,571 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-01-12 10:48:30,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 10:48:30,571 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-01-12 10:48:30,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 10:48:30,572 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:48:30,573 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:48:30,573 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:48:30,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:48:30,573 INFO L82 PathProgramCache]: Analyzing trace with hash -963514282, now seen corresponding path program 1 times [2019-01-12 10:48:30,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:48:30,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:48:30,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:30,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:48:30,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:48:31,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:48:31,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:48:31,103 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:48:31,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:48:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:48:31,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:48:31,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:48:31,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:48:31,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-01-12 10:48:31,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 10:48:31,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 10:48:31,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-01-12 10:48:31,642 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 13 states. [2019-01-12 10:48:32,347 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2019-01-12 10:48:32,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:48:32,496 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2019-01-12 10:48:32,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 10:48:32,499 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-12 10:48:32,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:48:32,502 INFO L225 Difference]: With dead ends: 35 [2019-01-12 10:48:32,502 INFO L226 Difference]: Without dead ends: 29 [2019-01-12 10:48:32,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-01-12 10:48:32,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-12 10:48:32,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2019-01-12 10:48:32,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-12 10:48:32,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-01-12 10:48:32,511 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 9 [2019-01-12 10:48:32,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:48:32,511 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-01-12 10:48:32,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 10:48:32,513 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-01-12 10:48:32,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 10:48:32,513 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:48:32,514 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:48:32,514 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:48:32,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:48:32,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1771006013, now seen corresponding path program 1 times [2019-01-12 10:48:32,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:48:32,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:48:32,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:32,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:48:32,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:48:32,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:48:32,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:48:32,581 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:48:32,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:48:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:48:32,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:48:32,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:48:32,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:48:32,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-01-12 10:48:32,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 10:48:32,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 10:48:32,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-01-12 10:48:32,692 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 8 states. [2019-01-12 10:48:32,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:48:32,774 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2019-01-12 10:48:32,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 10:48:32,774 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-01-12 10:48:32,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:48:32,775 INFO L225 Difference]: With dead ends: 30 [2019-01-12 10:48:32,775 INFO L226 Difference]: Without dead ends: 18 [2019-01-12 10:48:32,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-01-12 10:48:32,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-12 10:48:32,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-12 10:48:32,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-12 10:48:32,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-01-12 10:48:32,782 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-01-12 10:48:32,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:48:32,783 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-01-12 10:48:32,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 10:48:32,783 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-01-12 10:48:32,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 10:48:32,784 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:48:32,784 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-01-12 10:48:32,784 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:48:32,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:48:32,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1276819616, now seen corresponding path program 2 times [2019-01-12 10:48:32,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:48:32,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:48:32,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:32,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:48:32,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:48:33,087 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 10:48:33,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:48:33,088 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:48:33,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 10:48:33,119 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 10:48:33,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:48:33,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:48:33,433 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:48:33,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:48:33,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2019-01-12 10:48:33,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 10:48:33,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 10:48:33,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-01-12 10:48:33,460 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 18 states. [2019-01-12 10:48:34,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:48:34,231 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2019-01-12 10:48:34,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-12 10:48:34,232 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-01-12 10:48:34,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:48:34,233 INFO L225 Difference]: With dead ends: 39 [2019-01-12 10:48:34,233 INFO L226 Difference]: Without dead ends: 33 [2019-01-12 10:48:34,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=172, Invalid=884, Unknown=0, NotChecked=0, Total=1056 [2019-01-12 10:48:34,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-12 10:48:34,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 19. [2019-01-12 10:48:34,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-12 10:48:34,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-01-12 10:48:34,239 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 17 [2019-01-12 10:48:34,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:48:34,240 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-01-12 10:48:34,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 10:48:34,240 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-01-12 10:48:34,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 10:48:34,241 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:48:34,241 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2019-01-12 10:48:34,241 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:48:34,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:48:34,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1243140318, now seen corresponding path program 2 times [2019-01-12 10:48:34,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:48:34,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:48:34,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:34,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:48:34,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:48:34,410 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:48:34,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:48:34,411 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:48:34,422 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 10:48:34,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 10:48:34,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:48:34,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:48:34,505 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:48:34,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:48:34,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-01-12 10:48:34,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 10:48:34,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 10:48:34,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2019-01-12 10:48:34,525 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 12 states. [2019-01-12 10:48:34,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:48:34,589 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-01-12 10:48:34,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 10:48:34,596 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2019-01-12 10:48:34,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:48:34,597 INFO L225 Difference]: With dead ends: 32 [2019-01-12 10:48:34,597 INFO L226 Difference]: Without dead ends: 24 [2019-01-12 10:48:34,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2019-01-12 10:48:34,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-12 10:48:34,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-01-12 10:48:34,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-12 10:48:34,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-01-12 10:48:34,609 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2019-01-12 10:48:34,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:48:34,609 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-01-12 10:48:34,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 10:48:34,610 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-01-12 10:48:34,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 10:48:34,616 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:48:34,616 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2019-01-12 10:48:34,617 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:48:34,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:48:34,617 INFO L82 PathProgramCache]: Analyzing trace with hash -242812025, now seen corresponding path program 3 times [2019-01-12 10:48:34,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:48:34,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:48:34,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:34,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:48:34,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:48:34,961 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:48:34,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:48:34,962 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:48:34,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 10:48:35,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-12 10:48:35,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:48:35,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:48:35,131 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:48:35,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:48:35,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-01-12 10:48:35,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 10:48:35,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 10:48:35,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2019-01-12 10:48:35,151 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 16 states. [2019-01-12 10:48:35,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:48:35,803 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-01-12 10:48:35,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 10:48:35,804 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-01-12 10:48:35,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:48:35,805 INFO L225 Difference]: With dead ends: 36 [2019-01-12 10:48:35,805 INFO L226 Difference]: Without dead ends: 28 [2019-01-12 10:48:35,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2019-01-12 10:48:35,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-12 10:48:35,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-01-12 10:48:35,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-12 10:48:35,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-01-12 10:48:35,811 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 21 [2019-01-12 10:48:35,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:48:35,812 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-01-12 10:48:35,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 10:48:35,812 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-01-12 10:48:35,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 10:48:35,813 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:48:35,813 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2019-01-12 10:48:35,813 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:48:35,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:48:35,815 INFO L82 PathProgramCache]: Analyzing trace with hash -2047865492, now seen corresponding path program 4 times [2019-01-12 10:48:35,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:48:35,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:48:35,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:35,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:48:35,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:48:35,969 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:48:35,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:48:35,969 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:48:35,979 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 10:48:35,990 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 10:48:35,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:48:35,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:48:36,130 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:48:36,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:48:36,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2019-01-12 10:48:36,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 10:48:36,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 10:48:36,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2019-01-12 10:48:36,150 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 20 states. [2019-01-12 10:48:36,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:48:36,256 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-01-12 10:48:36,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 10:48:36,257 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 25 [2019-01-12 10:48:36,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:48:36,258 INFO L225 Difference]: With dead ends: 41 [2019-01-12 10:48:36,258 INFO L226 Difference]: Without dead ends: 33 [2019-01-12 10:48:36,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2019-01-12 10:48:36,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-12 10:48:36,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-01-12 10:48:36,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-12 10:48:36,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-01-12 10:48:36,264 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 25 [2019-01-12 10:48:36,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:48:36,266 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-01-12 10:48:36,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 10:48:36,266 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-01-12 10:48:36,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-12 10:48:36,267 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:48:36,267 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1] [2019-01-12 10:48:36,267 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:48:36,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:48:36,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1174166319, now seen corresponding path program 5 times [2019-01-12 10:48:36,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:48:36,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:48:36,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:36,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:48:36,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 10:48:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 10:48:36,317 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 10:48:36,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 10:48:36 BoogieIcfgContainer [2019-01-12 10:48:36,342 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 10:48:36,343 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 10:48:36,343 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 10:48:36,343 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 10:48:36,345 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:48:29" (3/4) ... [2019-01-12 10:48:36,348 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 10:48:36,418 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 10:48:36,419 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 10:48:36,420 INFO L168 Benchmark]: Toolchain (without parser) took 7296.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.6 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -166.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2019-01-12 10:48:36,423 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 10:48:36,423 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.54 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 10:48:36,426 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.35 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 10:48:36,426 INFO L168 Benchmark]: Boogie Preprocessor took 24.09 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 10:48:36,426 INFO L168 Benchmark]: RCFGBuilder took 503.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -131.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-01-12 10:48:36,427 INFO L168 Benchmark]: TraceAbstraction took 6416.23 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 77.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -45.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2019-01-12 10:48:36,428 INFO L168 Benchmark]: Witness Printer took 75.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 10:48:36,439 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 231.54 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.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 39.35 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.09 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 503.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -131.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6416.23 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 77.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -45.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Witness Printer took 75.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int i, j=10, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, j=10, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 [L13] COND TRUE i<=n [L14] COND TRUE i