./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted/MutualRecursion_1a.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e117c266-f3bf-4b94-b50b-67f7c52357be/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e117c266-f3bf-4b94-b50b-67f7c52357be/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e117c266-f3bf-4b94-b50b-67f7c52357be/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e117c266-f3bf-4b94-b50b-67f7c52357be/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted/MutualRecursion_1a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e117c266-f3bf-4b94-b50b-67f7c52357be/bin/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e117c266-f3bf-4b94-b50b-67f7c52357be/bin/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.25-f470102 [2019-12-07 15:19:46,860 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:19:46,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:19:46,869 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:19:46,869 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:19:46,870 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:19:46,871 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:19:46,872 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:19:46,873 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:19:46,874 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:19:46,875 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:19:46,876 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:19:46,876 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:19:46,876 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:19:46,877 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:19:46,878 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:19:46,878 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:19:46,879 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:19:46,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:19:46,882 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:19:46,883 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:19:46,884 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:19:46,885 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:19:46,885 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:19:46,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:19:46,887 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:19:46,887 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:19:46,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:19:46,888 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:19:46,889 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:19:46,889 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:19:46,889 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:19:46,890 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:19:46,890 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:19:46,891 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:19:46,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:19:46,891 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:19:46,891 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:19:46,891 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:19:46,892 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:19:46,892 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:19:46,893 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e117c266-f3bf-4b94-b50b-67f7c52357be/bin/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2019-12-07 15:19:46,902 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:19:46,903 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:19:46,903 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 15:19:46,903 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 15:19:46,903 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 15:19:46,903 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 15:19:46,904 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 15:19:46,904 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 15:19:46,904 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 15:19:46,904 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 15:19:46,904 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 15:19:46,904 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 15:19:46,904 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 15:19:46,904 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 15:19:46,904 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 15:19:46,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:19:46,905 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 15:19:46,905 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 15:19:46,905 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:19:46,905 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 15:19:46,905 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:19:46,905 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 15:19:46,905 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-12-07 15:19:46,906 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 15:19:46,906 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:19:46,906 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 15:19:46,906 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:19:46,906 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:19:46,906 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:19:46,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:19:46,906 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:19:46,907 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:19:46,907 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 15:19:46,907 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 15:19:46,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 15:19:46,907 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 15:19:46,907 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:19:46,907 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 15:19:46,907 INFO L138 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/run_dir_e117c266-f3bf-4b94-b50b-67f7c52357be/bin/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 [2019-12-07 15:19:47,006 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:19:47,013 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:19:47,016 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:19:47,017 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:19:47,017 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:19:47,017 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e117c266-f3bf-4b94-b50b-67f7c52357be/bin/utaipan/../../sv-benchmarks/c/termination-crafted/MutualRecursion_1a.c [2019-12-07 15:19:47,055 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e117c266-f3bf-4b94-b50b-67f7c52357be/bin/utaipan/data/5baf60728/ff052371598341f68683443e07e96f92/FLAG1479cde65 [2019-12-07 15:19:47,538 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:19:47,538 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e117c266-f3bf-4b94-b50b-67f7c52357be/sv-benchmarks/c/termination-crafted/MutualRecursion_1a.c [2019-12-07 15:19:47,542 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e117c266-f3bf-4b94-b50b-67f7c52357be/bin/utaipan/data/5baf60728/ff052371598341f68683443e07e96f92/FLAG1479cde65 [2019-12-07 15:19:47,553 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e117c266-f3bf-4b94-b50b-67f7c52357be/bin/utaipan/data/5baf60728/ff052371598341f68683443e07e96f92 [2019-12-07 15:19:47,556 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:19:47,557 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 15:19:47,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:19:47,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:19:47,560 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:19:47,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:19:47" (1/1) ... [2019-12-07 15:19:47,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bb40537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:19:47, skipping insertion in model container [2019-12-07 15:19:47,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:19:47" (1/1) ... [2019-12-07 15:19:47,567 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:19:47,578 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:19:47,687 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:19:47,689 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:19:47,733 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:19:47,742 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:19:47,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:19:47 WrapperNode [2019-12-07 15:19:47,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:19:47,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 15:19:47,743 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 15:19:47,743 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 15:19:47,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:19:47" (1/1) ... [2019-12-07 15:19:47,752 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:19:47" (1/1) ... [2019-12-07 15:19:47,762 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 15:19:47,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:19:47,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:19:47,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:19:47,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:19:47" (1/1) ... [2019-12-07 15:19:47,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:19:47" (1/1) ... [2019-12-07 15:19:47,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:19:47" (1/1) ... [2019-12-07 15:19:47,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:19:47" (1/1) ... [2019-12-07 15:19:47,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:19:47" (1/1) ... [2019-12-07 15:19:47,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:19:47" (1/1) ... [2019-12-07 15:19:47,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:19:47" (1/1) ... [2019-12-07 15:19:47,773 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:19:47,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:19:47,773 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:19:47,773 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:19:47,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:19:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e117c266-f3bf-4b94-b50b-67f7c52357be/bin/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 [2019-12-07 15:19:47,818 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-12-07 15:19:47,818 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-12-07 15:19:47,818 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-12-07 15:19:47,818 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-12-07 15:19:47,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:19:47,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:19:47,948 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:19:47,948 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 15:19:47,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:19:47 BoogieIcfgContainer [2019-12-07 15:19:47,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:19:47,950 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:19:47,950 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:19:47,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:19:47,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:19:47" (1/3) ... [2019-12-07 15:19:47,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a32521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:19:47, skipping insertion in model container [2019-12-07 15:19:47,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:19:47" (2/3) ... [2019-12-07 15:19:47,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a32521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:19:47, skipping insertion in model container [2019-12-07 15:19:47,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:19:47" (3/3) ... [2019-12-07 15:19:47,954 INFO L109 eAbstractionObserver]: Analyzing ICFG MutualRecursion_1a.c [2019-12-07 15:19:47,960 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:19:47,964 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-12-07 15:19:47,971 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-12-07 15:19:47,986 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:19:47,986 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 15:19:47,986 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:19:47,986 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:19:47,986 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:19:47,986 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:19:47,986 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:19:47,986 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:19:47,999 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-12-07 15:19:48,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 15:19:48,003 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:19:48,003 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 15:19:48,004 INFO L410 AbstractCegarLoop]: === Iteration 1 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 15:19:48,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:19:48,007 INFO L82 PathProgramCache]: Analyzing trace with hash 68150020, now seen corresponding path program 1 times [2019-12-07 15:19:48,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:19:48,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81894487] [2019-12-07 15:19:48,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:19:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:19:48,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:19:48,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81894487] [2019-12-07 15:19:48,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:19:48,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:19:48,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169862069] [2019-12-07 15:19:48,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:19:48,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:19:48,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:19:48,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:19:48,131 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 5 states. [2019-12-07 15:19:48,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:19:48,202 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2019-12-07 15:19:48,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:19:48,203 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-12-07 15:19:48,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:19:48,210 INFO L225 Difference]: With dead ends: 62 [2019-12-07 15:19:48,210 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 15:19:48,212 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:19:48,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 15:19:48,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-12-07 15:19:48,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 15:19:48,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2019-12-07 15:19:48,243 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 5 [2019-12-07 15:19:48,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:19:48,244 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2019-12-07 15:19:48,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:19:48,244 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2019-12-07 15:19:48,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 15:19:48,244 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:19:48,244 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 15:19:48,245 INFO L410 AbstractCegarLoop]: === Iteration 2 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 15:19:48,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:19:48,245 INFO L82 PathProgramCache]: Analyzing trace with hash 2112650676, now seen corresponding path program 1 times [2019-12-07 15:19:48,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:19:48,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238395314] [2019-12-07 15:19:48,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:19:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:19:48,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:19:48,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238395314] [2019-12-07 15:19:48,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:19:48,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:19:48,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217291379] [2019-12-07 15:19:48,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:19:48,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:19:48,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:19:48,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:19:48,258 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 3 states. [2019-12-07 15:19:48,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:19:48,275 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2019-12-07 15:19:48,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:19:48,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-07 15:19:48,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:19:48,276 INFO L225 Difference]: With dead ends: 52 [2019-12-07 15:19:48,276 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 15:19:48,277 INFO L630 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 [2019-12-07 15:19:48,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 15:19:48,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-12-07 15:19:48,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 15:19:48,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2019-12-07 15:19:48,284 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 6 [2019-12-07 15:19:48,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:19:48,284 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2019-12-07 15:19:48,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:19:48,284 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2019-12-07 15:19:48,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 15:19:48,284 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:19:48,284 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:19:48,285 INFO L410 AbstractCegarLoop]: === Iteration 3 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 15:19:48,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:19:48,285 INFO L82 PathProgramCache]: Analyzing trace with hash 803040358, now seen corresponding path program 1 times [2019-12-07 15:19:48,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:19:48,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22659982] [2019-12-07 15:19:48,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:19:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:19:48,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:19:48,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22659982] [2019-12-07 15:19:48,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:19:48,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 15:19:48,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875079838] [2019-12-07 15:19:48,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 15:19:48,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:19:48,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 15:19:48,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 15:19:48,338 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 9 states. [2019-12-07 15:19:48,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:19:48,448 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2019-12-07 15:19:48,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 15:19:48,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-12-07 15:19:48,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:19:48,450 INFO L225 Difference]: With dead ends: 66 [2019-12-07 15:19:48,450 INFO L226 Difference]: Without dead ends: 63 [2019-12-07 15:19:48,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-07 15:19:48,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-12-07 15:19:48,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2019-12-07 15:19:48,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-07 15:19:48,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2019-12-07 15:19:48,461 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 13 [2019-12-07 15:19:48,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:19:48,461 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2019-12-07 15:19:48,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 15:19:48,462 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2019-12-07 15:19:48,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 15:19:48,462 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:19:48,463 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:19:48,463 INFO L410 AbstractCegarLoop]: === Iteration 4 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 15:19:48,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:19:48,463 INFO L82 PathProgramCache]: Analyzing trace with hash -265858514, now seen corresponding path program 1 times [2019-12-07 15:19:48,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:19:48,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789689066] [2019-12-07 15:19:48,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:19:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:19:48,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 15:19:48,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789689066] [2019-12-07 15:19:48,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:19:48,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:19:48,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254670109] [2019-12-07 15:19:48,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:19:48,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:19:48,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:19:48,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:19:48,484 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 3 states. [2019-12-07 15:19:48,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:19:48,491 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2019-12-07 15:19:48,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:19:48,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 15:19:48,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:19:48,492 INFO L225 Difference]: With dead ends: 61 [2019-12-07 15:19:48,492 INFO L226 Difference]: Without dead ends: 60 [2019-12-07 15:19:48,493 INFO L630 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 [2019-12-07 15:19:48,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-12-07 15:19:48,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-12-07 15:19:48,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-07 15:19:48,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2019-12-07 15:19:48,499 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 17 [2019-12-07 15:19:48,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:19:48,500 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2019-12-07 15:19:48,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:19:48,500 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2019-12-07 15:19:48,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 15:19:48,501 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:19:48,501 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:19:48,501 INFO L410 AbstractCegarLoop]: === Iteration 5 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 15:19:48,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:19:48,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1650762684, now seen corresponding path program 1 times [2019-12-07 15:19:48,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:19:48,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039672522] [2019-12-07 15:19:48,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:19:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:19:48,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 15:19:48,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039672522] [2019-12-07 15:19:48,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:19:48,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:19:48,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32447697] [2019-12-07 15:19:48,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:19:48,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:19:48,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:19:48,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:19:48,529 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 5 states. [2019-12-07 15:19:48,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:19:48,566 INFO L93 Difference]: Finished difference Result 93 states and 122 transitions. [2019-12-07 15:19:48,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:19:48,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-07 15:19:48,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:19:48,568 INFO L225 Difference]: With dead ends: 93 [2019-12-07 15:19:48,568 INFO L226 Difference]: Without dead ends: 92 [2019-12-07 15:19:48,569 INFO L630 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 [2019-12-07 15:19:48,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-07 15:19:48,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2019-12-07 15:19:48,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 15:19:48,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2019-12-07 15:19:48,581 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 21 [2019-12-07 15:19:48,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:19:48,581 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2019-12-07 15:19:48,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:19:48,582 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2019-12-07 15:19:48,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 15:19:48,583 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:19:48,583 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:19:48,583 INFO L410 AbstractCegarLoop]: === Iteration 6 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 15:19:48,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:19:48,583 INFO L82 PathProgramCache]: Analyzing trace with hash 365964416, now seen corresponding path program 1 times [2019-12-07 15:19:48,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:19:48,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833536447] [2019-12-07 15:19:48,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:19:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:19:48,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 15:19:48,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833536447] [2019-12-07 15:19:48,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:19:48,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:19:48,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898409324] [2019-12-07 15:19:48,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:19:48,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:19:48,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:19:48,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:19:48,616 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand 5 states. [2019-12-07 15:19:48,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:19:48,648 INFO L93 Difference]: Finished difference Result 93 states and 119 transitions. [2019-12-07 15:19:48,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:19:48,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 15:19:48,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:19:48,650 INFO L225 Difference]: With dead ends: 93 [2019-12-07 15:19:48,650 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 15:19:48,650 INFO L630 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 [2019-12-07 15:19:48,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 15:19:48,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2019-12-07 15:19:48,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 15:19:48,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2019-12-07 15:19:48,658 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 22 [2019-12-07 15:19:48,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:19:48,658 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2019-12-07 15:19:48,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:19:48,658 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2019-12-07 15:19:48,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 15:19:48,659 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:19:48,659 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:19:48,659 INFO L410 AbstractCegarLoop]: === Iteration 7 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 15:19:48,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:19:48,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1488102097, now seen corresponding path program 1 times [2019-12-07 15:19:48,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:19:48,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362473230] [2019-12-07 15:19:48,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:19:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:19:48,696 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 15:19:48,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362473230] [2019-12-07 15:19:48,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:19:48,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 15:19:48,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101266483] [2019-12-07 15:19:48,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 15:19:48,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:19:48,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 15:19:48,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:19:48,698 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand 7 states. [2019-12-07 15:19:48,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:19:48,796 INFO L93 Difference]: Finished difference Result 95 states and 119 transitions. [2019-12-07 15:19:48,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 15:19:48,796 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-12-07 15:19:48,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:19:48,798 INFO L225 Difference]: With dead ends: 95 [2019-12-07 15:19:48,798 INFO L226 Difference]: Without dead ends: 94 [2019-12-07 15:19:48,798 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-07 15:19:48,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-07 15:19:48,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2019-12-07 15:19:48,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-07 15:19:48,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 111 transitions. [2019-12-07 15:19:48,809 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 111 transitions. Word has length 24 [2019-12-07 15:19:48,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:19:48,809 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 111 transitions. [2019-12-07 15:19:48,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 15:19:48,809 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 111 transitions. [2019-12-07 15:19:48,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 15:19:48,810 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:19:48,811 INFO L410 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:19:48,811 INFO L410 AbstractCegarLoop]: === Iteration 8 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 15:19:48,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:19:48,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1361134625, now seen corresponding path program 1 times [2019-12-07 15:19:48,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:19:48,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409512821] [2019-12-07 15:19:48,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:19:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:19:48,857 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 15:19:48,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409512821] [2019-12-07 15:19:48,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:19:48,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 15:19:48,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802731123] [2019-12-07 15:19:48,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 15:19:48,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:19:48,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 15:19:48,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:19:48,858 INFO L87 Difference]: Start difference. First operand 88 states and 111 transitions. Second operand 7 states. [2019-12-07 15:19:48,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:19:48,952 INFO L93 Difference]: Finished difference Result 95 states and 118 transitions. [2019-12-07 15:19:48,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 15:19:48,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 15:19:48,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:19:48,954 INFO L225 Difference]: With dead ends: 95 [2019-12-07 15:19:48,954 INFO L226 Difference]: Without dead ends: 94 [2019-12-07 15:19:48,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-07 15:19:48,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-07 15:19:48,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2019-12-07 15:19:48,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-12-07 15:19:48,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 112 transitions. [2019-12-07 15:19:48,965 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 112 transitions. Word has length 33 [2019-12-07 15:19:48,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:19:48,965 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 112 transitions. [2019-12-07 15:19:48,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 15:19:48,965 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 112 transitions. [2019-12-07 15:19:48,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 15:19:48,966 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:19:48,967 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-12-07 15:19:48,967 INFO L410 AbstractCegarLoop]: === Iteration 9 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 15:19:48,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:19:48,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1124211105, now seen corresponding path program 1 times [2019-12-07 15:19:48,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:19:48,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237431093] [2019-12-07 15:19:48,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:19:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:19:49,073 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 15:19:49,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237431093] [2019-12-07 15:19:49,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364730857] [2019-12-07 15:19:49,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e117c266-f3bf-4b94-b50b-67f7c52357be/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:19:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:19:49,100 INFO L264 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 15:19:49,104 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:19:49,162 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 15:19:49,162 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:19:49,286 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 15:19:49,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [45307065] [2019-12-07 15:19:49,302 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2019-12-07 15:19:49,302 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 15:19:49,307 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 15:19:49,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 15:19:49,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 20 [2019-12-07 15:19:49,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156648697] [2019-12-07 15:19:49,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 15:19:49,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:19:49,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 15:19:49,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2019-12-07 15:19:49,310 INFO L87 Difference]: Start difference. First operand 89 states and 112 transitions. Second operand 20 states. [2019-12-07 15:19:49,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:19:49,553 INFO L93 Difference]: Finished difference Result 136 states and 175 transitions. [2019-12-07 15:19:49,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 15:19:49,553 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2019-12-07 15:19:49,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:19:49,553 INFO L225 Difference]: With dead ends: 136 [2019-12-07 15:19:49,554 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 15:19:49,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2019-12-07 15:19:49,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 15:19:49,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 15:19:49,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 15:19:49,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 15:19:49,558 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-12-07 15:19:49,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:19:49,558 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 15:19:49,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 15:19:49,558 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 15:19:49,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 15:19:49,759 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:19:49,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 15:19:49,918 INFO L246 CegarLoopResult]: For program point fFINAL(lines 11 15) no Hoare annotation was computed. [2019-12-07 15:19:49,918 INFO L242 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (and (or (not (<= |f_#in~x| 2147483646)) (and (<= f_~x |f_#in~x|) (<= |f_#in~x| f_~x))) (not (<= |f_#in~x| 0))) [2019-12-07 15:19:49,918 INFO L246 CegarLoopResult]: For program point L13(lines 13 14) no Hoare annotation was computed. [2019-12-07 15:19:49,918 INFO L246 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-12-07 15:19:49,918 INFO L246 CegarLoopResult]: For program point L14-2(line 14) no Hoare annotation was computed. [2019-12-07 15:19:49,919 INFO L246 CegarLoopResult]: For program point L14-3(line 14) no Hoare annotation was computed. [2019-12-07 15:19:49,919 INFO L242 CegarLoopResult]: At program point L14-4(line 14) the Hoare annotation is: (or (not (<= |f_#in~x| 2147483646)) (and (<= f_~x |f_#in~x|) (< |f_#in~x| 2) (<= 1 f_~x))) [2019-12-07 15:19:49,919 INFO L246 CegarLoopResult]: For program point L14-5(line 14) no Hoare annotation was computed. [2019-12-07 15:19:49,919 INFO L246 CegarLoopResult]: For program point fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-12-07 15:19:49,919 INFO L246 CegarLoopResult]: For program point fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-12-07 15:19:49,919 INFO L246 CegarLoopResult]: For program point L14-6(line 14) no Hoare annotation was computed. [2019-12-07 15:19:49,919 INFO L246 CegarLoopResult]: For program point fEXIT(lines 11 15) no Hoare annotation was computed. [2019-12-07 15:19:49,919 INFO L246 CegarLoopResult]: For program point L14-7(line 14) no Hoare annotation was computed. [2019-12-07 15:19:49,919 INFO L249 CegarLoopResult]: At program point fENTRY(lines 11 15) the Hoare annotation is: true [2019-12-07 15:19:49,919 INFO L246 CegarLoopResult]: For program point fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-12-07 15:19:49,919 INFO L246 CegarLoopResult]: For program point fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-12-07 15:19:49,920 INFO L246 CegarLoopResult]: For program point gFINAL(lines 17 21) no Hoare annotation was computed. [2019-12-07 15:19:49,920 INFO L246 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2019-12-07 15:19:49,920 INFO L246 CegarLoopResult]: For program point L19(lines 19 20) no Hoare annotation was computed. [2019-12-07 15:19:49,920 INFO L246 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-12-07 15:19:49,920 INFO L242 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (and (or (and (<= g_~x 2147483647) (<= |g_#in~x| g_~x)) (not (<= |g_#in~x| 2147483647))) (or (not (<= |g_#in~x| 2147483646)) (and (<= 1 g_~x) (<= g_~x 2147483646)))) [2019-12-07 15:19:49,920 INFO L246 CegarLoopResult]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-12-07 15:19:49,920 INFO L246 CegarLoopResult]: For program point L20-4(line 20) no Hoare annotation was computed. [2019-12-07 15:19:49,920 INFO L246 CegarLoopResult]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-12-07 15:19:49,920 INFO L242 CegarLoopResult]: At program point L20-6(line 20) the Hoare annotation is: (and (or (and (<= 0 |g_#t~ret2|) (<= 1 g_~x) (<= |g_#t~ret2| 0)) (not (<= |g_#in~x| 2147483646))) (or (and (<= |g_#in~x| g_~x) (<= g_~x 1)) (not (<= |g_#in~x| 2147483647)))) [2019-12-07 15:19:49,920 INFO L246 CegarLoopResult]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-12-07 15:19:49,920 INFO L246 CegarLoopResult]: For program point L20-8(line 20) no Hoare annotation was computed. [2019-12-07 15:19:49,920 INFO L246 CegarLoopResult]: For program point L20-9(line 20) no Hoare annotation was computed. [2019-12-07 15:19:49,920 INFO L246 CegarLoopResult]: For program point gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-12-07 15:19:49,920 INFO L246 CegarLoopResult]: For program point gEXIT(lines 17 21) no Hoare annotation was computed. [2019-12-07 15:19:49,921 INFO L246 CegarLoopResult]: For program point gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-12-07 15:19:49,921 INFO L249 CegarLoopResult]: At program point gENTRY(lines 17 21) the Hoare annotation is: true [2019-12-07 15:19:49,921 INFO L246 CegarLoopResult]: For program point gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-12-07 15:19:49,921 INFO L246 CegarLoopResult]: For program point gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-12-07 15:19:49,921 INFO L246 CegarLoopResult]: For program point gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-12-07 15:19:49,921 INFO L246 CegarLoopResult]: For program point gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-12-07 15:19:49,921 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 15:19:49,921 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 15:19:49,921 INFO L242 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-12-07 15:19:49,921 INFO L246 CegarLoopResult]: For program point L26-1(line 26) no Hoare annotation was computed. [2019-12-07 15:19:49,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:19:49 BoogieIcfgContainer [2019-12-07 15:19:49,925 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:19:49,925 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:19:49,925 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:19:49,925 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:19:49,925 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:19:47" (3/4) ... [2019-12-07 15:19:49,927 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 15:19:49,931 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-12-07 15:19:49,932 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-12-07 15:19:49,935 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-12-07 15:19:49,935 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 15:19:49,935 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 15:19:49,966 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e117c266-f3bf-4b94-b50b-67f7c52357be/bin/utaipan/witness.graphml [2019-12-07 15:19:49,966 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:19:49,967 INFO L168 Benchmark]: Toolchain (without parser) took 2410.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.1 MB). Free memory was 942.4 MB in the beginning and 987.0 MB in the end (delta: -44.6 MB). Peak memory consumption was 43.5 MB. Max. memory is 11.5 GB. [2019-12-07 15:19:49,968 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:19:49,968 INFO L168 Benchmark]: CACSL2BoogieTranslator took 185.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.1 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -140.4 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-12-07 15:19:49,968 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.98 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:19:49,969 INFO L168 Benchmark]: Boogie Preprocessor took 10.57 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:19:49,969 INFO L168 Benchmark]: RCFGBuilder took 175.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2019-12-07 15:19:49,969 INFO L168 Benchmark]: TraceAbstraction took 1975.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 988.8 MB in the end (delta: 68.5 MB). Peak memory consumption was 68.5 MB. Max. memory is 11.5 GB. [2019-12-07 15:19:49,969 INFO L168 Benchmark]: Witness Printer took 41.08 ms. Allocated memory is still 1.1 GB. Free memory was 988.8 MB in the beginning and 987.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:19:49,971 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 185.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.1 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -140.4 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.98 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.57 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 175.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1975.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 988.8 MB in the end (delta: 68.5 MB). Peak memory consumption was 68.5 MB. Max. memory is 11.5 GB. * Witness Printer took 41.08 ms. Allocated memory is still 1.1 GB. Free memory was 988.8 MB in the beginning and 987.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 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 3 procedures, 40 locations, 10 error locations. Result: SAFE, OverallTime: 1.7s, OverallIterations: 9, TraceHistogramMax: 4, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 262 SDtfs, 289 SDslu, 724 SDs, 0 SdLazy, 692 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 50 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 61 PreInvPairs, 71 NumberOfFragments, 90 HoareAnnotationTreeSize, 61 FomulaSimplifications, 120 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 88 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 215 NumberOfCodeBlocks, 215 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 241 ConstructedInterpolants, 0 QuantifiedInterpolants, 17583 SizeOfPredicates, 4 NumberOfNonLiveVariables, 78 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 68/77 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...