./Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/loop-industry-pattern/nested_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0210da8c Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/TaipanReach.xml -i ../../../trunk/examples/svcomp/loop-industry-pattern/nested_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UTaipan-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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 61b7d6607ccac63dcd99f2b87de00fb6f01869a1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0210da8 [2018-10-21 12:39:51,116 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-21 12:39:51,117 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-21 12:39:51,130 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-21 12:39:51,131 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-21 12:39:51,132 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-21 12:39:51,136 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-21 12:39:51,138 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-21 12:39:51,140 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-21 12:39:51,143 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-21 12:39:51,145 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-21 12:39:51,146 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-21 12:39:51,147 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-21 12:39:51,150 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-21 12:39:51,151 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-21 12:39:51,152 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-21 12:39:51,157 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-21 12:39:51,159 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-21 12:39:51,164 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-21 12:39:51,165 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-21 12:39:51,166 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-21 12:39:51,167 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-21 12:39:51,169 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-21 12:39:51,169 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-21 12:39:51,169 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-21 12:39:51,170 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-21 12:39:51,171 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-21 12:39:51,172 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-21 12:39:51,172 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-21 12:39:51,173 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-21 12:39:51,173 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-21 12:39:51,174 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-21 12:39:51,174 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-21 12:39:51,174 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-21 12:39:51,175 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-21 12:39:51,176 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-21 12:39:51,176 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-21 12:39:51,191 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-21 12:39:51,191 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-21 12:39:51,192 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-21 12:39:51,192 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-21 12:39:51,192 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-21 12:39:51,192 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-21 12:39:51,192 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-21 12:39:51,192 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-21 12:39:51,193 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-21 12:39:51,193 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-21 12:39:51,193 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-21 12:39:51,194 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-21 12:39:51,194 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-21 12:39:51,194 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-21 12:39:51,194 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-21 12:39:51,194 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-21 12:39:51,194 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-21 12:39:51,195 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-21 12:39:51,195 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-21 12:39:51,195 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-21 12:39:51,195 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-21 12:39:51,195 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-21 12:39:51,196 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-21 12:39:51,196 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-21 12:39:51,196 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-21 12:39:51,196 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-21 12:39:51,196 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-21 12:39:51,196 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-21 12:39:51,197 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-21 12:39:51,197 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-21 12:39:51,197 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-21 12:39:51,197 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-21 12:39:51,197 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-21 12:39:51,197 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-21 12:39:51,198 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/UTaipan-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 -> Taipan 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 -> 61b7d6607ccac63dcd99f2b87de00fb6f01869a1 [2018-10-21 12:39:51,269 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-21 12:39:51,285 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-21 12:39:51,289 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-21 12:39:51,291 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-21 12:39:51,291 INFO L276 PluginConnector]: CDTParser initialized [2018-10-21 12:39:51,292 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-industry-pattern/nested_true-unreach-call.c [2018-10-21 12:39:51,355 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4dcb13b33/99056bd674ec4471b8733ab4cd22f84a/FLAG5e1677dd3 [2018-10-21 12:39:51,746 INFO L298 CDTParser]: Found 1 translation units. [2018-10-21 12:39:51,747 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/nested_true-unreach-call.c [2018-10-21 12:39:51,754 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4dcb13b33/99056bd674ec4471b8733ab4cd22f84a/FLAG5e1677dd3 [2018-10-21 12:39:51,767 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4dcb13b33/99056bd674ec4471b8733ab4cd22f84a [2018-10-21 12:39:51,771 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-21 12:39:51,773 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-21 12:39:51,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-21 12:39:51,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-21 12:39:51,778 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-21 12:39:51,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 12:39:51" (1/1) ... [2018-10-21 12:39:51,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46cbeb7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:39:51, skipping insertion in model container [2018-10-21 12:39:51,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 12:39:51" (1/1) ... [2018-10-21 12:39:51,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-21 12:39:51,813 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-21 12:39:51,988 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-21 12:39:51,993 INFO L189 MainTranslator]: Completed pre-run [2018-10-21 12:39:52,014 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-21 12:39:52,032 INFO L193 MainTranslator]: Completed translation [2018-10-21 12:39:52,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:39:52 WrapperNode [2018-10-21 12:39:52,032 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-21 12:39:52,033 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-21 12:39:52,033 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-21 12:39:52,034 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-21 12:39:52,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:39:52" (1/1) ... [2018-10-21 12:39:52,050 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:39:52" (1/1) ... [2018-10-21 12:39:52,057 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-21 12:39:52,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-21 12:39:52,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-21 12:39:52,058 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-21 12:39:52,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:39:52" (1/1) ... [2018-10-21 12:39:52,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:39:52" (1/1) ... [2018-10-21 12:39:52,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:39:52" (1/1) ... [2018-10-21 12:39:52,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:39:52" (1/1) ... [2018-10-21 12:39:52,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:39:52" (1/1) ... [2018-10-21 12:39:52,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:39:52" (1/1) ... [2018-10-21 12:39:52,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:39:52" (1/1) ... [2018-10-21 12:39:52,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-21 12:39:52,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-21 12:39:52,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-21 12:39:52,093 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-21 12:39:52,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:39:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-21 12:39:52,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-21 12:39:52,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-21 12:39:52,230 INFO L130 BoogieDeclarations]: Found specification of procedure nondet [2018-10-21 12:39:52,230 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet [2018-10-21 12:39:52,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-21 12:39:52,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-21 12:39:52,231 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-21 12:39:52,231 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-21 12:39:52,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-21 12:39:52,231 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-21 12:39:52,657 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-21 12:39:52,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 12:39:52 BoogieIcfgContainer [2018-10-21 12:39:52,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-21 12:39:52,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-21 12:39:52,659 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-21 12:39:52,663 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-21 12:39:52,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 12:39:51" (1/3) ... [2018-10-21 12:39:52,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e098355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 12:39:52, skipping insertion in model container [2018-10-21 12:39:52,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:39:52" (2/3) ... [2018-10-21 12:39:52,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e098355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 12:39:52, skipping insertion in model container [2018-10-21 12:39:52,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 12:39:52" (3/3) ... [2018-10-21 12:39:52,667 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_true-unreach-call.c [2018-10-21 12:39:52,678 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-21 12:39:52,686 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-21 12:39:52,705 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-21 12:39:52,742 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-21 12:39:52,743 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-21 12:39:52,743 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-21 12:39:52,743 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-21 12:39:52,743 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-21 12:39:52,743 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-21 12:39:52,744 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-21 12:39:52,744 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-21 12:39:52,745 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-21 12:39:52,764 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-10-21 12:39:52,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-21 12:39:52,771 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:39:52,773 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:39:52,775 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:39:52,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:39:52,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1030098894, now seen corresponding path program 1 times [2018-10-21 12:39:52,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:39:52,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:39:52,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:39:52,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:39:52,836 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:39:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:39:52,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:39:52,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-21 12:39:52,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-21 12:39:52,916 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:39:52,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-21 12:39:52,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-21 12:39:52,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-21 12:39:52,937 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-10-21 12:39:52,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:39:52,965 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2018-10-21 12:39:52,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-21 12:39:52,967 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-10-21 12:39:52,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:39:52,977 INFO L225 Difference]: With dead ends: 44 [2018-10-21 12:39:52,977 INFO L226 Difference]: Without dead ends: 25 [2018-10-21 12:39:52,981 INFO L605 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 [2018-10-21 12:39:52,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-21 12:39:53,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-21 12:39:53,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-21 12:39:53,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-10-21 12:39:53,020 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 19 [2018-10-21 12:39:53,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:39:53,020 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-10-21 12:39:53,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-21 12:39:53,021 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-10-21 12:39:53,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-21 12:39:53,022 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:39:53,022 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:39:53,022 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:39:53,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:39:53,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1176183033, now seen corresponding path program 1 times [2018-10-21 12:39:53,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:39:53,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:39:53,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:39:53,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:39:53,026 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:39:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:39:53,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:39:53,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-21 12:39:53,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-21 12:39:53,128 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:39:53,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-21 12:39:53,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-21 12:39:53,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-21 12:39:53,131 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 3 states. [2018-10-21 12:39:53,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:39:53,248 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-10-21 12:39:53,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-21 12:39:53,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-21 12:39:53,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:39:53,250 INFO L225 Difference]: With dead ends: 46 [2018-10-21 12:39:53,250 INFO L226 Difference]: Without dead ends: 31 [2018-10-21 12:39:53,252 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-21 12:39:53,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-21 12:39:53,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-10-21 12:39:53,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-21 12:39:53,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-10-21 12:39:53,260 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 20 [2018-10-21 12:39:53,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:39:53,261 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-10-21 12:39:53,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-21 12:39:53,261 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-10-21 12:39:53,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-21 12:39:53,262 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:39:53,262 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:39:53,264 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:39:53,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:39:53,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1045124110, now seen corresponding path program 1 times [2018-10-21 12:39:53,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:39:53,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:39:53,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:39:53,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:39:53,267 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:39:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:39:53,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:39:53,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:39:53,333 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:39:53,334 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-10-21 12:39:53,336 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [32], [34], [40], [48], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-10-21 12:39:53,400 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-21 12:39:53,400 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-21 12:39:53,762 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-21 12:39:53,769 INFO L272 AbstractInterpreter]: Visited 18 different actions 66 times. Merged at 4 different actions 38 times. Widened at 1 different actions 6 times. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2018-10-21 12:39:53,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:39:53,782 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-21 12:39:53,936 INFO L232 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 62.04% of their original sizes. [2018-10-21 12:39:53,936 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-21 12:39:54,234 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-21 12:39:54,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-21 12:39:54,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2018-10-21 12:39:54,236 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:39:54,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-21 12:39:54,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-21 12:39:54,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-21 12:39:54,239 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 6 states. [2018-10-21 12:39:54,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:39:54,744 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2018-10-21 12:39:54,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-21 12:39:54,744 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-10-21 12:39:54,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:39:54,749 INFO L225 Difference]: With dead ends: 58 [2018-10-21 12:39:54,749 INFO L226 Difference]: Without dead ends: 41 [2018-10-21 12:39:54,750 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-21 12:39:54,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-21 12:39:54,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2018-10-21 12:39:54,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-21 12:39:54,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-10-21 12:39:54,765 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 24 [2018-10-21 12:39:54,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:39:54,765 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-10-21 12:39:54,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-21 12:39:54,765 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-10-21 12:39:54,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-21 12:39:54,767 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:39:54,768 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:39:54,768 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:39:54,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:39:54,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1102382412, now seen corresponding path program 1 times [2018-10-21 12:39:54,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:39:54,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:39:54,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:39:54,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:39:54,771 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:39:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:39:54,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:39:54,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:39:54,913 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:39:54,913 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-10-21 12:39:54,914 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [32], [34], [42], [48], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-10-21 12:39:54,917 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-21 12:39:54,917 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-21 12:39:55,011 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-21 12:39:55,011 INFO L272 AbstractInterpreter]: Visited 22 different actions 60 times. Merged at 4 different actions 30 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2018-10-21 12:39:55,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:39:55,045 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-21 12:39:55,109 INFO L232 lantSequenceWeakener]: Weakened 22 states. On average, predicates are now at 60.23% of their original sizes. [2018-10-21 12:39:55,110 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-21 12:39:55,493 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-21 12:39:55,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-21 12:39:55,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2018-10-21 12:39:55,494 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:39:55,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-21 12:39:55,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-21 12:39:55,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-21 12:39:55,496 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 10 states. [2018-10-21 12:39:56,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:39:56,515 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2018-10-21 12:39:56,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-21 12:39:56,515 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-10-21 12:39:56,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:39:56,517 INFO L225 Difference]: With dead ends: 66 [2018-10-21 12:39:56,517 INFO L226 Difference]: Without dead ends: 49 [2018-10-21 12:39:56,518 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-21 12:39:56,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-21 12:39:56,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2018-10-21 12:39:56,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-21 12:39:56,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-10-21 12:39:56,529 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 24 [2018-10-21 12:39:56,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:39:56,530 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-10-21 12:39:56,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-21 12:39:56,530 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-10-21 12:39:56,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-21 12:39:56,531 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:39:56,531 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:39:56,531 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:39:56,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:39:56,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1438151120, now seen corresponding path program 1 times [2018-10-21 12:39:56,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:39:56,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:39:56,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:39:56,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:39:56,534 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:39:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:39:56,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:39:56,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:39:56,619 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:39:56,620 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-10-21 12:39:56,620 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [34], [40], [48], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-10-21 12:39:56,621 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-21 12:39:56,622 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-21 12:39:56,635 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-21 12:39:56,636 INFO L272 AbstractInterpreter]: Visited 17 different actions 21 times. Merged at 3 different actions 3 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2018-10-21 12:39:56,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:39:56,666 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-21 12:39:56,704 INFO L232 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 67.65% of their original sizes. [2018-10-21 12:39:56,704 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-21 12:39:56,995 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-21 12:39:56,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-21 12:39:56,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2018-10-21 12:39:56,996 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:39:56,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-21 12:39:56,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-21 12:39:56,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-21 12:39:56,997 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 6 states. [2018-10-21 12:39:57,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:39:57,440 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2018-10-21 12:39:57,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-21 12:39:57,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-10-21 12:39:57,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:39:57,443 INFO L225 Difference]: With dead ends: 71 [2018-10-21 12:39:57,443 INFO L226 Difference]: Without dead ends: 54 [2018-10-21 12:39:57,444 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-21 12:39:57,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-21 12:39:57,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2018-10-21 12:39:57,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-21 12:39:57,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-10-21 12:39:57,457 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 24 [2018-10-21 12:39:57,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:39:57,458 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-10-21 12:39:57,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-21 12:39:57,458 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-10-21 12:39:57,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-21 12:39:57,459 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:39:57,459 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:39:57,460 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:39:57,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:39:57,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1472263337, now seen corresponding path program 1 times [2018-10-21 12:39:57,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:39:57,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:39:57,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:39:57,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:39:57,462 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:39:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:39:57,562 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:39:57,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:39:57,563 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:39:57,564 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-10-21 12:39:57,564 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [32], [34], [40], [48], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-10-21 12:39:57,566 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-21 12:39:57,566 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-21 12:39:57,675 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-21 12:39:57,677 INFO L272 AbstractInterpreter]: Visited 23 different actions 100 times. Merged at 6 different actions 54 times. Widened at 1 different actions 8 times. Found 14 fixpoints after 5 different actions. Largest state had 8 variables. [2018-10-21 12:39:57,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:39:57,714 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-21 12:39:57,780 INFO L232 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 58.01% of their original sizes. [2018-10-21 12:39:57,781 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-21 12:39:58,421 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-21 12:39:58,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-21 12:39:58,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2018-10-21 12:39:58,422 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:39:58,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-21 12:39:58,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-21 12:39:58,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-10-21 12:39:58,424 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 12 states. [2018-10-21 12:39:59,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:39:59,412 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2018-10-21 12:39:59,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-21 12:39:59,412 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-10-21 12:39:59,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:39:59,413 INFO L225 Difference]: With dead ends: 78 [2018-10-21 12:39:59,413 INFO L226 Difference]: Without dead ends: 61 [2018-10-21 12:39:59,414 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-10-21 12:39:59,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-21 12:39:59,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2018-10-21 12:39:59,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-21 12:39:59,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2018-10-21 12:39:59,426 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 28 [2018-10-21 12:39:59,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:39:59,426 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2018-10-21 12:39:59,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-21 12:39:59,427 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2018-10-21 12:39:59,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-21 12:39:59,427 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:39:59,428 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:39:59,428 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:39:59,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:39:59,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1415005035, now seen corresponding path program 1 times [2018-10-21 12:39:59,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:39:59,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:39:59,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:39:59,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:39:59,430 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:39:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:39:59,549 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:39:59,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:39:59,549 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:39:59,549 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-10-21 12:39:59,551 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [32], [34], [42], [48], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-10-21 12:39:59,552 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-21 12:39:59,552 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-21 12:39:59,628 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-21 12:39:59,629 INFO L272 AbstractInterpreter]: Visited 23 different actions 98 times. Merged at 8 different actions 52 times. Widened at 1 different actions 7 times. Found 12 fixpoints after 3 different actions. Largest state had 8 variables. [2018-10-21 12:39:59,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:39:59,670 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-21 12:39:59,708 INFO L232 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 58.01% of their original sizes. [2018-10-21 12:39:59,708 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-21 12:40:00,219 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-21 12:40:00,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-21 12:40:00,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2018-10-21 12:40:00,220 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:40:00,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-21 12:40:00,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-21 12:40:00,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-10-21 12:40:00,221 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand 12 states. [2018-10-21 12:40:01,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:40:01,252 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2018-10-21 12:40:01,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-21 12:40:01,252 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-10-21 12:40:01,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:40:01,253 INFO L225 Difference]: With dead ends: 69 [2018-10-21 12:40:01,253 INFO L226 Difference]: Without dead ends: 67 [2018-10-21 12:40:01,254 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-10-21 12:40:01,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-21 12:40:01,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2018-10-21 12:40:01,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-21 12:40:01,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2018-10-21 12:40:01,269 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 28 [2018-10-21 12:40:01,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:40:01,272 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2018-10-21 12:40:01,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-21 12:40:01,273 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2018-10-21 12:40:01,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-21 12:40:01,274 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:40:01,275 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:40:01,276 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:40:01,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:40:01,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1416852077, now seen corresponding path program 1 times [2018-10-21 12:40:01,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:40:01,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:40:01,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:40:01,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:40:01,279 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:40:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:40:01,375 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:40:01,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:40:01,376 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:40:01,376 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-10-21 12:40:01,376 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [32], [34], [42], [46], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-10-21 12:40:01,378 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-21 12:40:01,378 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-21 12:40:01,469 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-21 12:40:01,469 INFO L272 AbstractInterpreter]: Visited 24 different actions 96 times. Merged at 7 different actions 51 times. Widened at 1 different actions 7 times. Found 13 fixpoints after 4 different actions. Largest state had 8 variables. [2018-10-21 12:40:01,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:40:01,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-21 12:40:01,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:40:01,481 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-21 12:40:01,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:40:01,496 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-21 12:40:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:40:01,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:40:01,560 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:40:01,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:40:01,706 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:40:01,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:40:01,738 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-21 12:40:01,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:40:01,765 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-21 12:40:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:40:01,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:40:01,874 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-21 12:40:01,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:40:01,947 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-21 12:40:01,950 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 3 imperfect interpolant sequences. [2018-10-21 12:40:01,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5, 5, 5] total 12 [2018-10-21 12:40:01,950 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:40:01,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-21 12:40:01,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-21 12:40:01,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-21 12:40:01,952 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 4 states. [2018-10-21 12:40:02,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:40:02,124 INFO L93 Difference]: Finished difference Result 102 states and 130 transitions. [2018-10-21 12:40:02,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-21 12:40:02,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-10-21 12:40:02,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:40:02,127 INFO L225 Difference]: With dead ends: 102 [2018-10-21 12:40:02,127 INFO L226 Difference]: Without dead ends: 69 [2018-10-21 12:40:02,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-21 12:40:02,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-21 12:40:02,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 57. [2018-10-21 12:40:02,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-21 12:40:02,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2018-10-21 12:40:02,149 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 28 [2018-10-21 12:40:02,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:40:02,149 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2018-10-21 12:40:02,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-21 12:40:02,149 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2018-10-21 12:40:02,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-21 12:40:02,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:40:02,152 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:40:02,152 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:40:02,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:40:02,152 INFO L82 PathProgramCache]: Analyzing trace with hash 992707110, now seen corresponding path program 1 times [2018-10-21 12:40:02,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:40:02,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:40:02,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:40:02,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:40:02,155 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:40:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:40:02,228 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-21 12:40:02,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:40:02,228 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:40:02,229 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-10-21 12:40:02,229 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [32], [34], [40], [42], [48], [55], [58], [60], [63], [65], [66], [67], [68], [70], [71], [72], [73] [2018-10-21 12:40:02,231 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-21 12:40:02,231 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-21 12:40:02,479 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-21 12:40:02,480 INFO L272 AbstractInterpreter]: Visited 26 different actions 413 times. Merged at 10 different actions 229 times. Widened at 3 different actions 44 times. Found 24 fixpoints after 5 different actions. Largest state had 8 variables. [2018-10-21 12:40:02,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:40:02,503 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-21 12:40:02,551 INFO L232 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 49.32% of their original sizes. [2018-10-21 12:40:02,551 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-21 12:40:02,908 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-21 12:40:02,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-21 12:40:02,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-10-21 12:40:02,908 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:40:02,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-21 12:40:02,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-21 12:40:02,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-10-21 12:40:02,909 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 14 states. [2018-10-21 12:40:05,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:40:05,203 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2018-10-21 12:40:05,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-21 12:40:05,203 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2018-10-21 12:40:05,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:40:05,205 INFO L225 Difference]: With dead ends: 112 [2018-10-21 12:40:05,206 INFO L226 Difference]: Without dead ends: 89 [2018-10-21 12:40:05,207 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-10-21 12:40:05,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-21 12:40:05,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2018-10-21 12:40:05,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-21 12:40:05,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 97 transitions. [2018-10-21 12:40:05,225 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 97 transitions. Word has length 39 [2018-10-21 12:40:05,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:40:05,226 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 97 transitions. [2018-10-21 12:40:05,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-21 12:40:05,226 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 97 transitions. [2018-10-21 12:40:05,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-21 12:40:05,228 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:40:05,228 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:40:05,229 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:40:05,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:40:05,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1385734120, now seen corresponding path program 1 times [2018-10-21 12:40:05,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:40:05,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:40:05,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:40:05,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:40:05,230 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:40:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:40:05,320 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-21 12:40:05,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:40:05,320 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:40:05,320 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-10-21 12:40:05,320 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [32], [34], [40], [42], [48], [55], [58], [60], [63], [65], [66], [67], [68], [70], [71], [72], [73] [2018-10-21 12:40:05,322 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-21 12:40:05,322 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-21 12:40:05,858 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-21 12:40:05,858 INFO L272 AbstractInterpreter]: Visited 27 different actions 556 times. Merged at 12 different actions 276 times. Widened at 3 different actions 42 times. Found 77 fixpoints after 9 different actions. Largest state had 8 variables. [2018-10-21 12:40:05,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:40:05,887 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-21 12:40:05,947 INFO L232 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 50.68% of their original sizes. [2018-10-21 12:40:05,947 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-21 12:40:06,347 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-21 12:40:06,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-21 12:40:06,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [4] total 19 [2018-10-21 12:40:06,347 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:40:06,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-21 12:40:06,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-21 12:40:06,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-10-21 12:40:06,349 INFO L87 Difference]: Start difference. First operand 80 states and 97 transitions. Second operand 17 states. [2018-10-21 12:40:07,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:40:07,592 INFO L93 Difference]: Finished difference Result 106 states and 129 transitions. [2018-10-21 12:40:07,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-21 12:40:07,593 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2018-10-21 12:40:07,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:40:07,594 INFO L225 Difference]: With dead ends: 106 [2018-10-21 12:40:07,594 INFO L226 Difference]: Without dead ends: 104 [2018-10-21 12:40:07,595 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2018-10-21 12:40:07,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-21 12:40:07,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 84. [2018-10-21 12:40:07,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-21 12:40:07,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2018-10-21 12:40:07,612 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 39 [2018-10-21 12:40:07,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:40:07,612 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2018-10-21 12:40:07,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-21 12:40:07,613 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2018-10-21 12:40:07,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-21 12:40:07,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:40:07,614 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:40:07,614 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:40:07,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:40:07,615 INFO L82 PathProgramCache]: Analyzing trace with hash -819542281, now seen corresponding path program 1 times [2018-10-21 12:40:07,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:40:07,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:40:07,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:40:07,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:40:07,616 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:40:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:40:07,871 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-10-21 12:40:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-21 12:40:08,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:40:08,127 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:40:08,127 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-10-21 12:40:08,127 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [32], [34], [40], [42], [46], [48], [55], [58], [60], [63], [65], [66], [67], [68], [70], [71], [72], [73] [2018-10-21 12:40:08,129 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-21 12:40:08,129 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-21 12:40:09,012 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-21 12:40:09,012 INFO L272 AbstractInterpreter]: Visited 29 different actions 1113 times. Merged at 13 different actions 456 times. Widened at 3 different actions 72 times. Found 181 fixpoints after 11 different actions. Largest state had 8 variables. [2018-10-21 12:40:09,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:40:09,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-21 12:40:09,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:40:09,039 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-21 12:40:09,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:40:09,055 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-21 12:40:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:40:09,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:40:09,091 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-21 12:40:09,092 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:40:09,150 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-21 12:40:09,173 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-21 12:40:09,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2018-10-21 12:40:09,173 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:40:09,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-21 12:40:09,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-21 12:40:09,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-21 12:40:09,174 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand 3 states. [2018-10-21 12:40:09,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:40:09,274 INFO L93 Difference]: Finished difference Result 110 states and 135 transitions. [2018-10-21 12:40:09,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-21 12:40:09,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-10-21 12:40:09,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:40:09,276 INFO L225 Difference]: With dead ends: 110 [2018-10-21 12:40:09,276 INFO L226 Difference]: Without dead ends: 0 [2018-10-21 12:40:09,277 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-21 12:40:09,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-21 12:40:09,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-21 12:40:09,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-21 12:40:09,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-21 12:40:09,278 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2018-10-21 12:40:09,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:40:09,278 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-21 12:40:09,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-21 12:40:09,278 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-21 12:40:09,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-21 12:40:09,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-21 12:40:09,449 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 106 [2018-10-21 12:40:09,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-21 12:40:09,689 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 93 [2018-10-21 12:40:09,901 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-21 12:40:11,379 WARN L179 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 113 DAG size of output: 42 [2018-10-21 12:40:11,830 WARN L179 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 60 [2018-10-21 12:40:11,952 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 40 [2018-10-21 12:40:11,958 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-21 12:40:11,959 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-10-21 12:40:11,959 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-21 12:40:11,959 INFO L425 ceAbstractionStarter]: For program point nondetFINAL(lines 15 19) no Hoare annotation was computed. [2018-10-21 12:40:11,959 INFO L428 ceAbstractionStarter]: At program point nondetENTRY(lines 15 19) the Hoare annotation is: true [2018-10-21 12:40:11,959 INFO L425 ceAbstractionStarter]: For program point nondetEXIT(lines 15 19) no Hoare annotation was computed. [2018-10-21 12:40:11,960 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-21 12:40:11,960 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 (* 2 ~last~0))) (and (<= .cse0 4294967294) (<= 0 (+ .cse0 4294967296)))) [2018-10-21 12:40:11,960 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-21 12:40:11,960 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-21 12:40:11,961 INFO L421 ceAbstractionStarter]: At program point L33(lines 24 34) the Hoare annotation is: (let ((.cse0 (* 2 |old(~last~0)|))) (or (< 4294967294 .cse0) (< (+ .cse0 4294967296) 0) (and (let ((.cse1 (= main_~b~0 0)) (.cse2 (<= (+ main_~a~0 main_~b~0) 0))) (or (and .cse1 .cse2 (<= main_~c~0 main_~a~0)) (and .cse1 (<= (+ ~last~0 1) main_~c~0) .cse2 (<= 0 (* 2 ~last~0)) (<= main_~c~0 (+ main_~a~0 1))))) (<= (+ ~last~0 main_~b~0) 2147483647) (<= main_~b~0 main_~c~0) (<= 0 (+ ~last~0 main_~a~0 2147483648))) (and (<= ~last~0 (+ main_~st~0 2147483646)) (<= 200000 (+ main_~st~0 main_~c~0)) (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0) (<= (+ main_~st~0 199999) main_~c~0) (<= (* 2 main_~c~0) 400000) (<= (+ main_~st~0 1) main_~a~0) (<= 0 (+ ~last~0 main_~st~0 2147483647)) (<= 2 (+ main_~a~0 main_~st~0))))) [2018-10-21 12:40:11,961 INFO L421 ceAbstractionStarter]: At program point L31-1(lines 31 32) the Hoare annotation is: (let ((.cse0 (* 2 |old(~last~0)|))) (or (< 4294967294 .cse0) (< (+ .cse0 4294967296) 0) (and (<= ~last~0 (+ main_~st~0 2147483646)) (<= 200000 (+ main_~st~0 main_~c~0)) (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0) (<= (+ main_~st~0 199999) main_~c~0) (<= (* 2 main_~c~0) 400000) (<= (+ main_~st~0 1) main_~a~0) (<= 0 (+ ~last~0 main_~st~0 2147483647)) (<= 2 (+ main_~a~0 main_~st~0))))) [2018-10-21 12:40:11,961 INFO L425 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-10-21 12:40:11,961 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 21 35) no Hoare annotation was computed. [2018-10-21 12:40:11,961 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 21 35) the Hoare annotation is: (let ((.cse0 (* 2 |old(~last~0)|))) (or (< 4294967294 .cse0) (< (+ .cse0 4294967296) 0) (let ((.cse1 (* 2 ~last~0))) (and (<= .cse1 4294967294) (<= 0 (+ .cse1 4294967296)))))) [2018-10-21 12:40:11,962 INFO L425 ceAbstractionStarter]: For program point L28-1(lines 24 34) no Hoare annotation was computed. [2018-10-21 12:40:11,962 INFO L425 ceAbstractionStarter]: For program point L26-1(lines 26 27) no Hoare annotation was computed. [2018-10-21 12:40:11,962 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 24 34) no Hoare annotation was computed. [2018-10-21 12:40:11,962 INFO L425 ceAbstractionStarter]: For program point L26-3(lines 26 27) no Hoare annotation was computed. [2018-10-21 12:40:11,962 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-10-21 12:40:11,962 INFO L421 ceAbstractionStarter]: At program point L26-4(lines 26 27) the Hoare annotation is: (let ((.cse8 (* 2 main_~st~0))) (let ((.cse0 (* 2 |old(~last~0)|)) (.cse1 (<= .cse8 2)) (.cse2 (<= 1 (+ main_~st~0 main_~c~0))) (.cse3 (<= main_~a~0 main_~b~0)) (.cse4 (<= main_~b~0 main_~a~0)) (.cse5 (<= (* 2 main_~c~0) 400000)) (.cse6 (<= 0 (+ ~last~0 main_~st~0 2147483647))) (.cse7 (<= main_~st~0 (+ main_~b~0 1)))) (or (< 4294967294 .cse0) (< (+ .cse0 4294967296) 0) (and .cse1 .cse2 .cse3 (<= (* 2 ~last~0) 4294967294) .cse4 .cse5 (<= 1 main_~st~0) .cse6 .cse7) (and .cse1 (<= 0 .cse8) .cse2 .cse3 .cse4 .cse5 (<= (+ ~last~0 1) main_~c~0) .cse6 .cse7 (<= 0 (+ main_~a~0 main_~st~0)))))) [2018-10-21 12:40:11,962 INFO L425 ceAbstractionStarter]: For program point L26-5(lines 24 34) no Hoare annotation was computed. [2018-10-21 12:40:11,962 INFO L425 ceAbstractionStarter]: For program point L24-3(lines 21 35) no Hoare annotation was computed. [2018-10-21 12:40:11,962 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2018-10-21 12:40:11,963 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-10-21 12:40:11,963 INFO L425 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2018-10-21 12:40:11,963 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 8 13) no Hoare annotation was computed. [2018-10-21 12:40:11,963 INFO L425 ceAbstractionStarter]: For program point L9(lines 9 11) no Hoare annotation was computed. [2018-10-21 12:40:11,963 INFO L425 ceAbstractionStarter]: For program point L9-2(lines 8 13) no Hoare annotation was computed. [2018-10-21 12:40:11,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 12:40:11 BoogieIcfgContainer [2018-10-21 12:40:11,980 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-21 12:40:11,980 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-21 12:40:11,980 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-21 12:40:11,980 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-21 12:40:11,981 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 12:39:52" (3/4) ... [2018-10-21 12:40:11,984 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-21 12:40:11,991 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-21 12:40:11,991 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet [2018-10-21 12:40:11,991 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-21 12:40:11,991 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-10-21 12:40:11,995 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-10-21 12:40:11,996 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-10-21 12:40:12,021 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((4294967294 < 2 * \old(last) || 2 * \old(last) + 4294967296 < 0) || ((((((b == 0 && a + b <= 0) && c <= a) || ((((b == 0 && last + 1 <= c) && a + b <= 0) && 0 <= 2 * last) && c <= a + 1)) && last + b <= 2147483647) && b <= c) && 0 <= last + a + 2147483648)) || ((((((((last <= st + 2147483646 && 200000 <= st + c) && a <= b) && b <= a) && st + 199999 <= c) && 2 * c <= 400000) && st + 1 <= a) && 0 <= last + st + 2147483647) && 2 <= a + st) [2018-10-21 12:40:12,021 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((4294967294 < 2 * \old(last) || 2 * \old(last) + 4294967296 < 0) || ((((((((2 * st <= 2 && 1 <= st + c) && a <= b) && 2 * last <= 4294967294) && b <= a) && 2 * c <= 400000) && 1 <= st) && 0 <= last + st + 2147483647) && st <= b + 1)) || (((((((((2 * st <= 2 && 0 <= 2 * st) && 1 <= st + c) && a <= b) && b <= a) && 2 * c <= 400000) && last + 1 <= c) && 0 <= last + st + 2147483647) && st <= b + 1) && 0 <= a + st) [2018-10-21 12:40:12,043 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/witness.graphml [2018-10-21 12:40:12,044 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-21 12:40:12,045 INFO L168 Benchmark]: Toolchain (without parser) took 20272.77 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 380.6 MB). Free memory was 953.2 MB in the beginning and 1.1 GB in the end (delta: -105.2 MB). Peak memory consumption was 275.5 MB. Max. memory is 11.5 GB. [2018-10-21 12:40:12,046 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-21 12:40:12,046 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.73 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 941.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-10-21 12:40:12,047 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.10 ms. Allocated memory is still 1.0 GB. Free memory is still 941.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-21 12:40:12,047 INFO L168 Benchmark]: Boogie Preprocessor took 34.33 ms. Allocated memory is still 1.0 GB. Free memory is still 941.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-21 12:40:12,049 INFO L168 Benchmark]: RCFGBuilder took 565.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 941.1 MB in the beginning and 1.1 GB in the end (delta: -188.3 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2018-10-21 12:40:12,050 INFO L168 Benchmark]: TraceAbstraction took 19320.90 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 226.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.0 MB). Peak memory consumption was 286.5 MB. Max. memory is 11.5 GB. [2018-10-21 12:40:12,051 INFO L168 Benchmark]: Witness Printer took 63.83 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. [2018-10-21 12:40:12,056 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 258.73 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 941.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.10 ms. Allocated memory is still 1.0 GB. Free memory is still 941.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.33 ms. Allocated memory is still 1.0 GB. Free memory is still 941.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 565.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 941.1 MB in the beginning and 1.1 GB in the end (delta: -188.3 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19320.90 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 226.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.0 MB). Peak memory consumption was 286.5 MB. Max. memory is 11.5 GB. * Witness Printer took 63.83 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((4294967294 < 2 * \old(last) || 2 * \old(last) + 4294967296 < 0) || ((((((((2 * st <= 2 && 1 <= st + c) && a <= b) && 2 * last <= 4294967294) && b <= a) && 2 * c <= 400000) && 1 <= st) && 0 <= last + st + 2147483647) && st <= b + 1)) || (((((((((2 * st <= 2 && 0 <= 2 * st) && 1 <= st + c) && a <= b) && b <= a) && 2 * c <= 400000) && last + 1 <= c) && 0 <= last + st + 2147483647) && st <= b + 1) && 0 <= a + st) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ((4294967294 < 2 * \old(last) || 2 * \old(last) + 4294967296 < 0) || ((((((b == 0 && a + b <= 0) && c <= a) || ((((b == 0 && last + 1 <= c) && a + b <= 0) && 0 <= 2 * last) && c <= a + 1)) && last + b <= 2147483647) && b <= c) && 0 <= last + a + 2147483648)) || ((((((((last <= st + 2147483646 && 200000 <= st + c) && a <= b) && b <= a) && st + 199999 <= c) && 2 * c <= 400000) && st + 1 <= a) && 0 <= last + st + 2147483647) && 2 <= a + st) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 29 locations, 1 error locations. SAFE Result, 19.2s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 8.0s AutomataDifference, 0.0s DeadEndRemovalTime, 2.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 270 SDtfs, 234 SDslu, 639 SDs, 0 SdLazy, 296 SolverSat, 89 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 417 GetRequests, 330 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.7s AbstIntTime, 9 AbstIntIterations, 7 AbstIntStrong, 0.9001256281407035 AbsIntWeakeningRatio, 0.5728643216080402 AbsIntAvgWeakeningVarsNumRemoved, 19.452261306532662 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 87 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 23 PreInvPairs, 40 NumberOfFragments, 317 HoareAnnotationTreeSize, 23 FomulaSimplifications, 18256 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 9 FomulaSimplificationsInter, 1178 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 415 NumberOfCodeBlocks, 415 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 497 ConstructedInterpolants, 0 QuantifiedInterpolants, 24349 SizeOfPredicates, 6 NumberOfNonLiveVariables, 258 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 17 InterpolantComputations, 6 PerfectInterpolantSequences, 151/203 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...