./Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop_true-unreach-call_false-termination.i --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-invgen/SpamAssassin-loop_true-unreach-call_false-termination.i -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 751def0588f132c393a8666a5acb62e8205c40a1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:35:11,942 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-21 12:35:11,944 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-21 12:35:11,957 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-21 12:35:11,957 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-21 12:35:11,958 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-21 12:35:11,960 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-21 12:35:11,962 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-21 12:35:11,963 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-21 12:35:11,964 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-21 12:35:11,965 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-21 12:35:11,966 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-21 12:35:11,966 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-21 12:35:11,968 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-21 12:35:11,969 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-21 12:35:11,970 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-21 12:35:11,971 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-21 12:35:11,973 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-21 12:35:11,975 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-21 12:35:11,977 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-21 12:35:11,978 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-21 12:35:11,979 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-21 12:35:11,982 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-21 12:35:11,982 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-21 12:35:11,982 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-21 12:35:11,983 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-21 12:35:11,985 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-21 12:35:11,986 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-21 12:35:11,986 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-21 12:35:11,988 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-21 12:35:11,988 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-21 12:35:11,989 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-21 12:35:11,989 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-21 12:35:11,990 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-21 12:35:11,991 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-21 12:35:11,992 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-21 12:35:11,992 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:35:12,016 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-21 12:35:12,016 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-21 12:35:12,020 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-21 12:35:12,020 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-21 12:35:12,021 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-21 12:35:12,021 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-21 12:35:12,021 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-21 12:35:12,021 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-21 12:35:12,021 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-21 12:35:12,022 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-21 12:35:12,022 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-21 12:35:12,022 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-21 12:35:12,023 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-21 12:35:12,023 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-21 12:35:12,023 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-21 12:35:12,023 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-21 12:35:12,023 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-21 12:35:12,023 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-21 12:35:12,023 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-21 12:35:12,024 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-21 12:35:12,024 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-21 12:35:12,024 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-21 12:35:12,024 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-21 12:35:12,024 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-21 12:35:12,025 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-21 12:35:12,025 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-21 12:35:12,025 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-21 12:35:12,025 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-21 12:35:12,025 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-21 12:35:12,025 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-21 12:35:12,026 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-21 12:35:12,026 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-21 12:35:12,026 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-21 12:35:12,026 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-21 12:35:12,026 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 -> 751def0588f132c393a8666a5acb62e8205c40a1 [2018-10-21 12:35:12,075 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-21 12:35:12,090 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-21 12:35:12,094 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-21 12:35:12,096 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-21 12:35:12,096 INFO L276 PluginConnector]: CDTParser initialized [2018-10-21 12:35:12,097 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop_true-unreach-call_false-termination.i [2018-10-21 12:35:12,162 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ea112b5f1/05f17d16f1304f0a91985a4edb5f5200/FLAG4a4340299 [2018-10-21 12:35:12,652 INFO L298 CDTParser]: Found 1 translation units. [2018-10-21 12:35:12,653 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop_true-unreach-call_false-termination.i [2018-10-21 12:35:12,662 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ea112b5f1/05f17d16f1304f0a91985a4edb5f5200/FLAG4a4340299 [2018-10-21 12:35:12,676 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ea112b5f1/05f17d16f1304f0a91985a4edb5f5200 [2018-10-21 12:35:12,680 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-21 12:35:12,682 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-21 12:35:12,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-21 12:35:12,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-21 12:35:12,687 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-21 12:35:12,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 12:35:12" (1/1) ... [2018-10-21 12:35:12,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60381f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:35:12, skipping insertion in model container [2018-10-21 12:35:12,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 12:35:12" (1/1) ... [2018-10-21 12:35:12,702 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-21 12:35:12,726 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-21 12:35:12,939 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-21 12:35:12,943 INFO L189 MainTranslator]: Completed pre-run [2018-10-21 12:35:12,965 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-21 12:35:12,980 INFO L193 MainTranslator]: Completed translation [2018-10-21 12:35:12,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:35:12 WrapperNode [2018-10-21 12:35:12,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-21 12:35:12,981 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-21 12:35:12,981 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-21 12:35:12,982 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-21 12:35:12,990 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:35:12" (1/1) ... [2018-10-21 12:35:12,996 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:35:12" (1/1) ... [2018-10-21 12:35:13,001 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-21 12:35:13,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-21 12:35:13,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-21 12:35:13,001 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-21 12:35:13,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:35:12" (1/1) ... [2018-10-21 12:35:13,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:35:12" (1/1) ... [2018-10-21 12:35:13,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:35:12" (1/1) ... [2018-10-21 12:35:13,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:35:12" (1/1) ... [2018-10-21 12:35:13,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:35:12" (1/1) ... [2018-10-21 12:35:13,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:35:12" (1/1) ... [2018-10-21 12:35:13,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:35:12" (1/1) ... [2018-10-21 12:35:13,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-21 12:35:13,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-21 12:35:13,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-21 12:35:13,024 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-21 12:35:13,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:35:12" (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:35:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-21 12:35:13,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-21 12:35:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-21 12:35:13,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-21 12:35:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-21 12:35:13,153 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-21 12:35:13,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-21 12:35:13,153 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-21 12:35:13,599 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-21 12:35:13,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 12:35:13 BoogieIcfgContainer [2018-10-21 12:35:13,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-21 12:35:13,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-21 12:35:13,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-21 12:35:13,605 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-21 12:35:13,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 12:35:12" (1/3) ... [2018-10-21 12:35:13,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58dd1513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 12:35:13, skipping insertion in model container [2018-10-21 12:35:13,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:35:12" (2/3) ... [2018-10-21 12:35:13,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58dd1513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 12:35:13, skipping insertion in model container [2018-10-21 12:35:13,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 12:35:13" (3/3) ... [2018-10-21 12:35:13,610 INFO L112 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop_true-unreach-call_false-termination.i [2018-10-21 12:35:13,620 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-21 12:35:13,629 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-21 12:35:13,647 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-21 12:35:13,682 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-21 12:35:13,683 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-21 12:35:13,683 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-21 12:35:13,683 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-21 12:35:13,683 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-21 12:35:13,684 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-21 12:35:13,684 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-21 12:35:13,684 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-21 12:35:13,684 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-21 12:35:13,716 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-10-21 12:35:13,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-21 12:35:13,726 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:35:13,727 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:35:13,729 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:35:13,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:35:13,734 INFO L82 PathProgramCache]: Analyzing trace with hash -372910930, now seen corresponding path program 1 times [2018-10-21 12:35:13,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:35:13,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:35:13,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:35:13,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:35:13,784 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:35:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:35:13,949 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:35:13,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-21 12:35:13,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-21 12:35:13,951 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:35:13,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-21 12:35:13,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-21 12:35:13,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-21 12:35:13,971 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 5 states. [2018-10-21 12:35:14,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:35:14,440 INFO L93 Difference]: Finished difference Result 90 states and 153 transitions. [2018-10-21 12:35:14,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-21 12:35:14,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-10-21 12:35:14,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:35:14,452 INFO L225 Difference]: With dead ends: 90 [2018-10-21 12:35:14,453 INFO L226 Difference]: Without dead ends: 47 [2018-10-21 12:35:14,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-21 12:35:14,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-21 12:35:14,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-10-21 12:35:14,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-21 12:35:14,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2018-10-21 12:35:14,529 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 15 [2018-10-21 12:35:14,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:35:14,531 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2018-10-21 12:35:14,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-21 12:35:14,531 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2018-10-21 12:35:14,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-21 12:35:14,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:35:14,534 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:35:14,536 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:35:14,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:35:14,538 INFO L82 PathProgramCache]: Analyzing trace with hash -394866897, now seen corresponding path program 1 times [2018-10-21 12:35:14,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:35:14,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:35:14,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:35:14,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:35:14,541 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:35:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:35:14,782 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:35:14,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-21 12:35:14,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-21 12:35:14,783 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:35:14,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-21 12:35:14,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-21 12:35:14,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-21 12:35:14,790 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand 5 states. [2018-10-21 12:35:15,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:35:15,018 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2018-10-21 12:35:15,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-21 12:35:15,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-10-21 12:35:15,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:35:15,022 INFO L225 Difference]: With dead ends: 58 [2018-10-21 12:35:15,022 INFO L226 Difference]: Without dead ends: 56 [2018-10-21 12:35:15,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-21 12:35:15,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-21 12:35:15,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-10-21 12:35:15,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-21 12:35:15,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 68 transitions. [2018-10-21 12:35:15,042 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 68 transitions. Word has length 15 [2018-10-21 12:35:15,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:35:15,042 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 68 transitions. [2018-10-21 12:35:15,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-21 12:35:15,042 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 68 transitions. [2018-10-21 12:35:15,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-21 12:35:15,044 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:35:15,044 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:35:15,045 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:35:15,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:35:15,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1825950327, now seen corresponding path program 1 times [2018-10-21 12:35:15,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:35:15,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:35:15,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:35:15,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:35:15,047 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:35:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:35:15,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:35:15,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:35:15,298 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:35:15,298 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-10-21 12:35:15,301 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [26], [52], [68], [71], [73], [76], [78], [79], [80], [81], [107], [108], [109] [2018-10-21 12:35:15,352 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-21 12:35:15,353 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-21 12:35:15,536 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-21 12:35:15,538 INFO L272 AbstractInterpreter]: Visited 18 different actions 22 times. Never merged. Never widened. Never found a fixpoint. Largest state had 7 variables. [2018-10-21 12:35:15,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:35:15,552 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-21 12:35:15,671 INFO L232 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 53.64% of their original sizes. [2018-10-21 12:35:15,672 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-21 12:35:16,030 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-21 12:35:16,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-21 12:35:16,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2018-10-21 12:35:16,031 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:35:16,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-21 12:35:16,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-21 12:35:16,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-21 12:35:16,034 INFO L87 Difference]: Start difference. First operand 52 states and 68 transitions. Second operand 10 states. [2018-10-21 12:35:17,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:35:17,703 INFO L93 Difference]: Finished difference Result 92 states and 122 transitions. [2018-10-21 12:35:17,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-21 12:35:17,703 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-10-21 12:35:17,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:35:17,706 INFO L225 Difference]: With dead ends: 92 [2018-10-21 12:35:17,707 INFO L226 Difference]: Without dead ends: 90 [2018-10-21 12:35:17,707 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-10-21 12:35:17,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-21 12:35:17,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2018-10-21 12:35:17,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-21 12:35:17,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 109 transitions. [2018-10-21 12:35:17,738 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 109 transitions. Word has length 20 [2018-10-21 12:35:17,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:35:17,738 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 109 transitions. [2018-10-21 12:35:17,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-21 12:35:17,739 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 109 transitions. [2018-10-21 12:35:17,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-21 12:35:17,740 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:35:17,741 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] [2018-10-21 12:35:17,742 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:35:17,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:35:17,742 INFO L82 PathProgramCache]: Analyzing trace with hash -443407858, now seen corresponding path program 1 times [2018-10-21 12:35:17,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:35:17,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:35:17,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:35:17,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:35:17,745 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:35:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:35:17,971 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-21 12:35:17,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:35:17,971 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:35:17,971 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-10-21 12:35:17,972 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [26], [52], [68], [71], [73], [76], [78], [79], [80], [81], [107], [108], [109], [110], [111] [2018-10-21 12:35:17,974 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-21 12:35:17,974 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-21 12:35:18,004 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-21 12:35:18,006 INFO L272 AbstractInterpreter]: Visited 20 different actions 28 times. Never merged. Never widened. Never found a fixpoint. Largest state had 7 variables. [2018-10-21 12:35:18,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:35:18,036 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-21 12:35:18,080 INFO L232 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 62.73% of their original sizes. [2018-10-21 12:35:18,080 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-21 12:35:18,361 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-21 12:35:18,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-21 12:35:18,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2018-10-21 12:35:18,363 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:35:18,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-21 12:35:18,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-21 12:35:18,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-10-21 12:35:18,366 INFO L87 Difference]: Start difference. First operand 82 states and 109 transitions. Second operand 11 states. [2018-10-21 12:35:20,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:35:20,415 INFO L93 Difference]: Finished difference Result 96 states and 125 transitions. [2018-10-21 12:35:20,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-21 12:35:20,416 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-10-21 12:35:20,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:35:20,418 INFO L225 Difference]: With dead ends: 96 [2018-10-21 12:35:20,418 INFO L226 Difference]: Without dead ends: 94 [2018-10-21 12:35:20,419 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2018-10-21 12:35:20,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-21 12:35:20,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. [2018-10-21 12:35:20,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-21 12:35:20,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 112 transitions. [2018-10-21 12:35:20,444 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 112 transitions. Word has length 25 [2018-10-21 12:35:20,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:35:20,445 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 112 transitions. [2018-10-21 12:35:20,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-21 12:35:20,446 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 112 transitions. [2018-10-21 12:35:20,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-21 12:35:20,448 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:35:20,449 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:35:20,449 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:35:20,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:35:20,449 INFO L82 PathProgramCache]: Analyzing trace with hash 2114615578, now seen corresponding path program 1 times [2018-10-21 12:35:20,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:35:20,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:35:20,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:35:20,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:35:20,452 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:35:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:35:20,615 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-21 12:35:20,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:35:20,616 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:35:20,616 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-10-21 12:35:20,616 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [26], [52], [58], [68], [71], [73], [76], [78], [79], [80], [81], [107], [108], [109], [110], [111], [112], [113], [114] [2018-10-21 12:35:20,619 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-21 12:35:20,619 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-21 12:35:20,639 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-21 12:35:20,639 INFO L272 AbstractInterpreter]: Visited 24 different actions 38 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 9 variables. [2018-10-21 12:35:20,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:35:20,678 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-21 12:35:20,738 INFO L232 lantSequenceWeakener]: Weakened 23 states. On average, predicates are now at 68.7% of their original sizes. [2018-10-21 12:35:20,738 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-21 12:35:21,481 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-21 12:35:21,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-21 12:35:21,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [8] total 20 [2018-10-21 12:35:21,482 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:35:21,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-21 12:35:21,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-21 12:35:21,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-10-21 12:35:21,483 INFO L87 Difference]: Start difference. First operand 86 states and 112 transitions. Second operand 14 states. [2018-10-21 12:35:22,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:35:22,897 INFO L93 Difference]: Finished difference Result 133 states and 177 transitions. [2018-10-21 12:35:22,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-21 12:35:22,897 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-10-21 12:35:22,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:35:22,902 INFO L225 Difference]: With dead ends: 133 [2018-10-21 12:35:22,902 INFO L226 Difference]: Without dead ends: 131 [2018-10-21 12:35:22,903 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-10-21 12:35:22,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-21 12:35:22,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-10-21 12:35:22,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-21 12:35:22,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 166 transitions. [2018-10-21 12:35:22,941 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 166 transitions. Word has length 44 [2018-10-21 12:35:22,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:35:22,942 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 166 transitions. [2018-10-21 12:35:22,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-21 12:35:22,943 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 166 transitions. [2018-10-21 12:35:22,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-21 12:35:22,945 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:35:22,945 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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:35:22,946 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:35:22,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:35:22,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1255310588, now seen corresponding path program 1 times [2018-10-21 12:35:22,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:35:22,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:35:22,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:35:22,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:35:22,948 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:35:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:35:23,049 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-10-21 12:35:23,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:35:23,049 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:35:23,050 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-10-21 12:35:23,050 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [26], [29], [32], [37], [42], [68], [71], [73], [76], [78], [79], [80], [81], [83], [84], [85], [86], [87], [88], [89], [90], [91], [92], [93], [94], [95] [2018-10-21 12:35:23,054 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-21 12:35:23,054 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-21 12:35:23,077 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-21 12:35:23,078 INFO L272 AbstractInterpreter]: Visited 31 different actions 55 times. Never merged. Never widened. Never found a fixpoint. Largest state had 10 variables. [2018-10-21 12:35:23,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:35:23,093 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-21 12:35:23,141 INFO L232 lantSequenceWeakener]: Weakened 30 states. On average, predicates are now at 61.56% of their original sizes. [2018-10-21 12:35:23,141 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-21 12:35:23,349 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-21 12:35:23,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-21 12:35:23,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 17 [2018-10-21 12:35:23,349 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:35:23,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-21 12:35:23,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-21 12:35:23,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-10-21 12:35:23,351 INFO L87 Difference]: Start difference. First operand 123 states and 166 transitions. Second operand 12 states. [2018-10-21 12:35:26,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:35:26,728 INFO L93 Difference]: Finished difference Result 171 states and 228 transitions. [2018-10-21 12:35:26,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-21 12:35:26,729 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-10-21 12:35:26,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:35:26,731 INFO L225 Difference]: With dead ends: 171 [2018-10-21 12:35:26,731 INFO L226 Difference]: Without dead ends: 169 [2018-10-21 12:35:26,732 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-10-21 12:35:26,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-21 12:35:26,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 157. [2018-10-21 12:35:26,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-21 12:35:26,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 208 transitions. [2018-10-21 12:35:26,783 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 208 transitions. Word has length 48 [2018-10-21 12:35:26,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:35:26,784 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 208 transitions. [2018-10-21 12:35:26,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-21 12:35:26,784 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 208 transitions. [2018-10-21 12:35:26,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-21 12:35:26,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:35:26,788 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:26,789 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:35:26,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:35:26,789 INFO L82 PathProgramCache]: Analyzing trace with hash -979286812, now seen corresponding path program 1 times [2018-10-21 12:35:26,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:35:26,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:35:26,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:35:26,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:35:26,790 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:35:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:35:26,930 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-10-21 12:35:26,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:35:26,931 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:35:26,931 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-10-21 12:35:26,931 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [26], [29], [32], [37], [42], [68], [71], [73], [76], [78], [79], [80], [81], [83], [84], [85], [86], [87], [88], [89], [90], [91], [92], [93], [94], [95], [96], [97], [98], [99] [2018-10-21 12:35:26,935 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-21 12:35:26,938 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-21 12:35:26,967 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-21 12:35:26,967 INFO L272 AbstractInterpreter]: Visited 35 different actions 67 times. Never merged. Never widened. Never found a fixpoint. Largest state had 10 variables. [2018-10-21 12:35:26,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:35:26,969 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-21 12:35:27,015 INFO L232 lantSequenceWeakener]: Weakened 38 states. On average, predicates are now at 62.28% of their original sizes. [2018-10-21 12:35:27,016 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-21 12:35:27,323 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-21 12:35:27,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-21 12:35:27,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [9] total 20 [2018-10-21 12:35:27,324 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:35:27,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-21 12:35:27,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-21 12:35:27,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-10-21 12:35:27,325 INFO L87 Difference]: Start difference. First operand 157 states and 208 transitions. Second operand 13 states. [2018-10-21 12:35:31,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:35:31,625 INFO L93 Difference]: Finished difference Result 229 states and 308 transitions. [2018-10-21 12:35:31,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-21 12:35:31,626 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 58 [2018-10-21 12:35:31,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:35:31,628 INFO L225 Difference]: With dead ends: 229 [2018-10-21 12:35:31,629 INFO L226 Difference]: Without dead ends: 227 [2018-10-21 12:35:31,629 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-10-21 12:35:31,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-21 12:35:31,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 191. [2018-10-21 12:35:31,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-21 12:35:31,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 254 transitions. [2018-10-21 12:35:31,680 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 254 transitions. Word has length 58 [2018-10-21 12:35:31,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:35:31,680 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 254 transitions. [2018-10-21 12:35:31,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-21 12:35:31,680 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 254 transitions. [2018-10-21 12:35:31,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-21 12:35:31,684 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:35:31,684 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 3, 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, 1, 1] [2018-10-21 12:35:31,684 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:35:31,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:35:31,685 INFO L82 PathProgramCache]: Analyzing trace with hash 377935603, now seen corresponding path program 1 times [2018-10-21 12:35:31,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:35:31,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:35:31,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:35:31,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:35:31,687 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:35:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:35:31,832 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-10-21 12:35:31,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:35:31,832 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:35:31,833 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-10-21 12:35:31,833 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [24], [26], [29], [32], [35], [52], [58], [68], [71], [73], [76], [78], [79], [80], [81], [83], [84], [85], [86], [107], [108], [109], [110], [111], [112], [113], [114] [2018-10-21 12:35:31,835 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-21 12:35:31,835 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-21 12:35:32,349 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-21 12:35:32,350 INFO L272 AbstractInterpreter]: Visited 32 different actions 1156 times. Merged at 16 different actions 299 times. Widened at 3 different actions 24 times. Found 38 fixpoints after 6 different actions. Largest state had 10 variables. [2018-10-21 12:35:32,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:35:32,385 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-21 12:35:32,519 INFO L232 lantSequenceWeakener]: Weakened 29 states. On average, predicates are now at 75.52% of their original sizes. [2018-10-21 12:35:32,519 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-21 12:35:33,237 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-21 12:35:33,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-21 12:35:33,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 19 [2018-10-21 12:35:33,237 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:35:33,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-21 12:35:33,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-21 12:35:33,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-10-21 12:35:33,239 INFO L87 Difference]: Start difference. First operand 191 states and 254 transitions. Second operand 13 states. [2018-10-21 12:35:34,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:35:34,703 INFO L93 Difference]: Finished difference Result 252 states and 334 transitions. [2018-10-21 12:35:34,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-21 12:35:34,704 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2018-10-21 12:35:34,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:35:34,709 INFO L225 Difference]: With dead ends: 252 [2018-10-21 12:35:34,709 INFO L226 Difference]: Without dead ends: 250 [2018-10-21 12:35:34,710 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-10-21 12:35:34,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-21 12:35:34,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 239. [2018-10-21 12:35:34,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-10-21 12:35:34,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 314 transitions. [2018-10-21 12:35:34,778 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 314 transitions. Word has length 65 [2018-10-21 12:35:34,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:35:34,779 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 314 transitions. [2018-10-21 12:35:34,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-21 12:35:34,779 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 314 transitions. [2018-10-21 12:35:34,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-21 12:35:34,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:35:34,783 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:34,783 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:35:34,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:35:34,783 INFO L82 PathProgramCache]: Analyzing trace with hash -2026132663, now seen corresponding path program 1 times [2018-10-21 12:35:34,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:35:34,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:35:34,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:35:34,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:35:34,785 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:35:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:35:34,920 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 19 proven. 28 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-10-21 12:35:34,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:35:34,920 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:35:34,920 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 70 with the following transitions: [2018-10-21 12:35:34,921 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [26], [29], [32], [37], [42], [47], [68], [71], [73], [76], [78], [79], [80], [81], [83], [84], [85], [86], [87], [88], [89], [90], [91], [92], [93], [94], [95], [96], [97], [98], [99], [100], [101], [102], [103] [2018-10-21 12:35:34,922 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-21 12:35:34,922 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-21 12:35:34,948 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-21 12:35:34,949 INFO L272 AbstractInterpreter]: Visited 40 different actions 80 times. Never merged. Never widened. Never found a fixpoint. Largest state had 12 variables. [2018-10-21 12:35:34,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:35:34,954 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-21 12:35:35,004 INFO L232 lantSequenceWeakener]: Weakened 47 states. On average, predicates are now at 63.55% of their original sizes. [2018-10-21 12:35:35,004 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-21 12:35:35,221 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-21 12:35:35,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-21 12:35:35,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [10] total 21 [2018-10-21 12:35:35,222 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:35:35,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-21 12:35:35,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-21 12:35:35,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-10-21 12:35:35,224 INFO L87 Difference]: Start difference. First operand 239 states and 314 transitions. Second operand 13 states. [2018-10-21 12:35:42,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:35:42,988 INFO L93 Difference]: Finished difference Result 335 states and 461 transitions. [2018-10-21 12:35:42,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-21 12:35:42,988 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-10-21 12:35:42,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:35:42,998 INFO L225 Difference]: With dead ends: 335 [2018-10-21 12:35:42,998 INFO L226 Difference]: Without dead ends: 333 [2018-10-21 12:35:43,000 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-10-21 12:35:43,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-10-21 12:35:43,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 316. [2018-10-21 12:35:43,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-10-21 12:35:43,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 442 transitions. [2018-10-21 12:35:43,133 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 442 transitions. Word has length 69 [2018-10-21 12:35:43,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:35:43,134 INFO L481 AbstractCegarLoop]: Abstraction has 316 states and 442 transitions. [2018-10-21 12:35:43,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-21 12:35:43,134 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 442 transitions. [2018-10-21 12:35:43,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-21 12:35:43,140 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:35:43,140 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:35:43,140 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:35:43,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:35:43,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1267705639, now seen corresponding path program 1 times [2018-10-21 12:35:43,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:35:43,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:35:43,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:35:43,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:35:43,142 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:35:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:35:43,282 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 35 proven. 15 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-10-21 12:35:43,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:35:43,283 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:35:43,283 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 73 with the following transitions: [2018-10-21 12:35:43,283 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [26], [29], [32], [37], [42], [52], [58], [68], [71], [73], [76], [78], [79], [80], [81], [83], [84], [85], [86], [87], [88], [89], [90], [91], [92], [93], [94], [95], [107], [108], [109], [110], [111], [112], [113], [114] [2018-10-21 12:35:43,285 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-21 12:35:43,285 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-21 12:35:43,314 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-21 12:35:43,314 INFO L272 AbstractInterpreter]: Visited 41 different actions 83 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 12 variables. [2018-10-21 12:35:43,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:35:43,346 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-21 12:35:43,415 INFO L232 lantSequenceWeakener]: Weakened 42 states. On average, predicates are now at 67.78% of their original sizes. [2018-10-21 12:35:43,415 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-21 12:35:43,687 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-21 12:35:43,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-21 12:35:43,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [8] total 20 [2018-10-21 12:35:43,688 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:35:43,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-21 12:35:43,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-21 12:35:43,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-10-21 12:35:43,690 INFO L87 Difference]: Start difference. First operand 316 states and 442 transitions. Second operand 14 states. [2018-10-21 12:35:46,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:35:46,108 INFO L93 Difference]: Finished difference Result 393 states and 551 transitions. [2018-10-21 12:35:46,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-21 12:35:46,108 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-10-21 12:35:46,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:35:46,113 INFO L225 Difference]: With dead ends: 393 [2018-10-21 12:35:46,113 INFO L226 Difference]: Without dead ends: 391 [2018-10-21 12:35:46,114 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 77 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-10-21 12:35:46,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-10-21 12:35:46,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 370. [2018-10-21 12:35:46,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-10-21 12:35:46,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 515 transitions. [2018-10-21 12:35:46,222 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 515 transitions. Word has length 72 [2018-10-21 12:35:46,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:35:46,222 INFO L481 AbstractCegarLoop]: Abstraction has 370 states and 515 transitions. [2018-10-21 12:35:46,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-21 12:35:46,222 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 515 transitions. [2018-10-21 12:35:46,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-21 12:35:46,226 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:35:46,227 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:35:46,227 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:35:46,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:35:46,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1889944727, now seen corresponding path program 1 times [2018-10-21 12:35:46,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:35:46,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:35:46,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:35:46,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:35:46,230 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:35:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:35:46,507 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 26 proven. 34 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-10-21 12:35:46,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:35:46,507 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:35:46,508 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 85 with the following transitions: [2018-10-21 12:35:46,508 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [26], [29], [32], [35], [37], [42], [58], [68], [71], [73], [76], [78], [79], [80], [81], [83], [84], [85], [86], [87], [88], [89], [90], [91], [92], [93], [94], [95], [107], [108], [109], [110], [111], [112], [113], [114] [2018-10-21 12:35:46,511 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-21 12:35:46,511 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-21 12:35:46,654 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-21 12:35:46,654 INFO L272 AbstractInterpreter]: Visited 41 different actions 592 times. Merged at 18 different actions 126 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 12 variables. [2018-10-21 12:35:46,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:35:46,690 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-21 12:35:46,763 INFO L232 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 69.72% of their original sizes. [2018-10-21 12:35:46,763 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-21 12:35:47,206 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-21 12:35:47,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-21 12:35:47,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [7] total 20 [2018-10-21 12:35:47,206 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:35:47,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-21 12:35:47,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-21 12:35:47,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-10-21 12:35:47,208 INFO L87 Difference]: Start difference. First operand 370 states and 515 transitions. Second operand 15 states. [2018-10-21 12:35:51,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:35:51,968 INFO L93 Difference]: Finished difference Result 474 states and 670 transitions. [2018-10-21 12:35:51,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-21 12:35:51,968 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 84 [2018-10-21 12:35:51,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:35:51,972 INFO L225 Difference]: With dead ends: 474 [2018-10-21 12:35:51,972 INFO L226 Difference]: Without dead ends: 472 [2018-10-21 12:35:51,973 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 94 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2018-10-21 12:35:51,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2018-10-21 12:35:52,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 458. [2018-10-21 12:35:52,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-10-21 12:35:52,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 650 transitions. [2018-10-21 12:35:52,119 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 650 transitions. Word has length 84 [2018-10-21 12:35:52,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:35:52,120 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 650 transitions. [2018-10-21 12:35:52,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-21 12:35:52,120 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 650 transitions. [2018-10-21 12:35:52,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-21 12:35:52,124 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:35:52,124 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:35:52,124 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:35:52,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:35:52,125 INFO L82 PathProgramCache]: Analyzing trace with hash 532621103, now seen corresponding path program 1 times [2018-10-21 12:35:52,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:35:52,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:35:52,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:35:52,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:35:52,127 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:35:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:35:52,231 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 39 proven. 25 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2018-10-21 12:35:52,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:35:52,231 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:35:52,231 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 87 with the following transitions: [2018-10-21 12:35:52,231 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [24], [26], [29], [32], [37], [42], [52], [58], [68], [71], [73], [76], [78], [79], [80], [81], [83], [84], [85], [86], [87], [88], [89], [90], [91], [92], [93], [94], [95], [96], [97], [98], [99], [107], [108], [109], [110], [111], [112], [113], [114] [2018-10-21 12:35:52,233 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-21 12:35:52,233 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-21 12:35:52,283 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-21 12:35:52,283 INFO L272 AbstractInterpreter]: Visited 46 different actions 99 times. Merged at 4 different actions 4 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 12 variables. [2018-10-21 12:35:52,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:35:52,288 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-21 12:35:52,349 INFO L232 lantSequenceWeakener]: Weakened 54 states. On average, predicates are now at 63.83% of their original sizes. [2018-10-21 12:35:52,349 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-21 12:35:52,664 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-21 12:35:52,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-21 12:35:52,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 21 [2018-10-21 12:35:52,665 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:35:52,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-21 12:35:52,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-21 12:35:52,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-10-21 12:35:52,667 INFO L87 Difference]: Start difference. First operand 458 states and 650 transitions. Second operand 15 states. [2018-10-21 12:35:56,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:35:56,345 INFO L93 Difference]: Finished difference Result 562 states and 786 transitions. [2018-10-21 12:35:56,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-21 12:35:56,345 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 86 [2018-10-21 12:35:56,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:35:56,347 INFO L225 Difference]: With dead ends: 562 [2018-10-21 12:35:56,347 INFO L226 Difference]: Without dead ends: 320 [2018-10-21 12:35:56,352 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 90 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-10-21 12:35:56,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-10-21 12:35:56,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 316. [2018-10-21 12:35:56,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-10-21 12:35:56,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 436 transitions. [2018-10-21 12:35:56,438 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 436 transitions. Word has length 86 [2018-10-21 12:35:56,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:35:56,439 INFO L481 AbstractCegarLoop]: Abstraction has 316 states and 436 transitions. [2018-10-21 12:35:56,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-21 12:35:56,439 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 436 transitions. [2018-10-21 12:35:56,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-21 12:35:56,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:35:56,442 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:35:56,442 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:35:56,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:35:56,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1428285441, now seen corresponding path program 1 times [2018-10-21 12:35:56,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:35:56,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:35:56,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:35:56,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:35:56,445 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:35:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:35:56,599 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 45 proven. 50 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-10-21 12:35:56,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:35:56,600 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:35:56,600 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 89 with the following transitions: [2018-10-21 12:35:56,600 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [26], [29], [32], [37], [42], [47], [50], [52], [68], [71], [73], [76], [78], [79], [80], [81], [83], [84], [85], [86], [87], [88], [89], [90], [91], [92], [93], [94], [95], [96], [97], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109] [2018-10-21 12:35:56,603 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-21 12:35:56,604 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-21 12:35:56,764 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-21 12:35:56,764 INFO L272 AbstractInterpreter]: Visited 48 different actions 652 times. Merged at 22 different actions 132 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 13 variables. [2018-10-21 12:35:56,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:35:56,789 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-21 12:35:56,865 INFO L232 lantSequenceWeakener]: Weakened 47 states. On average, predicates are now at 76.17% of their original sizes. [2018-10-21 12:35:56,865 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-21 12:35:57,276 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-21 12:35:57,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-21 12:35:57,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [8] total 23 [2018-10-21 12:35:57,277 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:35:57,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-21 12:35:57,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-21 12:35:57,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-10-21 12:35:57,278 INFO L87 Difference]: Start difference. First operand 316 states and 436 transitions. Second operand 17 states. [2018-10-21 12:36:04,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:36:04,434 INFO L93 Difference]: Finished difference Result 502 states and 705 transitions. [2018-10-21 12:36:04,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-21 12:36:04,434 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2018-10-21 12:36:04,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:36:04,439 INFO L225 Difference]: With dead ends: 502 [2018-10-21 12:36:04,439 INFO L226 Difference]: Without dead ends: 500 [2018-10-21 12:36:04,440 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 106 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=287, Invalid=903, Unknown=0, NotChecked=0, Total=1190 [2018-10-21 12:36:04,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-10-21 12:36:04,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 382. [2018-10-21 12:36:04,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-21 12:36:04,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 522 transitions. [2018-10-21 12:36:04,573 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 522 transitions. Word has length 88 [2018-10-21 12:36:04,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:36:04,574 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 522 transitions. [2018-10-21 12:36:04,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-21 12:36:04,574 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 522 transitions. [2018-10-21 12:36:04,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-21 12:36:04,577 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:36:04,578 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:36:04,578 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:36:04,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:36:04,578 INFO L82 PathProgramCache]: Analyzing trace with hash 932385919, now seen corresponding path program 1 times [2018-10-21 12:36:04,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:36:04,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:36:04,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:36:04,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:36:04,579 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:36:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:36:04,762 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 26 proven. 34 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2018-10-21 12:36:04,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:36:04,762 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:36:04,763 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 89 with the following transitions: [2018-10-21 12:36:04,763 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [24], [26], [29], [32], [35], [37], [42], [58], [68], [71], [73], [76], [78], [79], [80], [81], [83], [84], [85], [86], [87], [88], [89], [90], [91], [92], [93], [94], [95], [107], [108], [109], [110], [111], [112], [113], [114] [2018-10-21 12:36:04,765 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-21 12:36:04,766 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-21 12:36:05,041 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-21 12:36:05,042 INFO L272 AbstractInterpreter]: Visited 42 different actions 1368 times. Merged at 21 different actions 334 times. Widened at 3 different actions 23 times. Found 19 fixpoints after 3 different actions. Largest state had 12 variables. [2018-10-21 12:36:05,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:36:05,064 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-21 12:36:05,126 INFO L232 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 69.72% of their original sizes. [2018-10-21 12:36:05,126 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-21 12:36:05,951 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-21 12:36:05,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-21 12:36:05,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [7] total 20 [2018-10-21 12:36:05,952 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:36:05,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-21 12:36:05,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-21 12:36:05,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-10-21 12:36:05,953 INFO L87 Difference]: Start difference. First operand 382 states and 522 transitions. Second operand 15 states. [2018-10-21 12:36:09,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:36:09,490 INFO L93 Difference]: Finished difference Result 504 states and 705 transitions. [2018-10-21 12:36:09,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-21 12:36:09,491 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 88 [2018-10-21 12:36:09,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:36:09,496 INFO L225 Difference]: With dead ends: 504 [2018-10-21 12:36:09,497 INFO L226 Difference]: Without dead ends: 502 [2018-10-21 12:36:09,498 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2018-10-21 12:36:09,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2018-10-21 12:36:09,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 460. [2018-10-21 12:36:09,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-10-21 12:36:09,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 636 transitions. [2018-10-21 12:36:09,660 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 636 transitions. Word has length 88 [2018-10-21 12:36:09,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:36:09,661 INFO L481 AbstractCegarLoop]: Abstraction has 460 states and 636 transitions. [2018-10-21 12:36:09,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-21 12:36:09,661 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 636 transitions. [2018-10-21 12:36:09,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-21 12:36:09,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:36:09,663 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:36:09,663 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:36:09,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:36:09,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1245277849, now seen corresponding path program 1 times [2018-10-21 12:36:09,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:36:09,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:36:09,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:36:09,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:36:09,666 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:36:09,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:36:10,339 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 49 proven. 50 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-10-21 12:36:10,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:36:10,340 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:36:10,340 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 93 with the following transitions: [2018-10-21 12:36:10,340 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [24], [26], [29], [32], [37], [42], [47], [50], [52], [68], [71], [73], [76], [78], [79], [80], [81], [83], [84], [85], [86], [87], [88], [89], [90], [91], [92], [93], [94], [95], [96], [97], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109] [2018-10-21 12:36:10,346 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-21 12:36:10,347 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-21 12:36:10,786 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-21 12:36:10,786 INFO L272 AbstractInterpreter]: Visited 49 different actions 1521 times. Merged at 25 different actions 354 times. Widened at 3 different actions 18 times. Found 18 fixpoints after 4 different actions. Largest state had 13 variables. [2018-10-21 12:36:10,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:36:10,789 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-21 12:36:10,850 INFO L232 lantSequenceWeakener]: Weakened 51 states. On average, predicates are now at 71.96% of their original sizes. [2018-10-21 12:36:10,851 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-21 12:36:11,343 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-21 12:36:11,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-21 12:36:11,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [8] total 24 [2018-10-21 12:36:11,343 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:36:11,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-21 12:36:11,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-21 12:36:11,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-10-21 12:36:11,344 INFO L87 Difference]: Start difference. First operand 460 states and 636 transitions. Second operand 18 states. [2018-10-21 12:36:17,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:36:17,120 INFO L93 Difference]: Finished difference Result 905 states and 1335 transitions. [2018-10-21 12:36:17,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-21 12:36:17,120 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 92 [2018-10-21 12:36:17,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:36:17,120 INFO L225 Difference]: With dead ends: 905 [2018-10-21 12:36:17,120 INFO L226 Difference]: Without dead ends: 0 [2018-10-21 12:36:17,124 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 105 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=279, Invalid=651, Unknown=0, NotChecked=0, Total=930 [2018-10-21 12:36:17,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-21 12:36:17,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-21 12:36:17,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-21 12:36:17,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-21 12:36:17,125 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2018-10-21 12:36:17,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:36:17,127 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-21 12:36:17,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-21 12:36:17,128 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-21 12:36:17,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-21 12:36:17,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-21 12:36:18,436 WARN L179 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 399 DAG size of output: 231 [2018-10-21 12:36:18,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-21 12:36:18,593 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 119 [2018-10-21 12:36:19,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-21 12:36:19,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-21 12:36:19,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-21 12:36:19,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-21 12:36:20,236 WARN L179 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 406 DAG size of output: 353 [2018-10-21 12:36:20,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-21 12:36:20,390 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 119 [2018-10-21 12:36:21,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-21 12:36:21,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-21 12:36:21,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-21 12:36:21,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-21 12:36:22,330 WARN L179 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 406 DAG size of output: 353 [2018-10-21 12:36:22,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-21 12:36:22,479 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 119 [2018-10-21 12:36:22,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-21 12:36:22,631 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 119 [2018-10-21 12:36:22,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-21 12:36:22,869 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 348 DAG size of output: 142 [2018-10-21 12:36:22,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-21 12:36:23,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-21 12:36:23,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-21 12:36:23,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-21 12:36:23,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-21 12:36:23,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-21 12:36:23,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-21 12:36:23,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-21 12:36:23,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-21 12:36:23,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-21 12:36:24,111 WARN L179 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 406 DAG size of output: 348 [2018-10-21 12:36:24,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-21 12:36:24,290 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 348 DAG size of output: 142 [2018-10-21 12:36:24,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-21 12:36:24,616 WARN L179 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 362 DAG size of output: 293 [2018-10-21 12:36:25,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-21 12:36:25,093 WARN L179 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 377 DAG size of output: 222 [2018-10-21 12:36:25,885 WARN L179 SmtUtils]: Spent 746.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 37 [2018-10-21 12:36:26,081 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 27 [2018-10-21 12:36:26,214 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 26 [2018-10-21 12:36:28,321 WARN L179 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 351 DAG size of output: 37 [2018-10-21 12:36:28,484 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 27 [2018-10-21 12:36:28,627 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 26 [2018-10-21 12:36:30,556 WARN L179 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 351 DAG size of output: 37 [2018-10-21 12:36:30,685 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 27 [2018-10-21 12:36:30,813 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 27 [2018-10-21 12:36:30,943 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 25 [2018-10-21 12:36:31,501 WARN L179 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 27 [2018-10-21 12:36:31,633 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 25 [2018-10-21 12:36:33,376 WARN L179 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 343 DAG size of output: 40 [2018-10-21 12:36:33,942 WARN L179 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 27 [2018-10-21 12:36:34,709 WARN L179 SmtUtils]: Spent 764.00 ms on a formula simplification. DAG size of input: 292 DAG size of output: 30 [2018-10-21 12:36:35,237 WARN L179 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 26 [2018-10-21 12:36:35,665 WARN L179 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 37 [2018-10-21 12:36:35,795 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 26 [2018-10-21 12:36:35,799 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-21 12:36:35,799 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-21 12:36:35,799 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-21 12:36:35,799 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-21 12:36:35,799 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-21 12:36:35,799 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-21 12:36:35,799 INFO L421 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse0 (+ main_~limit~0 4))) (and (<= (* 2 main_~len~0) 4294967294) (<= (+ main_~i~0 2) main_~len~0) (<= 0 (* 2 main_~j~0)) (<= .cse0 main_~bufsize~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (* 2 main_~limit~0) 4294967286) (<= 0 (* 2 main_~i~0)) (<= main_~bufsize~0 .cse0))) [2018-10-21 12:36:35,800 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 53) no Hoare annotation was computed. [2018-10-21 12:36:35,800 INFO L421 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (let ((.cse0 (+ main_~limit~0 4))) (and (<= (* 2 main_~len~0) 4294967294) (<= (+ main_~i~0 2) main_~len~0) (<= 0 (* 2 main_~j~0)) (<= .cse0 main_~bufsize~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (* 2 main_~limit~0) 4294967286) (<= 0 (* 2 main_~i~0)) (<= main_~bufsize~0 .cse0))) [2018-10-21 12:36:35,800 INFO L421 ceAbstractionStarter]: At program point L23-1(line 23) the Hoare annotation is: (let ((.cse0 (+ main_~limit~0 4))) (and (<= (* 2 main_~len~0) 4294967294) (<= (+ main_~i~0 2) main_~len~0) (<= 0 (* 2 main_~j~0)) (<= .cse0 main_~bufsize~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (* 2 main_~limit~0) 4294967286) (<= 0 (* 2 main_~i~0)) (<= main_~bufsize~0 .cse0))) [2018-10-21 12:36:35,800 INFO L421 ceAbstractionStarter]: At program point L44(line 44) the Hoare annotation is: (let ((.cse7 (+ main_~limit~0 4))) (let ((.cse0 (<= .cse7 main_~bufsize~0)) (.cse3 (<= 0 (* 2 main_~j~0))) (.cse4 (<= main_~bufsize~0 .cse7)) (.cse5 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse6 (<= (* 2 main_~limit~0) 4294967286))) (or (let ((.cse1 (+ main_~i~0 main_~len~0)) (.cse2 (+ main_~i~0 1))) (and .cse0 (<= 1 .cse1) (<= .cse1 4294967293) (<= main_~len~0 .cse2) (<= .cse2 main_~len~0) .cse3 .cse4 .cse5 .cse6)) (and .cse0 (<= (* 2 main_~len~0) 4294967294) (<= 0 (* 2 main_~i~0)) (<= (+ main_~i~0 2) main_~len~0) .cse3 .cse4 .cse5 .cse6)))) [2018-10-21 12:36:35,800 INFO L421 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (let ((.cse0 (+ main_~limit~0 4))) (and (<= (* 2 main_~len~0) 4294967294) (<= (+ main_~i~0 1) main_~len~0) (<= 2 (* 2 main_~i~0)) (<= (+ main_~j~0 4) main_~bufsize~0) (<= .cse0 main_~bufsize~0) (<= (* 2 main_~limit~0) 4294967286) (<= 2 (* 2 main_~j~0)) (<= main_~bufsize~0 .cse0))) [2018-10-21 12:36:35,801 INFO L421 ceAbstractionStarter]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse0 (+ main_~limit~0 4))) (and (<= (* 2 main_~len~0) 4294967294) (<= (+ main_~i~0 1) main_~len~0) (<= 2 (* 2 main_~i~0)) (<= (+ main_~j~0 4) main_~bufsize~0) (<= .cse0 main_~bufsize~0) (<= (* 2 main_~limit~0) 4294967286) (<= 2 (* 2 main_~j~0)) (<= main_~bufsize~0 .cse0))) [2018-10-21 12:36:35,801 INFO L421 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (+ main_~limit~0 4))) (and (<= (* 2 main_~len~0) 4294967294) (<= (+ main_~i~0 2) main_~len~0) (<= 0 (* 2 main_~j~0)) (<= .cse0 main_~bufsize~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (* 2 main_~limit~0) 4294967286) (<= 0 (* 2 main_~i~0)) (<= main_~bufsize~0 .cse0))) [2018-10-21 12:36:35,801 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-10-21 12:36:35,801 INFO L425 ceAbstractionStarter]: For program point L20-1(lines 20 51) no Hoare annotation was computed. [2018-10-21 12:36:35,801 INFO L421 ceAbstractionStarter]: At program point L20-3(lines 20 51) the Hoare annotation is: (let ((.cse3 (* 2 main_~limit~0)) (.cse4 (+ main_~limit~0 4))) (let ((.cse0 (<= .cse4 main_~bufsize~0)) (.cse1 (<= main_~bufsize~0 .cse4)) (.cse2 (<= .cse3 4294967286))) (or (and .cse0 (<= (* 2 main_~len~0) 4294967294) (<= 0 (* 2 main_~i~0)) (<= main_~i~0 (+ main_~limit~0 2147483647)) (<= 0 (* 2 main_~j~0)) .cse1 (<= main_~i~0 main_~len~0) .cse2 (<= main_~j~0 main_~bufsize~0)) (and (and (and (<= (+ main_~i~0 main_~len~0) 2147483647) .cse0 (<= 0 (+ main_~i~0 main_~len~0 2147483648)) .cse1) (= main_~i~0 0)) .cse2 (<= 0 (+ .cse3 8)))))) [2018-10-21 12:36:35,801 INFO L425 ceAbstractionStarter]: For program point L20-4(lines 20 51) no Hoare annotation was computed. [2018-10-21 12:36:35,802 INFO L421 ceAbstractionStarter]: At program point L45(line 45) the Hoare annotation is: (let ((.cse7 (+ main_~limit~0 4))) (let ((.cse0 (<= .cse7 main_~bufsize~0)) (.cse3 (<= 0 (* 2 main_~j~0))) (.cse4 (<= main_~bufsize~0 .cse7)) (.cse5 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse6 (<= (* 2 main_~limit~0) 4294967286))) (or (let ((.cse1 (+ main_~i~0 main_~len~0)) (.cse2 (+ main_~i~0 1))) (and .cse0 (<= 1 .cse1) (<= .cse1 4294967293) (<= main_~len~0 .cse2) (<= .cse2 main_~len~0) .cse3 .cse4 .cse5 .cse6)) (and .cse0 (<= (* 2 main_~len~0) 4294967294) (<= 0 (* 2 main_~i~0)) (<= (+ main_~i~0 2) main_~len~0) .cse3 .cse4 .cse5 .cse6)))) [2018-10-21 12:36:35,802 INFO L421 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (let ((.cse0 (+ main_~limit~0 4))) (and (<= (* 2 main_~len~0) 4294967294) (<= (+ main_~i~0 1) main_~len~0) (<= 2 (* 2 main_~i~0)) (<= (+ main_~j~0 4) main_~bufsize~0) (<= .cse0 main_~bufsize~0) (<= (* 2 main_~limit~0) 4294967286) (<= 2 (* 2 main_~j~0)) (<= main_~bufsize~0 .cse0))) [2018-10-21 12:36:35,802 INFO L425 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-10-21 12:36:35,802 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-10-21 12:36:35,802 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 21 50) no Hoare annotation was computed. [2018-10-21 12:36:35,802 INFO L421 ceAbstractionStarter]: At program point L21-3(lines 21 50) the Hoare annotation is: (let ((.cse0 (+ main_~limit~0 4))) (and (<= (* 2 main_~len~0) 4294967294) (<= main_~i~0 main_~len~0) (<= 0 (* 2 main_~j~0)) (<= .cse0 main_~bufsize~0) (<= (* 2 main_~limit~0) 4294967286) (<= 0 (* 2 main_~i~0)) (<= main_~j~0 main_~bufsize~0) (<= 1 (+ main_~i~0 main_~len~0)) (<= main_~i~0 (+ main_~limit~0 2147483647)) (<= main_~bufsize~0 .cse0))) [2018-10-21 12:36:35,802 INFO L425 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-10-21 12:36:35,802 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-10-21 12:36:35,802 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 53) no Hoare annotation was computed. [2018-10-21 12:36:35,803 INFO L421 ceAbstractionStarter]: At program point L42(lines 22 49) the Hoare annotation is: (let ((.cse7 (+ main_~limit~0 4))) (let ((.cse0 (<= .cse7 main_~bufsize~0)) (.cse3 (<= 0 (* 2 main_~j~0))) (.cse4 (<= main_~bufsize~0 .cse7)) (.cse5 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse6 (<= (* 2 main_~limit~0) 4294967286))) (or (let ((.cse1 (+ main_~i~0 main_~len~0)) (.cse2 (+ main_~i~0 1))) (and .cse0 (<= 1 .cse1) (<= .cse1 4294967293) (<= main_~len~0 .cse2) (<= .cse2 main_~len~0) .cse3 .cse4 .cse5 .cse6)) (and .cse0 (<= (* 2 main_~len~0) 4294967294) (<= 0 (* 2 main_~i~0)) (<= (+ main_~i~0 2) main_~len~0) .cse3 .cse4 .cse5 .cse6)))) [2018-10-21 12:36:35,803 INFO L421 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (let ((.cse0 (+ main_~limit~0 4))) (and (<= (* 2 main_~len~0) 4294967294) (<= 4 (* 2 main_~j~0)) (<= main_~i~0 main_~len~0) (<= .cse0 main_~bufsize~0) (<= (* 2 main_~limit~0) 4294967286) (<= 4 (* 2 main_~i~0)) (<= main_~j~0 (+ main_~limit~0 1)) (<= main_~bufsize~0 .cse0))) [2018-10-21 12:36:35,803 INFO L421 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (let ((.cse0 (+ main_~limit~0 4))) (and (<= (* 2 main_~len~0) 4294967294) (<= 4 (* 2 main_~j~0)) (<= main_~i~0 main_~len~0) (<= .cse0 main_~bufsize~0) (<= (* 2 main_~limit~0) 4294967286) (<= 4 (* 2 main_~i~0)) (<= main_~j~0 (+ main_~limit~0 1)) (<= main_~bufsize~0 .cse0))) [2018-10-21 12:36:35,803 INFO L421 ceAbstractionStarter]: At program point L34(line 34) the Hoare annotation is: (let ((.cse0 (+ main_~limit~0 4))) (and (<= (* 2 main_~len~0) 4294967294) (<= (+ main_~i~0 1) main_~len~0) (<= 2 (* 2 main_~i~0)) (<= (+ main_~j~0 4) main_~bufsize~0) (<= .cse0 main_~bufsize~0) (<= (* 2 main_~limit~0) 4294967286) (<= 2 (* 2 main_~j~0)) (<= main_~bufsize~0 .cse0))) [2018-10-21 12:36:35,803 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 53) the Hoare annotation is: true [2018-10-21 12:36:35,804 INFO L421 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (let ((.cse0 (+ main_~limit~0 4))) (and (<= (* 2 main_~len~0) 4294967294) (<= (+ main_~i~0 2) main_~len~0) (<= 0 (* 2 main_~j~0)) (<= .cse0 main_~bufsize~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (* 2 main_~limit~0) 4294967286) (<= 0 (* 2 main_~i~0)) (<= main_~bufsize~0 .cse0))) [2018-10-21 12:36:35,804 INFO L421 ceAbstractionStarter]: At program point L26-1(line 26) the Hoare annotation is: (let ((.cse0 (+ main_~limit~0 4))) (and (<= (* 2 main_~len~0) 4294967294) (<= (+ main_~i~0 2) main_~len~0) (<= 0 (* 2 main_~j~0)) (<= .cse0 main_~bufsize~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (* 2 main_~limit~0) 4294967286) (<= 0 (* 2 main_~i~0)) (<= main_~bufsize~0 .cse0))) [2018-10-21 12:36:35,804 INFO L425 ceAbstractionStarter]: For program point L22(lines 22 49) no Hoare annotation was computed. [2018-10-21 12:36:35,804 INFO L421 ceAbstractionStarter]: At program point L43(line 43) the Hoare annotation is: (let ((.cse7 (+ main_~limit~0 4))) (let ((.cse0 (<= .cse7 main_~bufsize~0)) (.cse3 (<= 0 (* 2 main_~j~0))) (.cse4 (<= main_~bufsize~0 .cse7)) (.cse5 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse6 (<= (* 2 main_~limit~0) 4294967286))) (or (let ((.cse1 (+ main_~i~0 main_~len~0)) (.cse2 (+ main_~i~0 1))) (and .cse0 (<= 1 .cse1) (<= .cse1 4294967293) (<= main_~len~0 .cse2) (<= .cse2 main_~len~0) .cse3 .cse4 .cse5 .cse6)) (and .cse0 (<= (* 2 main_~len~0) 4294967294) (<= 0 (* 2 main_~i~0)) (<= (+ main_~i~0 2) main_~len~0) .cse3 .cse4 .cse5 .cse6)))) [2018-10-21 12:36:35,804 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-10-21 12:36:35,804 INFO L425 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2018-10-21 12:36:35,804 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-10-21 12:36:35,805 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-10-21 12:36:35,805 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-10-21 12:36:35,805 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-10-21 12:36:35,805 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-10-21 12:36:35,805 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-10-21 12:36:35,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 12:36:35 BoogieIcfgContainer [2018-10-21 12:36:35,820 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-21 12:36:35,820 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-21 12:36:35,820 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-21 12:36:35,821 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-21 12:36:35,821 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 12:35:13" (3/4) ... [2018-10-21 12:36:35,825 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-21 12:36:35,831 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-21 12:36:35,832 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-21 12:36:35,832 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-10-21 12:36:35,837 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2018-10-21 12:36:35,837 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-10-21 12:36:35,838 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-21 12:36:35,902 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/witness.graphml [2018-10-21 12:36:35,902 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-21 12:36:35,904 INFO L168 Benchmark]: Toolchain (without parser) took 83222.37 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 909.1 MB). Free memory was 951.9 MB in the beginning and 1.4 GB in the end (delta: -456.4 MB). Peak memory consumption was 452.7 MB. Max. memory is 11.5 GB. [2018-10-21 12:36:35,905 INFO L168 Benchmark]: CDTParser took 0.17 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:36:35,905 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.13 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 941.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-21 12:36:35,906 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.42 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:36:35,907 INFO L168 Benchmark]: Boogie Preprocessor took 22.08 ms. Allocated memory is still 1.0 GB. Free memory was 941.1 MB in the beginning and 935.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-21 12:36:35,907 INFO L168 Benchmark]: RCFGBuilder took 576.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -161.4 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2018-10-21 12:36:35,909 INFO L168 Benchmark]: TraceAbstraction took 82218.37 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 787.0 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -311.1 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-10-21 12:36:35,910 INFO L168 Benchmark]: Witness Printer took 81.72 ms. Allocated memory is still 1.9 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-21 12:36:35,915 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.17 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 298.13 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 941.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.42 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 22.08 ms. Allocated memory is still 1.0 GB. Free memory was 941.1 MB in the beginning and 935.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 576.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -161.4 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 82218.37 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 787.0 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -311.1 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 81.72 ms. Allocated memory is still 1.9 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 20]: Loop Invariant Derived loop invariant: ((((((((limit + 4 <= bufsize && 2 * len <= 4294967294) && 0 <= 2 * i) && i <= limit + 2147483647) && 0 <= 2 * j) && bufsize <= limit + 4) && i <= len) && 2 * limit <= 4294967286) && j <= bufsize) || ((((((i + len <= 2147483647 && limit + 4 <= bufsize) && 0 <= i + len + 2147483648) && bufsize <= limit + 4) && i == 0) && 2 * limit <= 4294967286) && 0 <= 2 * limit + 8) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: ((((((((2 * len <= 4294967294 && i <= len) && 0 <= 2 * j) && limit + 4 <= bufsize) && 2 * limit <= 4294967286) && 0 <= 2 * i) && j <= bufsize) && 1 <= i + len) && i <= limit + 2147483647) && bufsize <= limit + 4 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((((((((limit + 4 <= bufsize && 1 <= i + len) && i + len <= 4294967293) && len <= i + 1) && i + 1 <= len) && 0 <= 2 * j) && bufsize <= limit + 4) && j + 5 <= bufsize) && 2 * limit <= 4294967286) || (((((((limit + 4 <= bufsize && 2 * len <= 4294967294) && 0 <= 2 * i) && i + 2 <= len) && 0 <= 2 * j) && bufsize <= limit + 4) && j + 5 <= bufsize) && 2 * limit <= 4294967286) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 44 locations, 1 error locations. SAFE Result, 82.1s OverallTime, 15 OverallIterations, 14 TraceHistogramMax, 50.1s AutomataDifference, 0.0s DeadEndRemovalTime, 18.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 1034 SDtfs, 890 SDslu, 4407 SDs, 0 SdLazy, 2312 SolverSat, 1976 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 26 DeclaredPredicates, 929 GetRequests, 689 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=460occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.2s AbstIntTime, 13 AbstIntIterations, 13 AbstIntStrong, 0.9003762782818469 AbsIntWeakeningRatio, 0.4794188861985472 AbsIntAvgWeakeningVarsNumRemoved, 6.825665859564165 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 307 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 539 PreInvPairs, 923 NumberOfFragments, 974 HoareAnnotationTreeSize, 539 FomulaSimplifications, 4280871 FormulaSimplificationTreeSizeReduction, 7.9s HoareSimplificationTime, 23 FomulaSimplificationsInter, 276368 FormulaSimplificationTreeSizeReductionInter, 10.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 869 NumberOfCodeBlocks, 869 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 854 ConstructedInterpolants, 0 QuantifiedInterpolants, 114680 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 2 PerfectInterpolantSequences, 2067/2389 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...