./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/termination-crafted/MutualRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_60dbd862-dc71-42c0-9653-e236f59e3ed6/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_60dbd862-dc71-42c0-9653-e236f59e3ed6/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_60dbd862-dc71-42c0-9653-e236f59e3ed6/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_60dbd862-dc71-42c0-9653-e236f59e3ed6/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted/MutualRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_60dbd862-dc71-42c0-9653-e236f59e3ed6/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_60dbd862-dc71-42c0-9653-e236f59e3ed6/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9072a9376e1e28de1ef4dc11b7134f6f175023b7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 07:02:04,230 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:02:04,231 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:02:04,239 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:02:04,239 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:02:04,240 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:02:04,241 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:02:04,242 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:02:04,244 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:02:04,244 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:02:04,245 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:02:04,245 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:02:04,246 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:02:04,247 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:02:04,247 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:02:04,248 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:02:04,249 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:02:04,250 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:02:04,252 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:02:04,253 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:02:04,254 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:02:04,255 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:02:04,257 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:02:04,257 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:02:04,257 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:02:04,258 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:02:04,259 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:02:04,259 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:02:04,260 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:02:04,261 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:02:04,261 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:02:04,261 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:02:04,262 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:02:04,262 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:02:04,262 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:02:04,263 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:02:04,263 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_60dbd862-dc71-42c0-9653-e236f59e3ed6/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-11-10 07:02:04,274 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:02:04,274 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:02:04,275 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:02:04,275 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 07:02:04,275 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 07:02:04,275 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 07:02:04,275 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 07:02:04,275 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 07:02:04,276 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 07:02:04,276 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 07:02:04,276 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 07:02:04,276 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:02:04,277 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 07:02:04,277 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:02:04,277 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:02:04,277 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:02:04,277 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:02:04,277 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:02:04,277 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-10 07:02:04,278 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:02:04,278 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:02:04,278 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:02:04,278 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:02:04,278 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:02:04,278 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 07:02:04,278 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 07:02:04,279 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:02:04,279 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:02:04,279 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:02:04,279 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 07:02:04,279 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:02:04,279 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 07:02:04,279 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 07:02:04,280 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_60dbd862-dc71-42c0-9653-e236f59e3ed6/bin-2019/utaipan 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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9072a9376e1e28de1ef4dc11b7134f6f175023b7 [2018-11-10 07:02:04,300 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:02:04,308 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:02:04,310 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:02:04,311 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:02:04,311 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:02:04,312 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_60dbd862-dc71-42c0-9653-e236f59e3ed6/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted/MutualRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 07:02:04,357 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_60dbd862-dc71-42c0-9653-e236f59e3ed6/bin-2019/utaipan/data/1f0f5c578/0988b0a690624a93871d234d3e4aa7ac/FLAGa2c73ba87 [2018-11-10 07:02:04,660 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:02:04,660 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_60dbd862-dc71-42c0-9653-e236f59e3ed6/sv-benchmarks/c/termination-crafted/MutualRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 07:02:04,665 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_60dbd862-dc71-42c0-9653-e236f59e3ed6/bin-2019/utaipan/data/1f0f5c578/0988b0a690624a93871d234d3e4aa7ac/FLAGa2c73ba87 [2018-11-10 07:02:04,676 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_60dbd862-dc71-42c0-9653-e236f59e3ed6/bin-2019/utaipan/data/1f0f5c578/0988b0a690624a93871d234d3e4aa7ac [2018-11-10 07:02:04,678 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:02:04,679 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:02:04,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:02:04,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:02:04,683 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:02:04,684 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:02:04" (1/1) ... [2018-11-10 07:02:04,686 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@177ef697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:02:04, skipping insertion in model container [2018-11-10 07:02:04,686 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:02:04" (1/1) ... [2018-11-10 07:02:04,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:02:04,706 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:02:04,798 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:02:04,801 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:02:04,810 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:02:04,817 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:02:04,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:02:04 WrapperNode [2018-11-10 07:02:04,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:02:04,818 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:02:04,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:02:04,818 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:02:04,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:02:04" (1/1) ... [2018-11-10 07:02:04,828 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:02:04" (1/1) ... [2018-11-10 07:02:04,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:02:04,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:02:04,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:02:04,831 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:02:04,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:02:04" (1/1) ... [2018-11-10 07:02:04,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:02:04" (1/1) ... [2018-11-10 07:02:04,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:02:04" (1/1) ... [2018-11-10 07:02:04,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:02:04" (1/1) ... [2018-11-10 07:02:04,839 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:02:04" (1/1) ... [2018-11-10 07:02:04,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:02:04" (1/1) ... [2018-11-10 07:02:04,841 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:02:04" (1/1) ... [2018-11-10 07:02:04,842 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:02:04,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:02:04,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:02:04,843 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:02:04,844 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:02:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_60dbd862-dc71-42c0-9653-e236f59e3ed6/bin-2019/utaipan/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-11-10 07:02:04,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 07:02:04,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 07:02:04,934 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-10 07:02:04,934 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-10 07:02:04,935 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-11-10 07:02:04,935 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-11-10 07:02:04,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:02:04,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:02:04,935 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 07:02:04,935 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 07:02:05,064 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:02:05,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:02:05 BoogieIcfgContainer [2018-11-10 07:02:05,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:02:05,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 07:02:05,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 07:02:05,067 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 07:02:05,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:02:04" (1/3) ... [2018-11-10 07:02:05,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5098ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:02:05, skipping insertion in model container [2018-11-10 07:02:05,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:02:04" (2/3) ... [2018-11-10 07:02:05,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5098ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:02:05, skipping insertion in model container [2018-11-10 07:02:05,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:02:05" (3/3) ... [2018-11-10 07:02:05,071 INFO L112 eAbstractionObserver]: Analyzing ICFG MutualRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 07:02:05,079 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 07:02:05,086 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-11-10 07:02:05,099 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-11-10 07:02:05,125 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 07:02:05,125 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 07:02:05,125 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 07:02:05,126 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:02:05,126 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:02:05,126 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 07:02:05,126 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:02:05,126 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 07:02:05,142 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-11-10 07:02:05,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 07:02:05,146 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:02:05,147 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:02:05,149 INFO L424 AbstractCegarLoop]: === Iteration 1 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:02:05,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:02:05,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1878681222, now seen corresponding path program 1 times [2018-11-10 07:02:05,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:02:05,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:02:05,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:02:05,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:02:05,197 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:02:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:02:05,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:02:05,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:02:05,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 07:02:05,288 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:02:05,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:02:05,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:02:05,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:02:05,306 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 5 states. [2018-11-10 07:02:05,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:02:05,385 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2018-11-10 07:02:05,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 07:02:05,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-10 07:02:05,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:02:05,394 INFO L225 Difference]: With dead ends: 69 [2018-11-10 07:02:05,394 INFO L226 Difference]: Without dead ends: 60 [2018-11-10 07:02:05,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-11-10 07:02:05,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-10 07:02:05,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2018-11-10 07:02:05,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-10 07:02:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-11-10 07:02:05,432 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 9 [2018-11-10 07:02:05,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:02:05,432 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-11-10 07:02:05,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:02:05,432 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-11-10 07:02:05,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 07:02:05,433 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:02:05,433 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:02:05,433 INFO L424 AbstractCegarLoop]: === Iteration 2 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:02:05,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:02:05,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1890424319, now seen corresponding path program 1 times [2018-11-10 07:02:05,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:02:05,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:02:05,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:02:05,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:02:05,435 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:02:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:02:05,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:02:05,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:02:05,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:02:05,457 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:02:05,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:02:05,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:02:05,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:02:05,459 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 3 states. [2018-11-10 07:02:05,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:02:05,479 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-10 07:02:05,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:02:05,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-10 07:02:05,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:02:05,482 INFO L225 Difference]: With dead ends: 56 [2018-11-10 07:02:05,482 INFO L226 Difference]: Without dead ends: 54 [2018-11-10 07:02:05,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:02:05,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-10 07:02:05,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-10 07:02:05,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-10 07:02:05,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-11-10 07:02:05,489 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 10 [2018-11-10 07:02:05,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:02:05,489 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-11-10 07:02:05,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:02:05,489 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-11-10 07:02:05,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 07:02:05,490 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:02:05,491 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:02:05,491 INFO L424 AbstractCegarLoop]: === Iteration 3 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:02:05,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:02:05,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1814880932, now seen corresponding path program 1 times [2018-11-10 07:02:05,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:02:05,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:02:05,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:02:05,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:02:05,492 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:02:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:02:05,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:02:05,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:02:05,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 07:02:05,560 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:02:05,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 07:02:05,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 07:02:05,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 07:02:05,561 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 7 states. [2018-11-10 07:02:05,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:02:05,665 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-11-10 07:02:05,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 07:02:05,666 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-11-10 07:02:05,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:02:05,667 INFO L225 Difference]: With dead ends: 71 [2018-11-10 07:02:05,667 INFO L226 Difference]: Without dead ends: 69 [2018-11-10 07:02:05,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-10 07:02:05,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-10 07:02:05,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-11-10 07:02:05,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-10 07:02:05,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2018-11-10 07:02:05,676 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 17 [2018-11-10 07:02:05,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:02:05,676 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2018-11-10 07:02:05,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 07:02:05,677 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2018-11-10 07:02:05,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 07:02:05,678 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:02:05,678 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-11-10 07:02:05,678 INFO L424 AbstractCegarLoop]: === Iteration 4 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:02:05,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:02:05,679 INFO L82 PathProgramCache]: Analyzing trace with hash -2069922715, now seen corresponding path program 1 times [2018-11-10 07:02:05,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:02:05,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:02:05,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:02:05,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:02:05,680 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:02:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:02:05,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 07:02:05,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:02:05,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 07:02:05,712 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:02:05,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:02:05,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:02:05,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:02:05,713 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand 5 states. [2018-11-10 07:02:05,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:02:05,753 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2018-11-10 07:02:05,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:02:05,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-10 07:02:05,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:02:05,754 INFO L225 Difference]: With dead ends: 81 [2018-11-10 07:02:05,754 INFO L226 Difference]: Without dead ends: 80 [2018-11-10 07:02:05,754 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-11-10 07:02:05,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-10 07:02:05,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2018-11-10 07:02:05,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-10 07:02:05,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2018-11-10 07:02:05,763 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 20 [2018-11-10 07:02:05,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:02:05,763 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2018-11-10 07:02:05,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:02:05,763 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2018-11-10 07:02:05,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 07:02:05,764 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:02:05,764 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:02:05,764 INFO L424 AbstractCegarLoop]: === Iteration 5 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:02:05,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:02:05,765 INFO L82 PathProgramCache]: Analyzing trace with hash 256905316, now seen corresponding path program 1 times [2018-11-10 07:02:05,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:02:05,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:02:05,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:02:05,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:02:05,766 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:02:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:02:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:02:05,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:02:05,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:02:05,782 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:02:05,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:02:05,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:02:05,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:02:05,783 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 3 states. [2018-11-10 07:02:05,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:02:05,805 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2018-11-10 07:02:05,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:02:05,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-10 07:02:05,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:02:05,807 INFO L225 Difference]: With dead ends: 71 [2018-11-10 07:02:05,807 INFO L226 Difference]: Without dead ends: 70 [2018-11-10 07:02:05,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:02:05,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-10 07:02:05,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-11-10 07:02:05,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-10 07:02:05,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2018-11-10 07:02:05,816 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 21 [2018-11-10 07:02:05,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:02:05,817 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2018-11-10 07:02:05,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:02:05,817 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2018-11-10 07:02:05,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 07:02:05,818 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:02:05,818 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:02:05,819 INFO L424 AbstractCegarLoop]: === Iteration 6 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:02:05,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:02:05,819 INFO L82 PathProgramCache]: Analyzing trace with hash -831628633, now seen corresponding path program 1 times [2018-11-10 07:02:05,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:02:05,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:02:05,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:02:05,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:02:05,820 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:02:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:02:05,852 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 07:02:05,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:02:05,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:02:05,853 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:02:05,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:02:05,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:02:05,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:02:05,854 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand 5 states. [2018-11-10 07:02:05,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:02:05,907 INFO L93 Difference]: Finished difference Result 127 states and 161 transitions. [2018-11-10 07:02:05,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:02:05,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-10 07:02:05,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:02:05,908 INFO L225 Difference]: With dead ends: 127 [2018-11-10 07:02:05,908 INFO L226 Difference]: Without dead ends: 66 [2018-11-10 07:02:05,909 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-11-10 07:02:05,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-10 07:02:05,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-11-10 07:02:05,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-10 07:02:05,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2018-11-10 07:02:05,916 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 25 [2018-11-10 07:02:05,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:02:05,916 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2018-11-10 07:02:05,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:02:05,916 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-11-10 07:02:05,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 07:02:05,917 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:02:05,917 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:02:05,918 INFO L424 AbstractCegarLoop]: === Iteration 7 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:02:05,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:02:05,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1630439354, now seen corresponding path program 1 times [2018-11-10 07:02:05,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:02:05,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:02:05,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:02:05,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:02:05,919 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:02:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:02:05,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:02:05,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:02:05,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 07:02:05,956 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:02:05,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:02:05,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:02:05,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:02:05,957 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 5 states. [2018-11-10 07:02:05,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:02:05,992 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2018-11-10 07:02:05,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:02:05,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-10 07:02:05,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:02:05,994 INFO L225 Difference]: With dead ends: 76 [2018-11-10 07:02:05,994 INFO L226 Difference]: Without dead ends: 75 [2018-11-10 07:02:05,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-11-10 07:02:05,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-10 07:02:06,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-11-10 07:02:06,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-10 07:02:06,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2018-11-10 07:02:06,001 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 25 [2018-11-10 07:02:06,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:02:06,001 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2018-11-10 07:02:06,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:02:06,001 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2018-11-10 07:02:06,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 07:02:06,002 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:02:06,002 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:02:06,002 INFO L424 AbstractCegarLoop]: === Iteration 8 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:02:06,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:02:06,003 INFO L82 PathProgramCache]: Analyzing trace with hash -995987509, now seen corresponding path program 1 times [2018-11-10 07:02:06,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:02:06,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:02:06,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:02:06,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:02:06,004 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:02:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:02:06,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:02:06,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:02:06,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 07:02:06,034 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:02:06,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:02:06,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:02:06,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:02:06,035 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand 5 states. [2018-11-10 07:02:06,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:02:06,075 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2018-11-10 07:02:06,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:02:06,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-10 07:02:06,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:02:06,076 INFO L225 Difference]: With dead ends: 79 [2018-11-10 07:02:06,076 INFO L226 Difference]: Without dead ends: 75 [2018-11-10 07:02:06,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-11-10 07:02:06,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-10 07:02:06,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-11-10 07:02:06,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-10 07:02:06,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2018-11-10 07:02:06,084 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 26 [2018-11-10 07:02:06,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:02:06,085 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2018-11-10 07:02:06,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:02:06,085 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2018-11-10 07:02:06,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 07:02:06,086 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:02:06,086 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 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] [2018-11-10 07:02:06,086 INFO L424 AbstractCegarLoop]: === Iteration 9 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:02:06,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:02:06,087 INFO L82 PathProgramCache]: Analyzing trace with hash -23503209, now seen corresponding path program 1 times [2018-11-10 07:02:06,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:02:06,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:02:06,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:02:06,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:02:06,088 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:02:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:02:06,120 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 07:02:06,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:02:06,120 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:02:06,121 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-11-10 07:02:06,122 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [8], [18], [19], [23], [25], [27], [29], [31], [33], [35], [37], [39], [40], [44], [48], [49], [52], [53], [54], [55], [56], [57], [58], [60] [2018-11-10 07:02:06,157 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 07:02:06,157 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 07:02:06,339 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 07:02:06,340 INFO L272 AbstractInterpreter]: Visited 29 different actions 163 times. Never merged. Never widened. Found 7 fixpoints after 3 different actions. Largest state had 5 variables. [2018-11-10 07:02:06,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:02:06,347 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 07:02:06,436 INFO L227 lantSequenceWeakener]: Weakened 34 states. On average, predicates are now at 50.98% of their original sizes. [2018-11-10 07:02:06,437 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 07:02:06,712 INFO L415 sIntCurrentIteration]: We unified 45 AI predicates to 45 [2018-11-10 07:02:06,712 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 07:02:06,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:02:06,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [4] total 26 [2018-11-10 07:02:06,713 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:02:06,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-10 07:02:06,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-10 07:02:06,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2018-11-10 07:02:06,714 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand 24 states. [2018-11-10 07:02:09,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:02:09,032 INFO L93 Difference]: Finished difference Result 242 states and 297 transitions. [2018-11-10 07:02:09,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-10 07:02:09,032 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-11-10 07:02:09,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:02:09,033 INFO L225 Difference]: With dead ends: 242 [2018-11-10 07:02:09,033 INFO L226 Difference]: Without dead ends: 240 [2018-11-10 07:02:09,034 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 68 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=297, Invalid=1865, Unknown=0, NotChecked=0, Total=2162 [2018-11-10 07:02:09,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-11-10 07:02:09,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 142. [2018-11-10 07:02:09,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-10 07:02:09,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 171 transitions. [2018-11-10 07:02:09,051 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 171 transitions. Word has length 46 [2018-11-10 07:02:09,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:02:09,051 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 171 transitions. [2018-11-10 07:02:09,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-10 07:02:09,051 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 171 transitions. [2018-11-10 07:02:09,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 07:02:09,055 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:02:09,055 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:02:09,057 INFO L424 AbstractCegarLoop]: === Iteration 10 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:02:09,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:02:09,057 INFO L82 PathProgramCache]: Analyzing trace with hash 187335224, now seen corresponding path program 1 times [2018-11-10 07:02:09,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:02:09,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:02:09,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:02:09,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:02:09,059 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:02:09,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:02:09,136 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-10 07:02:09,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:02:09,136 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:02:09,137 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 73 with the following transitions: [2018-11-10 07:02:09,137 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [9], [11], [13], [14], [18], [19], [23], [25], [27], [29], [31], [33], [35], [37], [39], [40], [44], [48], [49], [50], [51], [52], [53], [54], [55], [56], [57], [58], [60] [2018-11-10 07:02:09,138 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 07:02:09,139 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 07:02:09,482 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 07:02:09,482 INFO L272 AbstractInterpreter]: Visited 34 different actions 2152 times. Never merged. Widened at 4 different actions 118 times. Found 125 fixpoints after 4 different actions. Largest state had 5 variables. [2018-11-10 07:02:09,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:02:09,484 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 07:02:09,504 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 50% of their original sizes. [2018-11-10 07:02:09,504 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 07:02:09,599 INFO L415 sIntCurrentIteration]: We unified 71 AI predicates to 71 [2018-11-10 07:02:09,599 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 07:02:09,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:02:09,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [7] total 22 [2018-11-10 07:02:09,599 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:02:09,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 07:02:09,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 07:02:09,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-11-10 07:02:09,600 INFO L87 Difference]: Start difference. First operand 142 states and 171 transitions. Second operand 16 states. [2018-11-10 07:02:09,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:02:09,867 INFO L93 Difference]: Finished difference Result 337 states and 408 transitions. [2018-11-10 07:02:09,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 07:02:09,867 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2018-11-10 07:02:09,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:02:09,869 INFO L225 Difference]: With dead ends: 337 [2018-11-10 07:02:09,869 INFO L226 Difference]: Without dead ends: 200 [2018-11-10 07:02:09,870 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 79 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2018-11-10 07:02:09,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-10 07:02:09,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 192. [2018-11-10 07:02:09,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-11-10 07:02:09,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 232 transitions. [2018-11-10 07:02:09,886 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 232 transitions. Word has length 72 [2018-11-10 07:02:09,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:02:09,886 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 232 transitions. [2018-11-10 07:02:09,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 07:02:09,887 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 232 transitions. [2018-11-10 07:02:09,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-10 07:02:09,888 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:02:09,888 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 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] [2018-11-10 07:02:09,889 INFO L424 AbstractCegarLoop]: === Iteration 11 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:02:09,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:02:09,889 INFO L82 PathProgramCache]: Analyzing trace with hash 859454554, now seen corresponding path program 2 times [2018-11-10 07:02:09,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:02:09,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:02:09,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:02:09,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:02:09,890 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:02:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:02:09,943 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 07:02:09,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:02:09,943 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:02:09,943 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 07:02:09,944 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 07:02:09,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:02:09,944 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_60dbd862-dc71-42c0-9653-e236f59e3ed6/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:02:09,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 07:02:09,952 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 07:02:09,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 07:02:09,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:02:09,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:02:10,042 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 07:02:10,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 07:02:10,134 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 07:02:10,160 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:02:10,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [7] total 10 [2018-11-10 07:02:10,160 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:02:10,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 07:02:10,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 07:02:10,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-10 07:02:10,161 INFO L87 Difference]: Start difference. First operand 192 states and 232 transitions. Second operand 8 states. [2018-11-10 07:02:10,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:02:10,205 INFO L93 Difference]: Finished difference Result 291 states and 366 transitions. [2018-11-10 07:02:10,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 07:02:10,206 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2018-11-10 07:02:10,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:02:10,207 INFO L225 Difference]: With dead ends: 291 [2018-11-10 07:02:10,208 INFO L226 Difference]: Without dead ends: 290 [2018-11-10 07:02:10,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 120 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-10 07:02:10,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-11-10 07:02:10,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 235. [2018-11-10 07:02:10,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-11-10 07:02:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 286 transitions. [2018-11-10 07:02:10,222 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 286 transitions. Word has length 64 [2018-11-10 07:02:10,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:02:10,222 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 286 transitions. [2018-11-10 07:02:10,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 07:02:10,222 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 286 transitions. [2018-11-10 07:02:10,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 07:02:10,223 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:02:10,224 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:02:10,224 INFO L424 AbstractCegarLoop]: === Iteration 12 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:02:10,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:02:10,224 INFO L82 PathProgramCache]: Analyzing trace with hash 873287445, now seen corresponding path program 1 times [2018-11-10 07:02:10,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:02:10,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:02:10,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:02:10,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:02:10,225 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:02:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:02:10,278 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 07:02:10,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:02:10,278 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:02:10,278 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-11-10 07:02:10,278 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [9], [11], [13], [15], [16], [18], [19], [23], [25], [27], [29], [31], [33], [35], [37], [39], [40], [44], [48], [49], [50], [51], [52], [53], [54], [55], [56], [57], [58], [60] [2018-11-10 07:02:10,280 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 07:02:10,280 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 07:02:10,524 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 07:02:10,524 INFO L272 AbstractInterpreter]: Visited 35 different actions 2164 times. Never merged. Widened at 4 different actions 118 times. Found 125 fixpoints after 4 different actions. Largest state had 5 variables. [2018-11-10 07:02:10,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:02:10,533 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 07:02:10,565 INFO L227 lantSequenceWeakener]: Weakened 51 states. On average, predicates are now at 48.69% of their original sizes. [2018-11-10 07:02:10,565 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 07:02:10,871 INFO L415 sIntCurrentIteration]: We unified 64 AI predicates to 64 [2018-11-10 07:02:10,871 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 07:02:10,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:02:10,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [7] total 32 [2018-11-10 07:02:10,871 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:02:10,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-10 07:02:10,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-10 07:02:10,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2018-11-10 07:02:10,872 INFO L87 Difference]: Start difference. First operand 235 states and 286 transitions. Second operand 27 states. [2018-11-10 07:02:13,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:02:13,551 INFO L93 Difference]: Finished difference Result 529 states and 646 transitions. [2018-11-10 07:02:13,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-11-10 07:02:13,551 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 65 [2018-11-10 07:02:13,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:02:13,554 INFO L225 Difference]: With dead ends: 529 [2018-11-10 07:02:13,554 INFO L226 Difference]: Without dead ends: 525 [2018-11-10 07:02:13,556 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 117 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1749 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=748, Invalid=5572, Unknown=0, NotChecked=0, Total=6320 [2018-11-10 07:02:13,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-11-10 07:02:13,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 418. [2018-11-10 07:02:13,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-11-10 07:02:13,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 485 transitions. [2018-11-10 07:02:13,578 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 485 transitions. Word has length 65 [2018-11-10 07:02:13,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:02:13,579 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 485 transitions. [2018-11-10 07:02:13,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-10 07:02:13,579 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 485 transitions. [2018-11-10 07:02:13,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-10 07:02:13,581 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:02:13,581 INFO L375 BasicCegarLoop]: trace histogram [10, 7, 7, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:02:13,582 INFO L424 AbstractCegarLoop]: === Iteration 13 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:02:13,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:02:13,582 INFO L82 PathProgramCache]: Analyzing trace with hash -657071950, now seen corresponding path program 2 times [2018-11-10 07:02:13,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:02:13,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:02:13,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:02:13,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:02:13,583 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:02:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:02:13,631 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 28 proven. 88 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-11-10 07:02:13,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:02:13,631 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:02:13,631 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 07:02:13,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 07:02:13,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:02:13,631 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_60dbd862-dc71-42c0-9653-e236f59e3ed6/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:02:13,643 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 07:02:13,643 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 07:02:13,656 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 07:02:13,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:02:13,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:02:13,746 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-11-10 07:02:13,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 07:02:13,924 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-11-10 07:02:13,940 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:02:13,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [7] total 15 [2018-11-10 07:02:13,940 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:02:13,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 07:02:13,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 07:02:13,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-11-10 07:02:13,941 INFO L87 Difference]: Start difference. First operand 418 states and 485 transitions. Second operand 8 states. [2018-11-10 07:02:13,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:02:13,989 INFO L93 Difference]: Finished difference Result 615 states and 730 transitions. [2018-11-10 07:02:13,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 07:02:13,990 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2018-11-10 07:02:13,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:02:13,992 INFO L225 Difference]: With dead ends: 615 [2018-11-10 07:02:13,992 INFO L226 Difference]: Without dead ends: 614 [2018-11-10 07:02:13,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 218 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-11-10 07:02:13,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2018-11-10 07:02:14,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 422. [2018-11-10 07:02:14,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-11-10 07:02:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 489 transitions. [2018-11-10 07:02:14,013 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 489 transitions. Word has length 115 [2018-11-10 07:02:14,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:02:14,014 INFO L481 AbstractCegarLoop]: Abstraction has 422 states and 489 transitions. [2018-11-10 07:02:14,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 07:02:14,014 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 489 transitions. [2018-11-10 07:02:14,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 07:02:14,016 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:02:14,016 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:02:14,016 INFO L424 AbstractCegarLoop]: === Iteration 14 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:02:14,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:02:14,016 INFO L82 PathProgramCache]: Analyzing trace with hash -251662983, now seen corresponding path program 1 times [2018-11-10 07:02:14,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:02:14,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:02:14,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:02:14,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:02:14,017 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:02:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:02:14,054 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-10 07:02:14,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:02:14,055 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:02:14,055 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 78 with the following transitions: [2018-11-10 07:02:14,055 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [9], [11], [13], [15], [17], [18], [19], [23], [25], [27], [29], [31], [33], [35], [36], [37], [39], [40], [44], [48], [49], [50], [51], [52], [53], [54], [55], [56], [57], [58], [60] [2018-11-10 07:02:14,057 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 07:02:14,057 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 07:02:14,394 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 07:02:14,394 INFO L272 AbstractInterpreter]: Visited 36 different actions 2245 times. Merged at 2 different actions 24 times. Widened at 4 different actions 118 times. Found 137 fixpoints after 6 different actions. Largest state had 5 variables. [2018-11-10 07:02:14,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:02:14,405 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 07:02:14,444 INFO L227 lantSequenceWeakener]: Weakened 62 states. On average, predicates are now at 50.54% of their original sizes. [2018-11-10 07:02:14,444 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 07:02:14,937 INFO L415 sIntCurrentIteration]: We unified 76 AI predicates to 76 [2018-11-10 07:02:14,937 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 07:02:14,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:02:14,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [4] total 32 [2018-11-10 07:02:14,938 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:02:14,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-10 07:02:14,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-10 07:02:14,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=778, Unknown=0, NotChecked=0, Total=870 [2018-11-10 07:02:14,939 INFO L87 Difference]: Start difference. First operand 422 states and 489 transitions. Second operand 30 states. [2018-11-10 07:02:19,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:02:19,569 INFO L93 Difference]: Finished difference Result 673 states and 788 transitions. [2018-11-10 07:02:19,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-11-10 07:02:19,569 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 77 [2018-11-10 07:02:19,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:02:19,570 INFO L225 Difference]: With dead ends: 673 [2018-11-10 07:02:19,570 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 07:02:19,573 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 135 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2209 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=933, Invalid=6723, Unknown=0, NotChecked=0, Total=7656 [2018-11-10 07:02:19,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 07:02:19,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 07:02:19,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 07:02:19,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 07:02:19,573 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2018-11-10 07:02:19,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:02:19,573 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:02:19,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-10 07:02:19,574 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:02:19,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 07:02:19,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 07:02:19,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:19,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:19,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:19,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:19,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:19,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:19,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:19,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:19,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:19,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:19,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:19,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:19,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:19,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:19,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:19,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:19,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:19,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:19,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:19,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:19,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:19,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:19,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:19,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:20,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:02:21,080 WARN L179 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 45 [2018-11-10 07:02:21,387 WARN L179 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 43 [2018-11-10 07:02:21,642 WARN L179 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 45 [2018-11-10 07:02:22,004 WARN L179 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 53 [2018-11-10 07:02:22,021 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 07:02:22,021 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:02:22,021 INFO L425 ceAbstractionStarter]: For program point fFINAL(lines 11 15) no Hoare annotation was computed. [2018-11-10 07:02:22,021 INFO L425 ceAbstractionStarter]: For program point fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 07:02:22,021 INFO L425 ceAbstractionStarter]: For program point fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 07:02:22,022 INFO L425 ceAbstractionStarter]: For program point fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 07:02:22,022 INFO L425 ceAbstractionStarter]: For program point fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 07:02:22,022 INFO L421 ceAbstractionStarter]: At program point L14(line 14) the Hoare annotation is: (let ((.cse2 (* 2 |f_#in~x|))) (let ((.cse1 (< (+ .cse2 2) 0)) (.cse0 (* 2 f_~x)) (.cse3 (<= 1 f_~x))) (and (or (<= .cse0 4294967284) .cse1 (< 4294967284 .cse2)) (or (< 4294967286 .cse2) .cse1 (<= .cse0 4294967286)) (or (< .cse2 0) (< 4294967288 .cse2) (<= .cse0 4294967288)) (or (and (<= .cse0 4294967290) .cse3) (< 4294967290 .cse2) .cse1) (or (< (+ .cse2 4) 0) (and (<= .cse0 4294967282) .cse3) (< 4294967282 .cse2))))) [2018-11-10 07:02:22,022 INFO L425 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2018-11-10 07:02:22,022 INFO L425 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-11-10 07:02:22,022 INFO L425 ceAbstractionStarter]: For program point L14-2(line 14) no Hoare annotation was computed. [2018-11-10 07:02:22,022 INFO L425 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2018-11-10 07:02:22,022 INFO L421 ceAbstractionStarter]: At program point L14-4(line 14) the Hoare annotation is: (let ((.cse7 (* 2 |f_#t~ret0|)) (.cse1 (* 2 |f_#in~x|))) (let ((.cse5 (< (+ .cse1 2) 0)) (.cse2 (<= .cse7 0)) (.cse3 (<= 0 .cse7)) (.cse4 (<= 1 f_~x)) (.cse0 (< (+ .cse1 4) 0)) (.cse6 (* 2 f_~x))) (and (or .cse0 (< 4294967288 .cse1) (and .cse2 .cse3 (<= (+ f_~x |f_#t~ret0|) 2147483644) .cse4)) (or (< 4294967286 .cse1) .cse5) (or (< 4294967290 .cse1) .cse5 (and .cse2 (<= .cse6 4294967290) .cse3 .cse4)) (or .cse0 (< 4294967282 .cse1) (<= .cse6 4294967282))))) [2018-11-10 07:02:22,022 INFO L425 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2018-11-10 07:02:22,023 INFO L425 ceAbstractionStarter]: For program point L14-6(line 14) no Hoare annotation was computed. [2018-11-10 07:02:22,023 INFO L425 ceAbstractionStarter]: For program point fEXIT(lines 11 15) no Hoare annotation was computed. [2018-11-10 07:02:22,023 INFO L425 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2018-11-10 07:02:22,023 INFO L428 ceAbstractionStarter]: At program point fENTRY(lines 11 15) the Hoare annotation is: true [2018-11-10 07:02:22,023 INFO L425 ceAbstractionStarter]: For program point gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 07:02:22,023 INFO L425 ceAbstractionStarter]: For program point gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 07:02:22,023 INFO L425 ceAbstractionStarter]: For program point gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 07:02:22,023 INFO L425 ceAbstractionStarter]: For program point gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 07:02:22,023 INFO L425 ceAbstractionStarter]: For program point gFINAL(lines 17 21) no Hoare annotation was computed. [2018-11-10 07:02:22,023 INFO L425 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-10 07:02:22,023 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 20) no Hoare annotation was computed. [2018-11-10 07:02:22,023 INFO L425 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-11-10 07:02:22,024 INFO L421 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (let ((.cse0 (* 2 |g_#in~x|))) (let ((.cse2 (< .cse0 2)) (.cse3 (< .cse0 4)) (.cse1 (* 2 g_~x))) (and (or (< 4294967288 .cse0) (<= .cse1 4294967288) .cse2) (or (< 4294967292 .cse0) .cse3 (<= .cse1 4294967292)) (or (< (+ .cse0 4294967296) 0) (and (<= |g_#in~x| g_~x) (<= .cse1 4294967294) (<= 2 .cse1)) (< 2147483647 |g_#in~x|)) (or (< 4294967286 .cse0) .cse2 (<= g_~x |g_#in~x|)) (or .cse3 (<= .cse1 4294967290) (< 4294967290 .cse0))))) [2018-11-10 07:02:22,024 INFO L425 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-11-10 07:02:22,024 INFO L425 ceAbstractionStarter]: For program point L20-4(line 20) no Hoare annotation was computed. [2018-11-10 07:02:22,024 INFO L425 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2018-11-10 07:02:22,024 INFO L421 ceAbstractionStarter]: At program point L20-6(line 20) the Hoare annotation is: (let ((.cse0 (* 2 |g_#in~x|))) (let ((.cse1 (< .cse0 2)) (.cse2 (* 2 g_~x))) (and (or (< 4294967286 .cse0) .cse1) (or (and (<= .cse2 4294967292) (= |g_#t~ret2| 0)) (< 4294967292 .cse0) (< .cse0 4)) (or (<= .cse2 4294967290) .cse1 (< 4294967290 .cse0)) (or (< 4294967288 .cse0) .cse1 (<= g_~x (+ |g_#t~ret2| 2147483644))) (or (and (<= 0 (+ |g_#t~ret2| 2147483648)) (<= |g_#in~x| g_~x) (<= .cse2 4294967294) (<= |g_#t~ret2| 2147483647) (<= 2 .cse2)) (< (+ .cse0 4294967296) 0) (< 2147483647 |g_#in~x|))))) [2018-11-10 07:02:22,024 INFO L425 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2018-11-10 07:02:22,024 INFO L425 ceAbstractionStarter]: For program point L20-8(line 20) no Hoare annotation was computed. [2018-11-10 07:02:22,025 INFO L425 ceAbstractionStarter]: For program point L20-9(line 20) no Hoare annotation was computed. [2018-11-10 07:02:22,025 INFO L425 ceAbstractionStarter]: For program point gEXIT(lines 17 21) no Hoare annotation was computed. [2018-11-10 07:02:22,025 INFO L428 ceAbstractionStarter]: At program point gENTRY(lines 17 21) the Hoare annotation is: true [2018-11-10 07:02:22,025 INFO L425 ceAbstractionStarter]: For program point gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 07:02:22,025 INFO L425 ceAbstractionStarter]: For program point gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 07:02:22,025 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:02:22,025 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 07:02:22,025 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 07:02:22,025 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 07:02:22,026 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 24 27) the Hoare annotation is: true [2018-11-10 07:02:22,026 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 24 27) no Hoare annotation was computed. [2018-11-10 07:02:22,026 INFO L421 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (let ((.cse0 (* 2 main_~x~0))) (and (<= 0 (+ .cse0 4294967296)) (<= .cse0 4294967294))) [2018-11-10 07:02:22,026 INFO L425 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-11-10 07:02:22,026 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 24 27) no Hoare annotation was computed. [2018-11-10 07:02:22,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:02:22 BoogieIcfgContainer [2018-11-10 07:02:22,028 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 07:02:22,029 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:02:22,029 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:02:22,029 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:02:22,030 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:02:05" (3/4) ... [2018-11-10 07:02:22,033 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 07:02:22,038 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 07:02:22,038 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2018-11-10 07:02:22,038 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2018-11-10 07:02:22,039 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 07:02:22,043 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-10 07:02:22,043 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 07:02:22,043 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 07:02:22,078 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_60dbd862-dc71-42c0-9653-e236f59e3ed6/bin-2019/utaipan/witness.graphml [2018-11-10 07:02:22,079 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:02:22,079 INFO L168 Benchmark]: Toolchain (without parser) took 17400.59 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 509.1 MB). Free memory was 953.8 MB in the beginning and 1.1 GB in the end (delta: -161.8 MB). Peak memory consumption was 347.3 MB. Max. memory is 11.5 GB. [2018-11-10 07:02:22,080 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:02:22,080 INFO L168 Benchmark]: CACSL2BoogieTranslator took 137.77 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:02:22,080 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.87 ms. Allocated memory is still 1.0 GB. Free memory is still 943.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:02:22,081 INFO L168 Benchmark]: Boogie Preprocessor took 11.34 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:02:22,081 INFO L168 Benchmark]: RCFGBuilder took 221.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 940.4 MB in the beginning and 1.1 GB in the end (delta: -187.7 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:02:22,081 INFO L168 Benchmark]: TraceAbstraction took 16963.49 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 366.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.6 MB). Peak memory consumption was 707.2 MB. Max. memory is 11.5 GB. [2018-11-10 07:02:22,082 INFO L168 Benchmark]: Witness Printer took 49.58 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:02:22,083 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 137.77 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 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 12.87 ms. Allocated memory is still 1.0 GB. Free memory is still 943.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.34 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 221.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 940.4 MB in the beginning and 1.1 GB in the end (delta: -187.7 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16963.49 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 366.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.6 MB). Peak memory consumption was 707.2 MB. Max. memory is 11.5 GB. * Witness Printer took 49.58 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 47 locations, 10 error locations. SAFE Result, 16.9s OverallTime, 14 OverallIterations, 10 TraceHistogramMax, 10.4s AutomataDifference, 0.0s DeadEndRemovalTime, 2.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 538 SDtfs, 1005 SDslu, 3121 SDs, 0 SdLazy, 1297 SolverSat, 550 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 809 GetRequests, 509 SyntacticMatches, 18 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4555 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=422occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.1s AbstIntTime, 4 AbstIntIterations, 4 AbstIntStrong, 0.920507812500002 AbsIntWeakeningRatio, 0.4609375 AbsIntAvgWeakeningVarsNumRemoved, 7.23828125 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 493 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 350 PreInvPairs, 453 NumberOfFragments, 435 HoareAnnotationTreeSize, 350 FomulaSimplifications, 34391 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 11 FomulaSimplificationsInter, 11059 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 771 NumberOfCodeBlocks, 689 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 932 ConstructedInterpolants, 0 QuantifiedInterpolants, 109165 SizeOfPredicates, 0 NumberOfNonLiveVariables, 195 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 18 InterpolantComputations, 12 PerfectInterpolantSequences, 1043/1210 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...