./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/termination-crafted/MutualRecursion_1a_true-no-overflow_false-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_33f2ec0a-a132-45ce-8bbd-44941a8c9fba/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_33f2ec0a-a132-45ce-8bbd-44941a8c9fba/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_33f2ec0a-a132-45ce-8bbd-44941a8c9fba/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_33f2ec0a-a132-45ce-8bbd-44941a8c9fba/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted/MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_33f2ec0a-a132-45ce-8bbd-44941a8c9fba/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_33f2ec0a-a132-45ce-8bbd-44941a8c9fba/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 c27ad91a5bec233234e07a14bfd5505e082df4cd ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 05:44:59,322 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 05:44:59,323 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 05:44:59,332 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 05:44:59,332 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 05:44:59,333 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 05:44:59,334 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 05:44:59,335 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 05:44:59,336 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 05:44:59,337 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 05:44:59,338 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 05:44:59,338 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 05:44:59,339 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 05:44:59,340 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 05:44:59,340 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 05:44:59,341 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 05:44:59,341 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 05:44:59,343 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 05:44:59,345 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 05:44:59,346 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 05:44:59,347 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 05:44:59,347 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 05:44:59,349 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 05:44:59,349 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 05:44:59,349 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 05:44:59,350 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 05:44:59,351 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 05:44:59,352 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 05:44:59,352 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 05:44:59,353 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 05:44:59,353 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 05:44:59,353 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 05:44:59,353 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 05:44:59,354 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 05:44:59,355 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 05:44:59,356 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 05:44:59,356 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_33f2ec0a-a132-45ce-8bbd-44941a8c9fba/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-10-27 05:44:59,373 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 05:44:59,374 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 05:44:59,375 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 05:44:59,375 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 05:44:59,375 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 05:44:59,375 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 05:44:59,376 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 05:44:59,376 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 05:44:59,376 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 05:44:59,376 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 05:44:59,376 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 05:44:59,377 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 05:44:59,377 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 05:44:59,377 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 05:44:59,377 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 05:44:59,377 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 05:44:59,377 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 05:44:59,377 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 05:44:59,378 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-10-27 05:44:59,378 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 05:44:59,380 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 05:44:59,380 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 05:44:59,380 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 05:44:59,381 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 05:44:59,381 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 05:44:59,381 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 05:44:59,381 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 05:44:59,381 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 05:44:59,381 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 05:44:59,381 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 05:44:59,382 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 05:44:59,382 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 05:44:59,382 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 05:44:59,382 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_33f2ec0a-a132-45ce-8bbd-44941a8c9fba/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 -> c27ad91a5bec233234e07a14bfd5505e082df4cd [2018-10-27 05:44:59,419 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 05:44:59,428 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 05:44:59,430 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 05:44:59,432 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 05:44:59,432 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 05:44:59,432 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_33f2ec0a-a132-45ce-8bbd-44941a8c9fba/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted/MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c [2018-10-27 05:44:59,474 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_33f2ec0a-a132-45ce-8bbd-44941a8c9fba/bin-2019/utaipan/data/c5ea9f289/1a2d0103a7f14811bff4b997caad14b7/FLAG641c173df [2018-10-27 05:44:59,842 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 05:44:59,842 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_33f2ec0a-a132-45ce-8bbd-44941a8c9fba/sv-benchmarks/c/termination-crafted/MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c [2018-10-27 05:44:59,848 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_33f2ec0a-a132-45ce-8bbd-44941a8c9fba/bin-2019/utaipan/data/c5ea9f289/1a2d0103a7f14811bff4b997caad14b7/FLAG641c173df [2018-10-27 05:44:59,863 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_33f2ec0a-a132-45ce-8bbd-44941a8c9fba/bin-2019/utaipan/data/c5ea9f289/1a2d0103a7f14811bff4b997caad14b7 [2018-10-27 05:44:59,866 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 05:44:59,867 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 05:44:59,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 05:44:59,868 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 05:44:59,870 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 05:44:59,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:44:59" (1/1) ... [2018-10-27 05:44:59,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17c48233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:44:59, skipping insertion in model container [2018-10-27 05:44:59,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:44:59" (1/1) ... [2018-10-27 05:44:59,879 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 05:44:59,891 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 05:45:00,000 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 05:45:00,003 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 05:45:00,014 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 05:45:00,026 INFO L193 MainTranslator]: Completed translation [2018-10-27 05:45:00,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:45:00 WrapperNode [2018-10-27 05:45:00,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 05:45:00,027 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 05:45:00,027 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 05:45:00,027 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 05:45:00,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:45:00" (1/1) ... [2018-10-27 05:45:00,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:45:00" (1/1) ... [2018-10-27 05:45:00,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 05:45:00,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 05:45:00,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 05:45:00,044 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 05:45:00,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:45:00" (1/1) ... [2018-10-27 05:45:00,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:45:00" (1/1) ... [2018-10-27 05:45:00,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:45:00" (1/1) ... [2018-10-27 05:45:00,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:45:00" (1/1) ... [2018-10-27 05:45:00,056 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:45:00" (1/1) ... [2018-10-27 05:45:00,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:45:00" (1/1) ... [2018-10-27 05:45:00,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:45:00" (1/1) ... [2018-10-27 05:45:00,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 05:45:00,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 05:45:00,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 05:45:00,060 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 05:45:00,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:45:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33f2ec0a-a132-45ce-8bbd-44941a8c9fba/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-10-27 05:45:00,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 05:45:00,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 05:45:00,199 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-10-27 05:45:00,200 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-10-27 05:45:00,200 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-10-27 05:45:00,200 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-10-27 05:45:00,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 05:45:00,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 05:45:00,200 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 05:45:00,200 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 05:45:00,549 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 05:45:00,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:45:00 BoogieIcfgContainer [2018-10-27 05:45:00,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 05:45:00,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 05:45:00,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 05:45:00,553 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 05:45:00,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 05:44:59" (1/3) ... [2018-10-27 05:45:00,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e7aefbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:45:00, skipping insertion in model container [2018-10-27 05:45:00,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:45:00" (2/3) ... [2018-10-27 05:45:00,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e7aefbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:45:00, skipping insertion in model container [2018-10-27 05:45:00,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:45:00" (3/3) ... [2018-10-27 05:45:00,556 INFO L112 eAbstractionObserver]: Analyzing ICFG MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c [2018-10-27 05:45:00,575 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 05:45:00,582 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-10-27 05:45:00,598 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-10-27 05:45:00,633 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 05:45:00,634 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 05:45:00,634 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 05:45:00,634 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 05:45:00,634 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 05:45:00,634 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 05:45:00,635 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 05:45:00,635 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 05:45:00,652 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-10-27 05:45:00,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-27 05:45:00,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:45:00,664 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:45:00,666 INFO L424 AbstractCegarLoop]: === Iteration 1 === [fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:45:00,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:00,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1878681222, now seen corresponding path program 1 times [2018-10-27 05:45:00,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:45:00,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:00,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:45:00,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:00,720 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:45:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:45:00,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:45:00,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:45:00,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:45:00,841 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:45:00,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:45:00,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:45:00,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:45:00,853 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 5 states. [2018-10-27 05:45:01,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:45:01,019 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2018-10-27 05:45:01,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 05:45:01,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-10-27 05:45:01,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:45:01,029 INFO L225 Difference]: With dead ends: 69 [2018-10-27 05:45:01,029 INFO L226 Difference]: Without dead ends: 60 [2018-10-27 05:45:01,032 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-10-27 05:45:01,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-27 05:45:01,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2018-10-27 05:45:01,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-27 05:45:01,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-10-27 05:45:01,069 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 9 [2018-10-27 05:45:01,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:45:01,069 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-10-27 05:45:01,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:45:01,070 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-10-27 05:45:01,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-27 05:45:01,070 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:45:01,070 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:45:01,071 INFO L424 AbstractCegarLoop]: === Iteration 2 === [fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:45:01,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:01,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1890424319, now seen corresponding path program 1 times [2018-10-27 05:45:01,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:45:01,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:01,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:45:01,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:01,072 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:45:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:45:01,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:45:01,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:45:01,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 05:45:01,131 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:45:01,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:45:01,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:45:01,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:45:01,133 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 3 states. [2018-10-27 05:45:01,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:45:01,184 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-10-27 05:45:01,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:45:01,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-27 05:45:01,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:45:01,186 INFO L225 Difference]: With dead ends: 56 [2018-10-27 05:45:01,186 INFO L226 Difference]: Without dead ends: 54 [2018-10-27 05:45:01,187 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-10-27 05:45:01,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-27 05:45:01,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-10-27 05:45:01,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-27 05:45:01,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-10-27 05:45:01,196 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 10 [2018-10-27 05:45:01,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:45:01,196 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-10-27 05:45:01,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:45:01,196 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-10-27 05:45:01,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-27 05:45:01,197 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:45:01,197 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:45:01,197 INFO L424 AbstractCegarLoop]: === Iteration 3 === [fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:45:01,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:01,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1814880932, now seen corresponding path program 1 times [2018-10-27 05:45:01,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:45:01,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:01,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:45:01,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:01,199 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:45:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:45:01,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:45:01,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:45:01,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 05:45:01,278 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:45:01,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 05:45:01,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 05:45:01,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-27 05:45:01,279 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 7 states. [2018-10-27 05:45:01,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:45:01,716 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-10-27 05:45:01,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 05:45:01,717 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-10-27 05:45:01,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:45:01,718 INFO L225 Difference]: With dead ends: 71 [2018-10-27 05:45:01,718 INFO L226 Difference]: Without dead ends: 69 [2018-10-27 05:45:01,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-27 05:45:01,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-27 05:45:01,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-10-27 05:45:01,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-27 05:45:01,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2018-10-27 05:45:01,727 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 17 [2018-10-27 05:45:01,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:45:01,727 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2018-10-27 05:45:01,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 05:45:01,727 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2018-10-27 05:45:01,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 05:45:01,728 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:45:01,728 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:45:01,729 INFO L424 AbstractCegarLoop]: === Iteration 4 === [fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:45:01,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:01,729 INFO L82 PathProgramCache]: Analyzing trace with hash -2069922715, now seen corresponding path program 1 times [2018-10-27 05:45:01,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:45:01,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:01,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:45:01,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:01,730 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:45:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:45:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 05:45:01,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:45:01,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:45:01,777 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:45:01,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:45:01,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:45:01,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:45:01,777 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand 5 states. [2018-10-27 05:45:01,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:45:01,856 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2018-10-27 05:45:01,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 05:45:01,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-10-27 05:45:01,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:45:01,859 INFO L225 Difference]: With dead ends: 81 [2018-10-27 05:45:01,859 INFO L226 Difference]: Without dead ends: 80 [2018-10-27 05:45:01,859 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-10-27 05:45:01,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-27 05:45:01,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2018-10-27 05:45:01,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-27 05:45:01,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2018-10-27 05:45:01,869 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 20 [2018-10-27 05:45:01,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:45:01,869 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2018-10-27 05:45:01,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:45:01,870 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2018-10-27 05:45:01,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-27 05:45:01,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:45:01,870 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-10-27 05:45:01,871 INFO L424 AbstractCegarLoop]: === Iteration 5 === [fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:45:01,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:01,871 INFO L82 PathProgramCache]: Analyzing trace with hash 256905316, now seen corresponding path program 1 times [2018-10-27 05:45:01,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:45:01,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:01,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:45:01,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:01,872 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:45:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:45:01,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 05:45:01,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:45:01,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 05:45:01,900 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:45:01,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:45:01,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:45:01,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:45:01,901 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 3 states. [2018-10-27 05:45:01,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:45:01,967 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2018-10-27 05:45:01,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:45:01,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-10-27 05:45:01,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:45:01,968 INFO L225 Difference]: With dead ends: 71 [2018-10-27 05:45:01,968 INFO L226 Difference]: Without dead ends: 70 [2018-10-27 05:45:01,969 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-10-27 05:45:01,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-27 05:45:01,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-10-27 05:45:01,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-27 05:45:01,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2018-10-27 05:45:01,976 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 21 [2018-10-27 05:45:01,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:45:01,976 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2018-10-27 05:45:01,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:45:01,976 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2018-10-27 05:45:01,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-27 05:45:01,977 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:45:01,977 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-10-27 05:45:01,977 INFO L424 AbstractCegarLoop]: === Iteration 6 === [fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:45:01,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:01,978 INFO L82 PathProgramCache]: Analyzing trace with hash -831628633, now seen corresponding path program 1 times [2018-10-27 05:45:01,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:45:01,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:01,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:45:01,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:01,979 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:45:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:45:02,209 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 05:45:02,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:45:02,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 05:45:02,210 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:45:02,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:45:02,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:45:02,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:45:02,210 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand 5 states. [2018-10-27 05:45:02,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:45:02,278 INFO L93 Difference]: Finished difference Result 127 states and 161 transitions. [2018-10-27 05:45:02,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 05:45:02,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-10-27 05:45:02,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:45:02,280 INFO L225 Difference]: With dead ends: 127 [2018-10-27 05:45:02,280 INFO L226 Difference]: Without dead ends: 66 [2018-10-27 05:45:02,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 05:45:02,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-27 05:45:02,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-10-27 05:45:02,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-27 05:45:02,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2018-10-27 05:45:02,289 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 25 [2018-10-27 05:45:02,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:45:02,290 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2018-10-27 05:45:02,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:45:02,291 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-10-27 05:45:02,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-27 05:45:02,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:45:02,292 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-10-27 05:45:02,292 INFO L424 AbstractCegarLoop]: === Iteration 7 === [fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:45:02,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:02,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1630439354, now seen corresponding path program 1 times [2018-10-27 05:45:02,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:45:02,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:02,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:45:02,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:02,295 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:45:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:45:02,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 05:45:02,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:45:02,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:45:02,345 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:45:02,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:45:02,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:45:02,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:45:02,346 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 5 states. [2018-10-27 05:45:02,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:45:02,399 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2018-10-27 05:45:02,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 05:45:02,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-10-27 05:45:02,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:45:02,401 INFO L225 Difference]: With dead ends: 76 [2018-10-27 05:45:02,401 INFO L226 Difference]: Without dead ends: 75 [2018-10-27 05:45:02,401 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-10-27 05:45:02,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-27 05:45:02,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-10-27 05:45:02,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-27 05:45:02,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2018-10-27 05:45:02,414 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 25 [2018-10-27 05:45:02,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:45:02,414 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2018-10-27 05:45:02,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:45:02,414 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2018-10-27 05:45:02,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-27 05:45:02,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:45:02,415 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-10-27 05:45:02,415 INFO L424 AbstractCegarLoop]: === Iteration 8 === [fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:45:02,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:02,415 INFO L82 PathProgramCache]: Analyzing trace with hash -995987509, now seen corresponding path program 1 times [2018-10-27 05:45:02,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:45:02,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:02,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:45:02,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:02,416 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:45:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:45:02,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 05:45:02,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:45:02,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:45:02,484 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:45:02,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:45:02,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:45:02,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:45:02,485 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand 5 states. [2018-10-27 05:45:02,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:45:02,520 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2018-10-27 05:45:02,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 05:45:02,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-10-27 05:45:02,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:45:02,522 INFO L225 Difference]: With dead ends: 79 [2018-10-27 05:45:02,522 INFO L226 Difference]: Without dead ends: 75 [2018-10-27 05:45:02,522 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-10-27 05:45:02,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-27 05:45:02,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-10-27 05:45:02,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-27 05:45:02,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2018-10-27 05:45:02,529 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 26 [2018-10-27 05:45:02,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:45:02,529 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2018-10-27 05:45:02,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:45:02,529 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2018-10-27 05:45:02,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-27 05:45:02,530 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:45:02,530 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:45:02,531 INFO L424 AbstractCegarLoop]: === Iteration 9 === [fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:45:02,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:02,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1986621902, now seen corresponding path program 1 times [2018-10-27 05:45:02,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:45:02,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:02,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:45:02,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:02,532 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:45:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:45:02,600 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-27 05:45:02,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:45:02,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 05:45:02,600 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:45:02,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 05:45:02,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 05:45:02,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-27 05:45:02,601 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand 7 states. [2018-10-27 05:45:02,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:45:02,947 INFO L93 Difference]: Finished difference Result 111 states and 142 transitions. [2018-10-27 05:45:02,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 05:45:02,948 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-10-27 05:45:02,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:45:02,949 INFO L225 Difference]: With dead ends: 111 [2018-10-27 05:45:02,949 INFO L226 Difference]: Without dead ends: 110 [2018-10-27 05:45:02,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-10-27 05:45:02,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-27 05:45:02,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 83. [2018-10-27 05:45:02,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-27 05:45:02,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 100 transitions. [2018-10-27 05:45:02,964 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 100 transitions. Word has length 46 [2018-10-27 05:45:02,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:45:02,966 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 100 transitions. [2018-10-27 05:45:02,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 05:45:02,966 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2018-10-27 05:45:02,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-27 05:45:02,967 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:45:02,968 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:45:02,968 INFO L424 AbstractCegarLoop]: === Iteration 10 === [fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:45:02,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:02,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1408540422, now seen corresponding path program 1 times [2018-10-27 05:45:02,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:45:02,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:02,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:45:02,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:02,969 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:45:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:45:03,030 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 05:45:03,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:45:03,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:45:03,031 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:45:03,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:45:03,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:45:03,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:45:03,032 INFO L87 Difference]: Start difference. First operand 83 states and 100 transitions. Second operand 5 states. [2018-10-27 05:45:03,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:45:03,094 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2018-10-27 05:45:03,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 05:45:03,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-10-27 05:45:03,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:45:03,095 INFO L225 Difference]: With dead ends: 85 [2018-10-27 05:45:03,096 INFO L226 Difference]: Without dead ends: 84 [2018-10-27 05:45:03,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 05:45:03,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-27 05:45:03,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-10-27 05:45:03,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-27 05:45:03,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2018-10-27 05:45:03,103 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 51 [2018-10-27 05:45:03,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:45:03,104 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2018-10-27 05:45:03,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:45:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2018-10-27 05:45:03,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-27 05:45:03,105 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:45:03,105 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-10-27 05:45:03,106 INFO L424 AbstractCegarLoop]: === Iteration 11 === [fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:45:03,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:03,106 INFO L82 PathProgramCache]: Analyzing trace with hash 859454554, now seen corresponding path program 1 times [2018-10-27 05:45:03,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:45:03,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:03,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:45:03,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:03,107 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:45:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:45:03,209 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-27 05:45:03,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:45:03,210 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:45:03,211 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 65 with the following transitions: [2018-10-27 05:45:03,212 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-10-27 05:45:03,248 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:45:03,248 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:45:03,767 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:45:03,769 INFO L272 AbstractInterpreter]: Visited 34 different actions 639 times. Never merged. Widened at 3 different actions 21 times. Found 35 fixpoints after 4 different actions. Largest state had 5 variables. [2018-10-27 05:45:03,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:03,786 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:45:03,886 INFO L227 lantSequenceWeakener]: Weakened 34 states. On average, predicates are now at 47.06% of their original sizes. [2018-10-27 05:45:03,887 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:45:04,852 INFO L415 sIntCurrentIteration]: We unified 63 AI predicates to 63 [2018-10-27 05:45:04,852 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:45:04,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:45:04,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [7] total 29 [2018-10-27 05:45:04,853 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:45:04,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-27 05:45:04,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-27 05:45:04,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2018-10-27 05:45:04,854 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand 24 states. [2018-10-27 05:45:08,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:45:08,740 INFO L93 Difference]: Finished difference Result 220 states and 279 transitions. [2018-10-27 05:45:08,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-27 05:45:08,741 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 64 [2018-10-27 05:45:08,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:45:08,741 INFO L225 Difference]: With dead ends: 220 [2018-10-27 05:45:08,742 INFO L226 Difference]: Without dead ends: 88 [2018-10-27 05:45:08,744 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 89 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=300, Invalid=2150, Unknown=0, NotChecked=0, Total=2450 [2018-10-27 05:45:08,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-27 05:45:08,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-10-27 05:45:08,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-27 05:45:08,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2018-10-27 05:45:08,752 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 64 [2018-10-27 05:45:08,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:45:08,752 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2018-10-27 05:45:08,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-27 05:45:08,752 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2018-10-27 05:45:08,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-27 05:45:08,755 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:45:08,756 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:45:08,756 INFO L424 AbstractCegarLoop]: === Iteration 12 === [fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:45:08,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:08,756 INFO L82 PathProgramCache]: Analyzing trace with hash 752665150, now seen corresponding path program 2 times [2018-10-27 05:45:08,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:45:08,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:08,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:45:08,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:08,757 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:45:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:45:08,906 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 16 proven. 60 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-27 05:45:08,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:45:08,906 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:45:08,906 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:45:08,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:45:08,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:45:08,908 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33f2ec0a-a132-45ce-8bbd-44941a8c9fba/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-10-27 05:45:08,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 05:45:08,914 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 05:45:08,954 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-27 05:45:08,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:45:08,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:45:09,407 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-10-27 05:45:09,407 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:45:10,280 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-10-27 05:45:10,297 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:45:10,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [7] total 15 [2018-10-27 05:45:10,297 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:45:10,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 05:45:10,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 05:45:10,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-10-27 05:45:10,298 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand 8 states. [2018-10-27 05:45:10,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:45:10,359 INFO L93 Difference]: Finished difference Result 111 states and 128 transitions. [2018-10-27 05:45:10,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 05:45:10,360 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2018-10-27 05:45:10,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:45:10,361 INFO L225 Difference]: With dead ends: 111 [2018-10-27 05:45:10,361 INFO L226 Difference]: Without dead ends: 110 [2018-10-27 05:45:10,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 164 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-10-27 05:45:10,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-27 05:45:10,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 97. [2018-10-27 05:45:10,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-27 05:45:10,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 114 transitions. [2018-10-27 05:45:10,371 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 114 transitions. Word has length 88 [2018-10-27 05:45:10,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:45:10,371 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 114 transitions. [2018-10-27 05:45:10,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 05:45:10,371 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 114 transitions. [2018-10-27 05:45:10,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-27 05:45:10,372 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:45:10,372 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:45:10,373 INFO L424 AbstractCegarLoop]: === Iteration 13 === [fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:45:10,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:10,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1857783217, now seen corresponding path program 1 times [2018-10-27 05:45:10,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:45:10,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:10,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:45:10,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:10,377 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:45:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:45:10,474 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 16 proven. 60 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-27 05:45:10,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:45:10,474 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:45:10,475 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 90 with the following transitions: [2018-10-27 05:45:10,476 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-10-27 05:45:10,477 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:45:10,478 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:45:10,705 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:45:10,706 INFO L272 AbstractInterpreter]: Visited 35 different actions 640 times. Never merged. Widened at 3 different actions 21 times. Found 35 fixpoints after 4 different actions. Largest state had 5 variables. [2018-10-27 05:45:10,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:10,747 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:45:10,784 INFO L227 lantSequenceWeakener]: Weakened 33 states. On average, predicates are now at 55.05% of their original sizes. [2018-10-27 05:45:10,786 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:45:11,785 INFO L415 sIntCurrentIteration]: We unified 88 AI predicates to 88 [2018-10-27 05:45:11,786 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:45:11,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:45:11,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [7] total 31 [2018-10-27 05:45:11,786 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:45:11,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-27 05:45:11,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-27 05:45:11,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2018-10-27 05:45:11,787 INFO L87 Difference]: Start difference. First operand 97 states and 114 transitions. Second operand 26 states. [2018-10-27 05:45:16,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:45:16,881 INFO L93 Difference]: Finished difference Result 281 states and 354 transitions. [2018-10-27 05:45:16,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-27 05:45:16,882 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 89 [2018-10-27 05:45:16,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:45:16,883 INFO L225 Difference]: With dead ends: 281 [2018-10-27 05:45:16,883 INFO L226 Difference]: Without dead ends: 188 [2018-10-27 05:45:16,884 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 108 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=313, Invalid=1757, Unknown=0, NotChecked=0, Total=2070 [2018-10-27 05:45:16,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-27 05:45:16,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 158. [2018-10-27 05:45:16,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-27 05:45:16,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 182 transitions. [2018-10-27 05:45:16,897 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 182 transitions. Word has length 89 [2018-10-27 05:45:16,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:45:16,897 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 182 transitions. [2018-10-27 05:45:16,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-27 05:45:16,897 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 182 transitions. [2018-10-27 05:45:16,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-27 05:45:16,901 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:45:16,901 INFO L375 BasicCegarLoop]: trace histogram [10, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:45:16,901 INFO L424 AbstractCegarLoop]: === Iteration 14 === [fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:45:16,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:16,901 INFO L82 PathProgramCache]: Analyzing trace with hash 27784109, now seen corresponding path program 2 times [2018-10-27 05:45:16,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:45:16,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:16,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:45:16,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:16,902 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:45:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:45:17,000 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 29 proven. 74 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-10-27 05:45:17,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:45:17,000 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:45:17,000 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:45:17,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:45:17,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:45:17,001 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33f2ec0a-a132-45ce-8bbd-44941a8c9fba/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-10-27 05:45:17,008 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 05:45:17,008 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 05:45:17,034 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-27 05:45:17,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:45:17,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:45:17,094 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-10-27 05:45:17,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:45:17,410 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-10-27 05:45:17,426 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:45:17,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [7] total 15 [2018-10-27 05:45:17,426 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:45:17,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 05:45:17,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 05:45:17,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-10-27 05:45:17,427 INFO L87 Difference]: Start difference. First operand 158 states and 182 transitions. Second operand 8 states. [2018-10-27 05:45:17,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:45:17,541 INFO L93 Difference]: Finished difference Result 191 states and 223 transitions. [2018-10-27 05:45:17,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 05:45:17,542 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2018-10-27 05:45:17,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:45:17,543 INFO L225 Difference]: With dead ends: 191 [2018-10-27 05:45:17,543 INFO L226 Difference]: Without dead ends: 190 [2018-10-27 05:45:17,543 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-10-27 05:45:17,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-27 05:45:17,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 161. [2018-10-27 05:45:17,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-27 05:45:17,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 185 transitions. [2018-10-27 05:45:17,552 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 185 transitions. Word has length 115 [2018-10-27 05:45:17,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:45:17,552 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 185 transitions. [2018-10-27 05:45:17,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 05:45:17,552 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 185 transitions. [2018-10-27 05:45:17,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-27 05:45:17,555 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:45:17,555 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:45:17,555 INFO L424 AbstractCegarLoop]: === Iteration 15 === [fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:45:17,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:17,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1075015220, now seen corresponding path program 1 times [2018-10-27 05:45:17,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:45:17,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:17,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:45:17,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:17,556 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:45:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:45:17,798 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 20 proven. 18 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-10-27 05:45:17,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:45:17,798 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:45:17,798 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 120 with the following transitions: [2018-10-27 05:45:17,799 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-10-27 05:45:17,800 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:45:17,800 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:45:17,910 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:45:17,910 INFO L272 AbstractInterpreter]: Visited 36 different actions 658 times. Merged at 2 different actions 2 times. Widened at 3 different actions 21 times. Found 36 fixpoints after 5 different actions. Largest state had 5 variables. [2018-10-27 05:45:17,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:17,931 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:45:17,976 INFO L227 lantSequenceWeakener]: Weakened 41 states. On average, predicates are now at 51.63% of their original sizes. [2018-10-27 05:45:17,979 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:45:18,411 INFO L415 sIntCurrentIteration]: We unified 118 AI predicates to 118 [2018-10-27 05:45:18,411 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:45:18,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:45:18,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [4] total 30 [2018-10-27 05:45:18,411 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:45:18,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-27 05:45:18,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-27 05:45:18,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2018-10-27 05:45:18,412 INFO L87 Difference]: Start difference. First operand 161 states and 185 transitions. Second operand 27 states. [2018-10-27 05:45:23,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:45:23,976 INFO L93 Difference]: Finished difference Result 265 states and 330 transitions. [2018-10-27 05:45:23,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-27 05:45:23,976 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 119 [2018-10-27 05:45:23,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:45:23,976 INFO L225 Difference]: With dead ends: 265 [2018-10-27 05:45:23,976 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 05:45:23,978 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 147 GetRequests, 89 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=386, Invalid=2694, Unknown=0, NotChecked=0, Total=3080 [2018-10-27 05:45:23,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 05:45:23,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 05:45:23,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 05:45:23,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 05:45:23,978 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 119 [2018-10-27 05:45:23,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:45:23,978 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 05:45:23,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-27 05:45:23,978 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 05:45:23,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 05:45:23,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 05:45:24,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 05:45:24,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 05:45:24,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 05:45:24,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 05:45:24,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 05:45:24,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 05:45:24,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 05:45:24,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 05:45:24,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 05:45:24,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 05:45:24,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 05:45:24,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 05:45:24,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 05:45:24,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 05:45:24,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 05:45:24,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 05:45:24,591 WARN L179 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 40 [2018-10-27 05:45:24,721 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 39 [2018-10-27 05:45:24,859 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 [2018-10-27 05:45:24,965 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-27 05:45:24,966 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 05:45:24,966 INFO L425 ceAbstractionStarter]: For program point fFINAL(lines 11 15) no Hoare annotation was computed. [2018-10-27 05:45:24,966 INFO L425 ceAbstractionStarter]: For program point fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-10-27 05:45:24,966 INFO L421 ceAbstractionStarter]: At program point L14(line 14) the Hoare annotation is: (let ((.cse1 (* 2 |f_#in~x|))) (let ((.cse2 (< (+ .cse1 2) 0)) (.cse4 (< 4294967288 .cse1)) (.cse3 (< .cse1 0)) (.cse0 (* 2 f_~x))) (and (or (and (<= |f_#in~x| f_~x) (<= .cse0 4294967292)) (< 4294967292 .cse1) (< .cse1 2)) (or (< 4294967286 .cse1) .cse2 (<= .cse0 4294967286)) (or .cse3 .cse4 (<= .cse0 4294967288)) (or .cse2 .cse4 (<= 1 f_~x)) (or (<= .cse0 4294967284) .cse3 (< 4294967284 .cse1)) (or .cse3 (< 4294967290 .cse1) (<= .cse0 4294967290))))) [2018-10-27 05:45:24,966 INFO L425 ceAbstractionStarter]: For program point fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-10-27 05:45:24,966 INFO L425 ceAbstractionStarter]: For program point fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-10-27 05:45:24,966 INFO L425 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2018-10-27 05:45:24,966 INFO L425 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-10-27 05:45:24,966 INFO L425 ceAbstractionStarter]: For program point L14-2(line 14) no Hoare annotation was computed. [2018-10-27 05:45:24,966 INFO L425 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2018-10-27 05:45:24,967 INFO L421 ceAbstractionStarter]: At program point L14-4(line 14) the Hoare annotation is: (let ((.cse0 (* 2 |f_#in~x|))) (let ((.cse1 (* 2 f_~x)) (.cse2 (< .cse0 2))) (and (or (< 4294967290 .cse0) (<= .cse1 4294967290) .cse2) (or (< 4294967286 .cse0) (< (+ .cse0 2) 0)) (or (< 4294967292 .cse0) (let ((.cse3 (* 2 |f_#t~ret0|))) (and (<= .cse3 0) (<= |f_#in~x| f_~x) (<= 0 .cse3) (<= (+ f_~x |f_#t~ret0|) 2147483646))) .cse2) (or (< 4294967288 .cse0) (<= .cse1 4294967288) .cse2)))) [2018-10-27 05:45:24,967 INFO L425 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2018-10-27 05:45:24,967 INFO L425 ceAbstractionStarter]: For program point L14-6(line 14) no Hoare annotation was computed. [2018-10-27 05:45:24,967 INFO L425 ceAbstractionStarter]: For program point fEXIT(lines 11 15) no Hoare annotation was computed. [2018-10-27 05:45:24,967 INFO L425 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2018-10-27 05:45:24,967 INFO L428 ceAbstractionStarter]: At program point fENTRY(lines 11 15) the Hoare annotation is: true [2018-10-27 05:45:24,967 INFO L425 ceAbstractionStarter]: For program point fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-10-27 05:45:24,967 INFO L425 ceAbstractionStarter]: For program point gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-10-27 05:45:24,967 INFO L425 ceAbstractionStarter]: For program point gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-10-27 05:45:24,967 INFO L425 ceAbstractionStarter]: For program point gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-10-27 05:45:24,967 INFO L425 ceAbstractionStarter]: For program point gFINAL(lines 17 21) no Hoare annotation was computed. [2018-10-27 05:45:24,967 INFO L425 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-10-27 05:45:24,968 INFO L425 ceAbstractionStarter]: For program point gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-10-27 05:45:24,968 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 20) no Hoare annotation was computed. [2018-10-27 05:45:24,968 INFO L425 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-10-27 05:45:24,968 INFO L421 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (let ((.cse0 (* 2 |g_#in~x|))) (let ((.cse2 (< .cse0 2)) (.cse1 (* 2 g_~x))) (and (or (< 4294967292 .cse0) (<= .cse1 4294967292) .cse2) (or (<= .cse1 4294967286) (< 4294967286 .cse0) .cse2) (or (< (+ .cse0 4294967296) 0) (and (<= |g_#in~x| g_~x) (<= .cse1 4294967294) (<= 2 .cse1)) (< 2147483647 |g_#in~x|)) (or (< .cse0 4) (<= .cse1 4294967290) (< 4294967290 .cse0))))) [2018-10-27 05:45:24,968 INFO L425 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-10-27 05:45:24,968 INFO L425 ceAbstractionStarter]: For program point L20-4(line 20) no Hoare annotation was computed. [2018-10-27 05:45:24,968 INFO L425 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2018-10-27 05:45:24,968 INFO L421 ceAbstractionStarter]: At program point L20-6(line 20) the Hoare annotation is: (let ((.cse0 (* 2 |g_#in~x|)) (.cse1 (< 2147483647 |g_#in~x|))) (and (or (< .cse0 4) .cse1) (or (< .cse0 2) (<= g_~x |g_#in~x|) .cse1) (or (< (+ .cse0 4294967296) 0) (let ((.cse2 (+ |g_#t~ret2| g_~x))) (and (= |g_#t~ret2| 0) (<= 1 .cse2) (<= .cse2 2147483647))) .cse1))) [2018-10-27 05:45:24,968 INFO L425 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2018-10-27 05:45:24,968 INFO L425 ceAbstractionStarter]: For program point L20-8(line 20) no Hoare annotation was computed. [2018-10-27 05:45:24,968 INFO L425 ceAbstractionStarter]: For program point L20-9(line 20) no Hoare annotation was computed. [2018-10-27 05:45:24,968 INFO L425 ceAbstractionStarter]: For program point gEXIT(lines 17 21) no Hoare annotation was computed. [2018-10-27 05:45:24,969 INFO L425 ceAbstractionStarter]: For program point gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-10-27 05:45:24,969 INFO L428 ceAbstractionStarter]: At program point gENTRY(lines 17 21) the Hoare annotation is: true [2018-10-27 05:45:24,969 INFO L425 ceAbstractionStarter]: For program point gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-10-27 05:45:24,969 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 05:45:24,969 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-27 05:45:24,969 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 05:45:24,969 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 05:45:24,969 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 24 27) the Hoare annotation is: true [2018-10-27 05:45:24,969 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 24 27) no Hoare annotation was computed. [2018-10-27 05:45:24,969 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-10-27 05:45:24,969 INFO L425 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-10-27 05:45:24,969 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 24 27) no Hoare annotation was computed. [2018-10-27 05:45:24,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 05:45:24 BoogieIcfgContainer [2018-10-27 05:45:24,972 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 05:45:24,973 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 05:45:24,973 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 05:45:24,973 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 05:45:24,973 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:45:00" (3/4) ... [2018-10-27 05:45:24,976 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-27 05:45:24,981 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-27 05:45:24,981 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2018-10-27 05:45:24,981 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2018-10-27 05:45:24,982 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-27 05:45:24,985 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-10-27 05:45:24,985 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-10-27 05:45:24,985 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-27 05:45:25,035 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_33f2ec0a-a132-45ce-8bbd-44941a8c9fba/bin-2019/utaipan/witness.graphml [2018-10-27 05:45:25,036 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 05:45:25,036 INFO L168 Benchmark]: Toolchain (without parser) took 25170.36 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 227.5 MB). Free memory was 957.0 MB in the beginning and 946.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 237.7 MB. Max. memory is 11.5 GB. [2018-10-27 05:45:25,037 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 05:45:25,037 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.46 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 946.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-27 05:45:25,038 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.94 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 05:45:25,038 INFO L168 Benchmark]: Boogie Preprocessor took 16.20 ms. Allocated memory is still 1.0 GB. Free memory was 946.3 MB in the beginning and 943.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 05:45:25,038 INFO L168 Benchmark]: RCFGBuilder took 489.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -197.2 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2018-10-27 05:45:25,039 INFO L168 Benchmark]: TraceAbstraction took 24422.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 953.8 MB in the end (delta: 187.0 MB). Peak memory consumption was 260.4 MB. Max. memory is 11.5 GB. [2018-10-27 05:45:25,039 INFO L168 Benchmark]: Witness Printer took 63.00 ms. Allocated memory is still 1.3 GB. Free memory was 953.8 MB in the beginning and 946.8 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-10-27 05:45:25,041 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 158.46 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 946.3 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 16.94 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.20 ms. Allocated memory is still 1.0 GB. Free memory was 946.3 MB in the beginning and 943.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 489.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -197.2 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24422.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 953.8 MB in the end (delta: 187.0 MB). Peak memory consumption was 260.4 MB. Max. memory is 11.5 GB. * Witness Printer took 63.00 ms. Allocated memory is still 1.3 GB. Free memory was 953.8 MB in the beginning and 946.8 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. 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, 24.3s OverallTime, 15 OverallIterations, 10 TraceHistogramMax, 16.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 537 SDtfs, 678 SDslu, 2671 SDs, 0 SdLazy, 1026 SolverSat, 219 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 817 GetRequests, 586 SyntacticMatches, 18 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1888 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.9s AbstIntTime, 3 AbstIntIterations, 3 AbstIntStrong, 0.945353159851302 AbsIntWeakeningRatio, 0.4646840148698885 AbsIntAvgWeakeningVarsNumRemoved, 4.5353159851301115 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 136 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 248 PreInvPairs, 275 NumberOfFragments, 353 HoareAnnotationTreeSize, 248 FomulaSimplifications, 2246 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 11 FomulaSimplificationsInter, 3591 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 928 NumberOfCodeBlocks, 822 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1112 ConstructedInterpolants, 0 QuantifiedInterpolants, 134527 SizeOfPredicates, 0 NumberOfNonLiveVariables, 195 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 19 InterpolantComputations, 14 PerfectInterpolantSequences, 1562/1777 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...