./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex5.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_196c0cb3-5862-41fa-9f1a-b0ca785a710b/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_196c0cb3-5862-41fa-9f1a-b0ca785a710b/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_196c0cb3-5862-41fa-9f1a-b0ca785a710b/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_196c0cb3-5862-41fa-9f1a-b0ca785a710b/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex5.c -s /tmp/vcloud-vcloud-master/worker/run_dir_196c0cb3-5862-41fa-9f1a-b0ca785a710b/bin/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_196c0cb3-5862-41fa-9f1a-b0ca785a710b/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 457415f9b28998cf0ba7f80d69eaf14873f5a98f ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 19:34:56,165 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:34:56,166 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:34:56,173 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:34:56,174 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:34:56,174 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:34:56,175 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:34:56,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:34:56,178 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:34:56,178 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:34:56,179 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:34:56,180 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:34:56,180 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:34:56,181 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:34:56,181 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:34:56,182 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:34:56,183 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:34:56,183 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:34:56,185 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:34:56,186 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:34:56,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:34:56,188 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:34:56,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:34:56,189 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:34:56,191 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:34:56,191 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:34:56,191 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:34:56,192 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:34:56,192 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:34:56,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:34:56,193 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:34:56,193 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:34:56,194 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:34:56,194 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:34:56,195 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:34:56,195 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:34:56,195 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:34:56,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:34:56,196 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:34:56,196 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:34:56,197 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:34:56,197 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_196c0cb3-5862-41fa-9f1a-b0ca785a710b/bin/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2019-12-07 19:34:56,207 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:34:56,207 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:34:56,208 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:34:56,208 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:34:56,208 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:34:56,208 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:34:56,208 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 19:34:56,209 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:34:56,209 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:34:56,209 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 19:34:56,209 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 19:34:56,209 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:34:56,209 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 19:34:56,209 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 19:34:56,210 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 19:34:56,210 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:34:56,210 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 19:34:56,210 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:34:56,210 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:34:56,211 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:34:56,211 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:34:56,211 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:34:56,211 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-12-07 19:34:56,211 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:34:56,211 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:34:56,211 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:34:56,212 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:34:56,212 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:34:56,212 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:34:56,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:34:56,212 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:34:56,212 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:34:56,213 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:34:56,213 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 19:34:56,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:34:56,213 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:34:56,213 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:34:56,213 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:34:56,213 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_196c0cb3-5862-41fa-9f1a-b0ca785a710b/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 -> 457415f9b28998cf0ba7f80d69eaf14873f5a98f [2019-12-07 19:34:56,312 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:34:56,323 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:34:56,325 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:34:56,327 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:34:56,327 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:34:56,328 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_196c0cb3-5862-41fa-9f1a-b0ca785a710b/bin/utaipan/../../sv-benchmarks/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex5.c [2019-12-07 19:34:56,366 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_196c0cb3-5862-41fa-9f1a-b0ca785a710b/bin/utaipan/data/8dc4d1467/73749de35b274ee2b4d075fa996717b5/FLAG0b6420fca [2019-12-07 19:34:56,685 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:34:56,686 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_196c0cb3-5862-41fa-9f1a-b0ca785a710b/sv-benchmarks/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex5.c [2019-12-07 19:34:56,689 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_196c0cb3-5862-41fa-9f1a-b0ca785a710b/bin/utaipan/data/8dc4d1467/73749de35b274ee2b4d075fa996717b5/FLAG0b6420fca [2019-12-07 19:34:56,698 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_196c0cb3-5862-41fa-9f1a-b0ca785a710b/bin/utaipan/data/8dc4d1467/73749de35b274ee2b4d075fa996717b5 [2019-12-07 19:34:56,700 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:34:56,701 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:34:56,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:34:56,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:34:56,704 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:34:56,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:34:56" (1/1) ... [2019-12-07 19:34:56,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65788400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:56, skipping insertion in model container [2019-12-07 19:34:56,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:34:56" (1/1) ... [2019-12-07 19:34:56,712 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:34:56,725 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:34:56,833 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:34:56,835 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:34:56,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:34:56,885 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:34:56,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:56 WrapperNode [2019-12-07 19:34:56,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:34:56,886 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:34:56,886 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:34:56,886 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:34:56,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:56" (1/1) ... [2019-12-07 19:34:56,895 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:56" (1/1) ... [2019-12-07 19:34:56,905 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:34:56,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:34:56,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:34:56,906 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:34:56,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:56" (1/1) ... [2019-12-07 19:34:56,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:56" (1/1) ... [2019-12-07 19:34:56,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:56" (1/1) ... [2019-12-07 19:34:56,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:56" (1/1) ... [2019-12-07 19:34:56,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:56" (1/1) ... [2019-12-07 19:34:56,915 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:56" (1/1) ... [2019-12-07 19:34:56,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:56" (1/1) ... [2019-12-07 19:34:56,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:34:56,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:34:56,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:34:56,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:34:56,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_196c0cb3-5862-41fa-9f1a-b0ca785a710b/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 19:34:56,955 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-12-07 19:34:56,955 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-12-07 19:34:56,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:34:56,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:34:57,068 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:34:57,068 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 19:34:57,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:34:57 BoogieIcfgContainer [2019-12-07 19:34:57,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:34:57,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:34:57,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:34:57,072 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:34:57,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:34:56" (1/3) ... [2019-12-07 19:34:57,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd05a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:34:57, skipping insertion in model container [2019-12-07 19:34:57,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:56" (2/3) ... [2019-12-07 19:34:57,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd05a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:34:57, skipping insertion in model container [2019-12-07 19:34:57,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:34:57" (3/3) ... [2019-12-07 19:34:57,074 INFO L109 eAbstractionObserver]: Analyzing ICFG LeeJonesBen-Amram-POPL2001-Ex5.c [2019-12-07 19:34:57,080 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:34:57,084 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-12-07 19:34:57,091 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-07 19:34:57,105 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:34:57,105 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:34:57,106 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:34:57,106 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:34:57,106 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:34:57,106 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:34:57,106 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:34:57,106 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:34:57,117 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-12-07 19:34:57,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 19:34:57,120 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:57,121 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:57,121 INFO L410 AbstractCegarLoop]: === Iteration 1 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:34:57,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:57,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1461861353, now seen corresponding path program 1 times [2019-12-07 19:34:57,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:57,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623217194] [2019-12-07 19:34:57,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:57,242 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 19:34:57,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623217194] [2019-12-07 19:34:57,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:57,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:34:57,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859547233] [2019-12-07 19:34:57,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:34:57,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:57,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:34:57,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:34:57,257 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2019-12-07 19:34:57,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:57,332 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2019-12-07 19:34:57,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:34:57,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-12-07 19:34:57,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:57,339 INFO L225 Difference]: With dead ends: 42 [2019-12-07 19:34:57,339 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 19:34:57,342 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 19:34:57,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 19:34:57,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2019-12-07 19:34:57,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 19:34:57,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-12-07 19:34:57,366 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 7 [2019-12-07 19:34:57,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:57,367 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-12-07 19:34:57,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:34:57,367 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-12-07 19:34:57,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 19:34:57,367 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:57,367 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:57,368 INFO L410 AbstractCegarLoop]: === Iteration 2 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:34:57,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:57,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1461861577, now seen corresponding path program 1 times [2019-12-07 19:34:57,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:57,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095492375] [2019-12-07 19:34:57,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:57,394 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 19:34:57,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095492375] [2019-12-07 19:34:57,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:57,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:34:57,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92658235] [2019-12-07 19:34:57,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:34:57,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:57,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:34:57,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:34:57,397 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 5 states. [2019-12-07 19:34:57,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:57,427 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-12-07 19:34:57,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:34:57,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-12-07 19:34:57,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:57,428 INFO L225 Difference]: With dead ends: 34 [2019-12-07 19:34:57,428 INFO L226 Difference]: Without dead ends: 33 [2019-12-07 19:34:57,429 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 19:34:57,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-07 19:34:57,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2019-12-07 19:34:57,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 19:34:57,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-12-07 19:34:57,433 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 7 [2019-12-07 19:34:57,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:57,434 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-12-07 19:34:57,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:34:57,434 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-12-07 19:34:57,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 19:34:57,434 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:57,434 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:57,434 INFO L410 AbstractCegarLoop]: === Iteration 3 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:34:57,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:57,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1926938272, now seen corresponding path program 1 times [2019-12-07 19:34:57,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:57,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418172247] [2019-12-07 19:34:57,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:57,456 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 19:34:57,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418172247] [2019-12-07 19:34:57,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:57,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:34:57,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735947837] [2019-12-07 19:34:57,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:34:57,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:57,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:34:57,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:34:57,459 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2019-12-07 19:34:57,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:57,488 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-12-07 19:34:57,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:34:57,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-12-07 19:34:57,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:57,489 INFO L225 Difference]: With dead ends: 33 [2019-12-07 19:34:57,490 INFO L226 Difference]: Without dead ends: 32 [2019-12-07 19:34:57,490 INFO L630 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 [2019-12-07 19:34:57,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-07 19:34:57,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2019-12-07 19:34:57,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 19:34:57,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-12-07 19:34:57,496 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 8 [2019-12-07 19:34:57,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:57,496 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-12-07 19:34:57,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:34:57,496 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-12-07 19:34:57,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 19:34:57,497 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:57,497 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:57,497 INFO L410 AbstractCegarLoop]: === Iteration 4 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:34:57,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:57,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1926931321, now seen corresponding path program 1 times [2019-12-07 19:34:57,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:57,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379970427] [2019-12-07 19:34:57,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:57,518 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 19:34:57,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379970427] [2019-12-07 19:34:57,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:57,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:34:57,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652184910] [2019-12-07 19:34:57,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:34:57,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:57,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:34:57,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:34:57,519 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2019-12-07 19:34:57,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:57,546 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-12-07 19:34:57,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:34:57,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-12-07 19:34:57,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:57,547 INFO L225 Difference]: With dead ends: 32 [2019-12-07 19:34:57,547 INFO L226 Difference]: Without dead ends: 31 [2019-12-07 19:34:57,547 INFO L630 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 [2019-12-07 19:34:57,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-07 19:34:57,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-12-07 19:34:57,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 19:34:57,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-12-07 19:34:57,553 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 8 [2019-12-07 19:34:57,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:57,553 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-12-07 19:34:57,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:34:57,553 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-12-07 19:34:57,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 19:34:57,554 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:57,554 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:57,554 INFO L410 AbstractCegarLoop]: === Iteration 5 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:34:57,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:57,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1954337320, now seen corresponding path program 1 times [2019-12-07 19:34:57,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:57,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289466812] [2019-12-07 19:34:57,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:57,589 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 19:34:57,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289466812] [2019-12-07 19:34:57,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:57,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:34:57,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118766643] [2019-12-07 19:34:57,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:34:57,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:57,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:34:57,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:34:57,591 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2019-12-07 19:34:57,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:57,637 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-12-07 19:34:57,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:34:57,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 19:34:57,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:57,638 INFO L225 Difference]: With dead ends: 43 [2019-12-07 19:34:57,638 INFO L226 Difference]: Without dead ends: 42 [2019-12-07 19:34:57,639 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:34:57,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-07 19:34:57,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2019-12-07 19:34:57,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 19:34:57,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-12-07 19:34:57,643 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 13 [2019-12-07 19:34:57,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:57,644 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-12-07 19:34:57,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:34:57,644 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-12-07 19:34:57,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 19:34:57,644 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:57,644 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:57,645 INFO L410 AbstractCegarLoop]: === Iteration 6 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:34:57,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:57,645 INFO L82 PathProgramCache]: Analyzing trace with hash -906050173, now seen corresponding path program 1 times [2019-12-07 19:34:57,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:57,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74892080] [2019-12-07 19:34:57,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:57,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:57,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74892080] [2019-12-07 19:34:57,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825585191] [2019-12-07 19:34:57,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_196c0cb3-5862-41fa-9f1a-b0ca785a710b/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 19:34:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:57,687 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 19:34:57,690 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:34:57,726 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 19:34:57,726 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:34:57,755 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 19:34:57,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 19:34:57,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 11 [2019-12-07 19:34:57,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807016731] [2019-12-07 19:34:57,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:34:57,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:57,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:34:57,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:34:57,756 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 8 states. [2019-12-07 19:34:57,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:57,801 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-12-07 19:34:57,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:34:57,802 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-12-07 19:34:57,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:57,802 INFO L225 Difference]: With dead ends: 35 [2019-12-07 19:34:57,803 INFO L226 Difference]: Without dead ends: 34 [2019-12-07 19:34:57,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-07 19:34:57,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-07 19:34:57,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2019-12-07 19:34:57,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 19:34:57,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-12-07 19:34:57,808 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 13 [2019-12-07 19:34:57,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:57,808 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-12-07 19:34:57,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:34:57,808 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-12-07 19:34:57,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 19:34:57,809 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:57,809 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:58,010 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:34:58,010 INFO L410 AbstractCegarLoop]: === Iteration 7 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:34:58,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:58,010 INFO L82 PathProgramCache]: Analyzing trace with hash -906049949, now seen corresponding path program 1 times [2019-12-07 19:34:58,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:58,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843383520] [2019-12-07 19:34:58,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:58,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:58,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843383520] [2019-12-07 19:34:58,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030474951] [2019-12-07 19:34:58,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_196c0cb3-5862-41fa-9f1a-b0ca785a710b/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:34:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:58,072 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 19:34:58,073 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:34:58,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:58,076 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:34:58,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:58,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [138572725] [2019-12-07 19:34:58,125 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 19:34:58,125 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:34:58,129 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 19:34:58,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:34:58,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2019-12-07 19:34:58,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819752095] [2019-12-07 19:34:58,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 19:34:58,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:58,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 19:34:58,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:34:58,132 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 12 states. [2019-12-07 19:34:58,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:58,209 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-12-07 19:34:58,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:34:58,209 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2019-12-07 19:34:58,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:58,210 INFO L225 Difference]: With dead ends: 28 [2019-12-07 19:34:58,210 INFO L226 Difference]: Without dead ends: 27 [2019-12-07 19:34:58,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-12-07 19:34:58,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-12-07 19:34:58,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2019-12-07 19:34:58,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 19:34:58,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-12-07 19:34:58,213 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 13 [2019-12-07 19:34:58,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:58,213 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-12-07 19:34:58,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 19:34:58,213 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-12-07 19:34:58,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:34:58,213 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:58,214 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:58,414 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:34:58,415 INFO L410 AbstractCegarLoop]: === Iteration 8 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:34:58,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:58,415 INFO L82 PathProgramCache]: Analyzing trace with hash 454907873, now seen corresponding path program 1 times [2019-12-07 19:34:58,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:58,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350679266] [2019-12-07 19:34:58,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:58,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:58,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350679266] [2019-12-07 19:34:58,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646833603] [2019-12-07 19:34:58,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_196c0cb3-5862-41fa-9f1a-b0ca785a710b/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:34:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:58,490 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 19:34:58,491 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:34:58,531 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:58,531 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:34:58,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:58,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1125842152] [2019-12-07 19:34:58,582 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 19:34:58,582 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:34:58,582 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 19:34:58,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:34:58,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2019-12-07 19:34:58,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589642675] [2019-12-07 19:34:58,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 19:34:58,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:58,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 19:34:58,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-07 19:34:58,584 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 15 states. [2019-12-07 19:34:58,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:58,700 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-12-07 19:34:58,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 19:34:58,700 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-12-07 19:34:58,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:58,701 INFO L225 Difference]: With dead ends: 37 [2019-12-07 19:34:58,701 INFO L226 Difference]: Without dead ends: 26 [2019-12-07 19:34:58,702 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2019-12-07 19:34:58,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-07 19:34:58,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2019-12-07 19:34:58,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-12-07 19:34:58,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-12-07 19:34:58,705 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2019-12-07 19:34:58,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:58,705 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-12-07 19:34:58,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 19:34:58,705 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-12-07 19:34:58,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:34:58,706 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:58,706 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:58,906 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:34:58,907 INFO L410 AbstractCegarLoop]: === Iteration 9 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:34:58,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:58,908 INFO L82 PathProgramCache]: Analyzing trace with hash 454914824, now seen corresponding path program 1 times [2019-12-07 19:34:58,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:58,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818422341] [2019-12-07 19:34:58,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:58,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:58,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818422341] [2019-12-07 19:34:58,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841880696] [2019-12-07 19:34:58,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_196c0cb3-5862-41fa-9f1a-b0ca785a710b/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:34:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:58,995 INFO L264 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 19:34:58,997 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:34:59,031 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 19:34:59,032 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:34:59,048 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 19:34:59,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 19:34:59,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6] total 9 [2019-12-07 19:34:59,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918010553] [2019-12-07 19:34:59,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:34:59,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:59,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:34:59,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:34:59,050 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 5 states. [2019-12-07 19:34:59,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:59,094 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-12-07 19:34:59,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:34:59,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 19:34:59,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:59,095 INFO L225 Difference]: With dead ends: 25 [2019-12-07 19:34:59,095 INFO L226 Difference]: Without dead ends: 24 [2019-12-07 19:34:59,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:34:59,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-07 19:34:59,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-12-07 19:34:59,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 19:34:59,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-12-07 19:34:59,098 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2019-12-07 19:34:59,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:59,099 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-12-07 19:34:59,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:34:59,099 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-12-07 19:34:59,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:34:59,099 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:59,099 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:59,300 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:34:59,301 INFO L410 AbstractCegarLoop]: === Iteration 10 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:34:59,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:59,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1977222701, now seen corresponding path program 1 times [2019-12-07 19:34:59,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:59,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702924223] [2019-12-07 19:34:59,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:59,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:59,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702924223] [2019-12-07 19:34:59,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059628585] [2019-12-07 19:34:59,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_196c0cb3-5862-41fa-9f1a-b0ca785a710b/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:34:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:59,388 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 19:34:59,389 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:34:59,391 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:59,391 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:34:59,423 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:59,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2075173856] [2019-12-07 19:34:59,424 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 19:34:59,424 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:34:59,424 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 19:34:59,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:34:59,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-12-07 19:34:59,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561281573] [2019-12-07 19:34:59,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 19:34:59,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:59,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 19:34:59,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:34:59,425 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 12 states. [2019-12-07 19:34:59,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:59,543 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2019-12-07 19:34:59,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 19:34:59,543 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2019-12-07 19:34:59,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:59,543 INFO L225 Difference]: With dead ends: 51 [2019-12-07 19:34:59,543 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 19:34:59,544 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2019-12-07 19:34:59,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 19:34:59,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2019-12-07 19:34:59,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 19:34:59,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2019-12-07 19:34:59,549 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 14 [2019-12-07 19:34:59,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:59,549 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2019-12-07 19:34:59,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 19:34:59,549 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2019-12-07 19:34:59,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 19:34:59,550 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:59,550 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2019-12-07 19:34:59,750 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:34:59,751 INFO L410 AbstractCegarLoop]: === Iteration 11 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:34:59,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:59,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1375099731, now seen corresponding path program 2 times [2019-12-07 19:34:59,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:59,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059168758] [2019-12-07 19:34:59,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:59,821 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:59,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059168758] [2019-12-07 19:34:59,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225202815] [2019-12-07 19:34:59,822 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_196c0cb3-5862-41fa-9f1a-b0ca785a710b/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:34:59,838 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 19:34:59,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 19:34:59,839 INFO L264 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 19:34:59,840 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:34:59,843 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:59,843 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:34:59,897 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:59,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [345274731] [2019-12-07 19:34:59,898 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 19:34:59,898 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:34:59,899 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 19:34:59,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:34:59,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-12-07 19:34:59,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763053238] [2019-12-07 19:34:59,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 19:34:59,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:59,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 19:34:59,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-12-07 19:34:59,901 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 16 states. [2019-12-07 19:35:00,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:35:00,015 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-12-07 19:35:00,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 19:35:00,015 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2019-12-07 19:35:00,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:35:00,016 INFO L225 Difference]: With dead ends: 61 [2019-12-07 19:35:00,016 INFO L226 Difference]: Without dead ends: 60 [2019-12-07 19:35:00,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2019-12-07 19:35:00,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-12-07 19:35:00,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-12-07 19:35:00,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 19:35:00,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-12-07 19:35:00,021 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 20 [2019-12-07 19:35:00,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:35:00,021 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-12-07 19:35:00,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 19:35:00,021 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-12-07 19:35:00,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 19:35:00,022 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:35:00,022 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:35:00,222 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:35:00,223 INFO L410 AbstractCegarLoop]: === Iteration 12 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:35:00,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:35:00,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1009095738, now seen corresponding path program 1 times [2019-12-07 19:35:00,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:35:00,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87560167] [2019-12-07 19:35:00,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:35:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:00,410 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:35:00,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87560167] [2019-12-07 19:35:00,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788763623] [2019-12-07 19:35:00,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_196c0cb3-5862-41fa-9f1a-b0ca785a710b/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:35:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:00,441 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 19:35:00,443 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:35:00,451 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:35:00,451 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:35:00,564 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:35:00,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1352666417] [2019-12-07 19:35:00,565 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 19:35:00,565 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:35:00,566 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 19:35:00,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:35:00,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-12-07 19:35:00,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101130561] [2019-12-07 19:35:00,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 19:35:00,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:35:00,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 19:35:00,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2019-12-07 19:35:00,567 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 24 states. [2019-12-07 19:35:00,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:35:00,923 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2019-12-07 19:35:00,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 19:35:00,923 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2019-12-07 19:35:00,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:35:00,924 INFO L225 Difference]: With dead ends: 105 [2019-12-07 19:35:00,924 INFO L226 Difference]: Without dead ends: 104 [2019-12-07 19:35:00,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=513, Invalid=2037, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 19:35:00,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-12-07 19:35:00,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2019-12-07 19:35:00,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-12-07 19:35:00,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2019-12-07 19:35:00,935 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 32 [2019-12-07 19:35:00,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:35:00,935 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2019-12-07 19:35:00,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 19:35:00,935 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2019-12-07 19:35:00,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 19:35:00,936 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:35:00,936 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1] [2019-12-07 19:35:01,137 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:35:01,138 INFO L410 AbstractCegarLoop]: === Iteration 13 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:35:01,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:35:01,139 INFO L82 PathProgramCache]: Analyzing trace with hash 123200235, now seen corresponding path program 3 times [2019-12-07 19:35:01,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:35:01,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383989065] [2019-12-07 19:35:01,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:35:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:01,269 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:35:01,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383989065] [2019-12-07 19:35:01,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584468513] [2019-12-07 19:35:01,270 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_196c0cb3-5862-41fa-9f1a-b0ca785a710b/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:35:01,295 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 19:35:01,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 19:35:01,296 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 19:35:01,297 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:35:01,368 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 10 proven. 82 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 19:35:01,369 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:35:01,607 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:35:01,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [776681271] [2019-12-07 19:35:01,608 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 19:35:01,608 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:35:01,608 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 19:35:01,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:35:01,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 16] total 36 [2019-12-07 19:35:01,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499396855] [2019-12-07 19:35:01,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-07 19:35:01,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:35:01,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-07 19:35:01,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1139, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 19:35:01,609 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 37 states. [2019-12-07 19:35:01,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:35:01,765 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2019-12-07 19:35:01,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 19:35:01,765 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 44 [2019-12-07 19:35:01,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:35:01,766 INFO L225 Difference]: With dead ends: 121 [2019-12-07 19:35:01,766 INFO L226 Difference]: Without dead ends: 120 [2019-12-07 19:35:01,767 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=335, Invalid=1645, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 19:35:01,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-12-07 19:35:01,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-12-07 19:35:01,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-12-07 19:35:01,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2019-12-07 19:35:01,778 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 44 [2019-12-07 19:35:01,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:35:01,778 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2019-12-07 19:35:01,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-07 19:35:01,779 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2019-12-07 19:35:01,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 19:35:01,780 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:35:01,780 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:35:01,981 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:35:01,982 INFO L410 AbstractCegarLoop]: === Iteration 14 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:35:01,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:35:01,983 INFO L82 PathProgramCache]: Analyzing trace with hash 659102776, now seen corresponding path program 2 times [2019-12-07 19:35:01,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:35:01,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526961383] [2019-12-07 19:35:01,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:35:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:02,192 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:35:02,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526961383] [2019-12-07 19:35:02,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686434912] [2019-12-07 19:35:02,193 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_196c0cb3-5862-41fa-9f1a-b0ca785a710b/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:35:02,220 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-12-07 19:35:02,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 19:35:02,221 INFO L264 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 19:35:02,223 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:35:02,269 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 1 proven. 232 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:35:02,269 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:35:02,600 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:35:02,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [529513676] [2019-12-07 19:35:02,601 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 19:35:02,602 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:35:02,602 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 19:35:02,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:35:02,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 22] total 46 [2019-12-07 19:35:02,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109781594] [2019-12-07 19:35:02,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-12-07 19:35:02,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:35:02,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-12-07 19:35:02,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1850, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 19:35:02,604 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 47 states. [2019-12-07 19:35:02,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:35:02,784 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2019-12-07 19:35:02,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 19:35:02,784 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 62 [2019-12-07 19:35:02,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:35:02,785 INFO L225 Difference]: With dead ends: 119 [2019-12-07 19:35:02,785 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 19:35:02,787 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=742, Invalid=2680, Unknown=0, NotChecked=0, Total=3422 [2019-12-07 19:35:02,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 19:35:02,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 19:35:02,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 19:35:02,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 19:35:02,788 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2019-12-07 19:35:02,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:35:02,788 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 19:35:02,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-12-07 19:35:02,788 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 19:35:02,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 19:35:02,989 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:35:02,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 19:35:03,389 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 27 [2019-12-07 19:35:03,719 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 26 [2019-12-07 19:35:03,721 INFO L246 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2019-12-07 19:35:03,721 INFO L246 CegarLoopResult]: For program point fFINAL(lines 13 23) no Hoare annotation was computed. [2019-12-07 19:35:03,721 INFO L246 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-12-07 19:35:03,721 INFO L246 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2019-12-07 19:35:03,721 INFO L242 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (or (and (not (= 0 f_~y)) (<= f_~x 2147483648) (<= 0 f_~x) (not (= 0 f_~x)) (<= f_~y 2147483647) (<= 0 f_~y)) (not (<= 0 |f_#in~y|)) (not (<= |f_#in~y| 2147483647)) (not (<= 0 |f_#in~x|)) (not (<= |f_#in~x| 2147483647))) [2019-12-07 19:35:03,721 INFO L246 CegarLoopResult]: For program point L17(lines 17 21) no Hoare annotation was computed. [2019-12-07 19:35:03,721 INFO L246 CegarLoopResult]: For program point L18-1(line 18) no Hoare annotation was computed. [2019-12-07 19:35:03,721 INFO L246 CegarLoopResult]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-12-07 19:35:03,721 INFO L242 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: (let ((.cse0 (not (<= 0 |f_#in~y|))) (.cse1 (not (<= |f_#in~y| 2147483647))) (.cse2 (not (<= 0 |f_#in~x|))) (.cse3 (not (<= |f_#in~x| 2147483647)))) (and (or (= |f_#in~x| 0) .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 (and (not (= 0 f_~y)) (<= 0 f_~x) (<= f_~x 2147483647) (<= f_~y 2147483647) (<= 0 f_~y)) .cse2 .cse3))) [2019-12-07 19:35:03,721 INFO L246 CegarLoopResult]: For program point L18-3(line 18) no Hoare annotation was computed. [2019-12-07 19:35:03,721 INFO L246 CegarLoopResult]: For program point L14(lines 14 22) no Hoare annotation was computed. [2019-12-07 19:35:03,722 INFO L246 CegarLoopResult]: For program point fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-12-07 19:35:03,722 INFO L246 CegarLoopResult]: For program point fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-12-07 19:35:03,722 INFO L246 CegarLoopResult]: For program point fEXIT(lines 13 23) no Hoare annotation was computed. [2019-12-07 19:35:03,722 INFO L249 CegarLoopResult]: At program point fENTRY(lines 13 23) the Hoare annotation is: true [2019-12-07 19:35:03,722 INFO L246 CegarLoopResult]: For program point fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2019-12-07 19:35:03,722 INFO L246 CegarLoopResult]: For program point fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-12-07 19:35:03,722 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 19:35:03,722 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 19:35:03,722 INFO L242 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 2147483647) (<= ULTIMATE.start_main_~y~0 2147483647) (<= 0 ULTIMATE.start_main_~x~0) (<= 0 ULTIMATE.start_main_~y~0)) [2019-12-07 19:35:03,722 INFO L246 CegarLoopResult]: For program point L28(lines 28 30) no Hoare annotation was computed. [2019-12-07 19:35:03,722 INFO L246 CegarLoopResult]: For program point L29-1(line 29) no Hoare annotation was computed. [2019-12-07 19:35:03,722 INFO L242 CegarLoopResult]: At program point L28-2(lines 28 30) the Hoare annotation is: (<= ULTIMATE.start_main_~y~0 2147483647) [2019-12-07 19:35:03,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:35:03 BoogieIcfgContainer [2019-12-07 19:35:03,736 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:35:03,736 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:35:03,737 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:35:03,737 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:35:03,737 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:34:57" (3/4) ... [2019-12-07 19:35:03,739 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 19:35:03,743 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-12-07 19:35:03,747 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-12-07 19:35:03,747 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 19:35:03,747 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 19:35:03,783 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_196c0cb3-5862-41fa-9f1a-b0ca785a710b/bin/utaipan/witness.graphml [2019-12-07 19:35:03,784 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:35:03,785 INFO L168 Benchmark]: Toolchain (without parser) took 7084.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 948.9 MB in the beginning and 1.2 GB in the end (delta: -203.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:35:03,785 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:35:03,785 INFO L168 Benchmark]: CACSL2BoogieTranslator took 184.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.1 MB). Free memory was 948.9 MB in the beginning and 1.1 GB in the end (delta: -135.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-12-07 19:35:03,786 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.00 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 19:35:03,786 INFO L168 Benchmark]: Boogie Preprocessor took 10.43 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 19:35:03,786 INFO L168 Benchmark]: RCFGBuilder took 153.11 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: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-12-07 19:35:03,786 INFO L168 Benchmark]: TraceAbstraction took 6666.50 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -89.1 MB). Peak memory consumption was 289.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:35:03,787 INFO L168 Benchmark]: Witness Printer took 47.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:35:03,788 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 184.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.1 MB). Free memory was 948.9 MB in the beginning and 1.1 GB in the end (delta: -135.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.00 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.43 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 153.11 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: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6666.50 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -89.1 MB). Peak memory consumption was 289.4 MB. Max. memory is 11.5 GB. * Witness Printer took 47.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: 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 4 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: y <= 2147483647 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 4 error locations. Result: SAFE, OverallTime: 5.8s, OverallIterations: 14, TraceHistogramMax: 10, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, HoareTripleCheckerStatistics: 183 SDtfs, 664 SDslu, 541 SDs, 0 SdLazy, 1066 SolverSat, 91 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 633 GetRequests, 354 SyntacticMatches, 7 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2316 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=13, 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, 14 MinimizatonAttempts, 78 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 65 PreInvPairs, 65 NumberOfFragments, 110 HoareAnnotationTreeSize, 65 FomulaSimplifications, 62766 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 5 FomulaSimplificationsInter, 12092 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 495 NumberOfCodeBlocks, 495 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 689 ConstructedInterpolants, 0 QuantifiedInterpolants, 104663 SizeOfPredicates, 42 NumberOfNonLiveVariables, 602 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 32 InterpolantComputations, 9 PerfectInterpolantSequences, 62/1311 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...