./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0eddfe49-1742-46e1-bf78-7de3502ce6f1/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0eddfe49-1742-46e1-bf78-7de3502ce6f1/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0eddfe49-1742-46e1-bf78-7de3502ce6f1/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0eddfe49-1742-46e1-bf78-7de3502ce6f1/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0eddfe49-1742-46e1-bf78-7de3502ce6f1/bin/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0eddfe49-1742-46e1-bf78-7de3502ce6f1/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 0837a1e1d82be1b28ccf3514392f1b01c88a9160 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_0eddfe49-1742-46e1-bf78-7de3502ce6f1/bin/utaipan/config using search string *Overflow*64bit*_Bitvector*.epf No suitable settings file found using Overflow*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: Recursive programs are not supported. --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:29:38,040 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:29:38,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:29:38,056 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:29:38,056 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:29:38,057 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:29:38,059 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:29:38,068 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:29:38,072 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:29:38,076 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:29:38,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:29:38,079 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:29:38,080 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:29:38,082 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:29:38,083 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:29:38,084 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:29:38,085 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:29:38,085 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:29:38,088 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:29:38,091 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:29:38,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:29:38,098 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:29:38,100 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:29:38,101 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:29:38,103 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:29:38,103 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:29:38,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:29:38,105 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:29:38,105 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:29:38,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:29:38,106 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:29:38,107 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:29:38,108 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:29:38,108 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:29:38,109 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:29:38,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:29:38,110 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:29:38,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:29:38,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:29:38,111 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:29:38,112 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:29:38,113 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0eddfe49-1742-46e1-bf78-7de3502ce6f1/bin/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2019-11-26 02:29:38,137 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:29:38,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:29:38,138 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:29:38,138 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:29:38,138 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:29:38,138 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:29:38,139 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:29:38,139 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:29:38,139 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:29:38,139 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:29:38,139 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:29:38,139 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:29:38,140 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:29:38,140 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:29:38,140 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:29:38,141 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:29:38,141 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 02:29:38,141 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:29:38,141 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:29:38,141 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:29:38,141 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:29:38,142 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:29:38,142 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-26 02:29:38,142 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:29:38,142 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:29:38,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:29:38,143 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:29:38,143 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:29:38,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:29:38,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:29:38,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:29:38,144 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:29:38,144 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:29:38,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:29:38,144 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:29:38,144 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:29:38,144 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_0eddfe49-1742-46e1-bf78-7de3502ce6f1/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 -> 0837a1e1d82be1b28ccf3514392f1b01c88a9160 [2019-11-26 02:29:38,302 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:29:38,313 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:29:38,316 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:29:38,318 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:29:38,318 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:29:38,319 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0eddfe49-1742-46e1-bf78-7de3502ce6f1/bin/utaipan/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2019-11-26 02:29:38,372 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0eddfe49-1742-46e1-bf78-7de3502ce6f1/bin/utaipan/data/0ff5c4066/f0babc5520db412ba9e416214b1bcd2c/FLAG8043761a1 [2019-11-26 02:29:38,752 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:29:38,753 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0eddfe49-1742-46e1-bf78-7de3502ce6f1/sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2019-11-26 02:29:38,760 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0eddfe49-1742-46e1-bf78-7de3502ce6f1/bin/utaipan/data/0ff5c4066/f0babc5520db412ba9e416214b1bcd2c/FLAG8043761a1 [2019-11-26 02:29:39,101 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0eddfe49-1742-46e1-bf78-7de3502ce6f1/bin/utaipan/data/0ff5c4066/f0babc5520db412ba9e416214b1bcd2c [2019-11-26 02:29:39,104 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:29:39,106 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:29:39,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:29:39,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:29:39,110 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:29:39,111 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:29:39" (1/1) ... [2019-11-26 02:29:39,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a3811b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:39, skipping insertion in model container [2019-11-26 02:29:39,114 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:29:39" (1/1) ... [2019-11-26 02:29:39,121 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:29:39,137 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:29:39,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:29:39,333 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:29:39,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:29:39,425 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:29:39,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:39 WrapperNode [2019-11-26 02:29:39,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:29:39,427 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:29:39,427 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:29:39,428 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:29:39,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:39" (1/1) ... [2019-11-26 02:29:39,441 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:39" (1/1) ... [2019-11-26 02:29:39,457 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:29:39,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:29:39,458 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:29:39,458 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:29:39,466 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:39" (1/1) ... [2019-11-26 02:29:39,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:39" (1/1) ... [2019-11-26 02:29:39,467 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:39" (1/1) ... [2019-11-26 02:29:39,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:39" (1/1) ... [2019-11-26 02:29:39,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:39" (1/1) ... [2019-11-26 02:29:39,471 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:39" (1/1) ... [2019-11-26 02:29:39,472 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:39" (1/1) ... [2019-11-26 02:29:39,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:29:39,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:29:39,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:29:39,474 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:29:39,475 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0eddfe49-1742-46e1-bf78-7de3502ce6f1/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-11-26 02:29:39,525 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2019-11-26 02:29:39,526 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2019-11-26 02:29:39,528 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2019-11-26 02:29:39,528 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2019-11-26 02:29:39,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:29:39,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:29:39,830 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:29:39,830 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-26 02:29:39,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:29:39 BoogieIcfgContainer [2019-11-26 02:29:39,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:29:39,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:29:39,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:29:39,835 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:29:39,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:29:39" (1/3) ... [2019-11-26 02:29:39,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd4ed00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:29:39, skipping insertion in model container [2019-11-26 02:29:39,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:39" (2/3) ... [2019-11-26 02:29:39,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd4ed00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:29:39, skipping insertion in model container [2019-11-26 02:29:39,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:29:39" (3/3) ... [2019-11-26 02:29:39,850 INFO L109 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1d.c [2019-11-26 02:29:39,860 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:29:39,866 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-11-26 02:29:39,877 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-11-26 02:29:39,901 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:29:39,901 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:29:39,901 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:29:39,901 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:29:39,901 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:29:39,901 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:29:39,902 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:29:39,902 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:29:39,922 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-11-26 02:29:39,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-26 02:29:39,927 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:29:39,928 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:29:39,928 INFO L410 AbstractCegarLoop]: === Iteration 1 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:29:39,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:29:39,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1656652383, now seen corresponding path program 1 times [2019-11-26 02:29:39,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:29:39,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959878292] [2019-11-26 02:29:39,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:29:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:40,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:29:40,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959878292] [2019-11-26 02:29:40,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:29:40,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:29:40,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264664279] [2019-11-26 02:29:40,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 02:29:40,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:29:40,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 02:29:40,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:29:40,143 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 7 states. [2019-11-26 02:29:40,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:29:40,375 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2019-11-26 02:29:40,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 02:29:40,376 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-11-26 02:29:40,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:29:40,389 INFO L225 Difference]: With dead ends: 84 [2019-11-26 02:29:40,389 INFO L226 Difference]: Without dead ends: 79 [2019-11-26 02:29:40,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-26 02:29:40,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-26 02:29:40,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 66. [2019-11-26 02:29:40,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-26 02:29:40,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2019-11-26 02:29:40,457 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 8 [2019-11-26 02:29:40,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:29:40,457 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2019-11-26 02:29:40,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 02:29:40,457 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2019-11-26 02:29:40,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 02:29:40,459 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:29:40,459 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:29:40,460 INFO L410 AbstractCegarLoop]: === Iteration 2 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:29:40,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:29:40,460 INFO L82 PathProgramCache]: Analyzing trace with hash -183383641, now seen corresponding path program 1 times [2019-11-26 02:29:40,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:29:40,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578000052] [2019-11-26 02:29:40,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:29:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:40,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:29:40,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578000052] [2019-11-26 02:29:40,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:29:40,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:29:40,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258107193] [2019-11-26 02:29:40,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:29:40,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:29:40,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:29:40,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:29:40,519 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand 3 states. [2019-11-26 02:29:40,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:29:40,546 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2019-11-26 02:29:40,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:29:40,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-26 02:29:40,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:29:40,555 INFO L225 Difference]: With dead ends: 70 [2019-11-26 02:29:40,556 INFO L226 Difference]: Without dead ends: 69 [2019-11-26 02:29:40,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:29:40,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-26 02:29:40,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2019-11-26 02:29:40,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-26 02:29:40,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2019-11-26 02:29:40,584 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 9 [2019-11-26 02:29:40,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:29:40,584 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2019-11-26 02:29:40,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:29:40,585 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2019-11-26 02:29:40,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-26 02:29:40,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:29:40,586 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:29:40,586 INFO L410 AbstractCegarLoop]: === Iteration 3 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:29:40,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:29:40,586 INFO L82 PathProgramCache]: Analyzing trace with hash -138388889, now seen corresponding path program 1 times [2019-11-26 02:29:40,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:29:40,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69725054] [2019-11-26 02:29:40,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:29:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:40,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:29:40,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69725054] [2019-11-26 02:29:40,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:29:40,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:29:40,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19618848] [2019-11-26 02:29:40,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:29:40,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:29:40,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:29:40,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:29:40,621 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand 3 states. [2019-11-26 02:29:40,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:29:40,637 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2019-11-26 02:29:40,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:29:40,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-26 02:29:40,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:29:40,639 INFO L225 Difference]: With dead ends: 65 [2019-11-26 02:29:40,639 INFO L226 Difference]: Without dead ends: 64 [2019-11-26 02:29:40,639 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:29:40,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-26 02:29:40,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-26 02:29:40,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-26 02:29:40,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2019-11-26 02:29:40,650 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 11 [2019-11-26 02:29:40,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:29:40,651 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2019-11-26 02:29:40,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:29:40,651 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2019-11-26 02:29:40,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-26 02:29:40,652 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:29:40,652 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:29:40,652 INFO L410 AbstractCegarLoop]: === Iteration 4 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:29:40,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:29:40,653 INFO L82 PathProgramCache]: Analyzing trace with hash 4911801, now seen corresponding path program 1 times [2019-11-26 02:29:40,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:29:40,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152350385] [2019-11-26 02:29:40,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:29:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:40,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:29:40,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152350385] [2019-11-26 02:29:40,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:29:40,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:29:40,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730441272] [2019-11-26 02:29:40,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:29:40,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:29:40,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:29:40,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:29:40,695 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand 4 states. [2019-11-26 02:29:40,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:29:40,717 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2019-11-26 02:29:40,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:29:40,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-26 02:29:40,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:29:40,719 INFO L225 Difference]: With dead ends: 85 [2019-11-26 02:29:40,719 INFO L226 Difference]: Without dead ends: 84 [2019-11-26 02:29:40,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:29:40,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-26 02:29:40,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2019-11-26 02:29:40,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-26 02:29:40,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 96 transitions. [2019-11-26 02:29:40,734 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 96 transitions. Word has length 12 [2019-11-26 02:29:40,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:29:40,735 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 96 transitions. [2019-11-26 02:29:40,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:29:40,735 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 96 transitions. [2019-11-26 02:29:40,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-26 02:29:40,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:29:40,736 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:29:40,736 INFO L410 AbstractCegarLoop]: === Iteration 5 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:29:40,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:29:40,737 INFO L82 PathProgramCache]: Analyzing trace with hash 2115393736, now seen corresponding path program 1 times [2019-11-26 02:29:40,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:29:40,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460843653] [2019-11-26 02:29:40,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:29:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:40,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:29:40,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460843653] [2019-11-26 02:29:40,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:29:40,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:29:40,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713119604] [2019-11-26 02:29:40,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:29:40,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:29:40,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:29:40,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:29:40,758 INFO L87 Difference]: Start difference. First operand 74 states and 96 transitions. Second operand 3 states. [2019-11-26 02:29:40,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:29:40,769 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2019-11-26 02:29:40,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:29:40,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-26 02:29:40,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:29:40,771 INFO L225 Difference]: With dead ends: 74 [2019-11-26 02:29:40,771 INFO L226 Difference]: Without dead ends: 73 [2019-11-26 02:29:40,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:29:40,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-26 02:29:40,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-11-26 02:29:40,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-26 02:29:40,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2019-11-26 02:29:40,784 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 94 transitions. Word has length 16 [2019-11-26 02:29:40,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:29:40,785 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 94 transitions. [2019-11-26 02:29:40,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:29:40,785 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2019-11-26 02:29:40,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-26 02:29:40,786 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:29:40,786 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:29:40,786 INFO L410 AbstractCegarLoop]: === Iteration 6 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:29:40,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:29:40,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1152696420, now seen corresponding path program 1 times [2019-11-26 02:29:40,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:29:40,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713974784] [2019-11-26 02:29:40,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:29:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:40,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:29:40,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713974784] [2019-11-26 02:29:40,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:29:40,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:29:40,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107461175] [2019-11-26 02:29:40,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:29:40,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:29:40,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:29:40,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:29:40,828 INFO L87 Difference]: Start difference. First operand 73 states and 94 transitions. Second operand 4 states. [2019-11-26 02:29:40,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:29:40,852 INFO L93 Difference]: Finished difference Result 94 states and 126 transitions. [2019-11-26 02:29:40,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:29:40,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-26 02:29:40,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:29:40,854 INFO L225 Difference]: With dead ends: 94 [2019-11-26 02:29:40,854 INFO L226 Difference]: Without dead ends: 93 [2019-11-26 02:29:40,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:29:40,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-26 02:29:40,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 79. [2019-11-26 02:29:40,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-26 02:29:40,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2019-11-26 02:29:40,868 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 17 [2019-11-26 02:29:40,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:29:40,868 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2019-11-26 02:29:40,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:29:40,868 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2019-11-26 02:29:40,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-26 02:29:40,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:29:40,869 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:29:40,870 INFO L410 AbstractCegarLoop]: === Iteration 7 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:29:40,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:29:40,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1079409517, now seen corresponding path program 1 times [2019-11-26 02:29:40,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:29:40,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613267303] [2019-11-26 02:29:40,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:29:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:40,962 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:29:40,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613267303] [2019-11-26 02:29:40,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972416560] [2019-11-26 02:29:40,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0eddfe49-1742-46e1-bf78-7de3502ce6f1/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-11-26 02:29:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:41,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 02:29:41,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:29:41,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:29:41,055 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:29:41,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:29:41,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:29:41,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [9] total 12 [2019-11-26 02:29:41,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441318650] [2019-11-26 02:29:41,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:29:41,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:29:41,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:29:41,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-11-26 02:29:41,125 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand 6 states. [2019-11-26 02:29:41,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:29:41,210 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2019-11-26 02:29:41,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:29:41,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-26 02:29:41,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:29:41,213 INFO L225 Difference]: With dead ends: 125 [2019-11-26 02:29:41,213 INFO L226 Difference]: Without dead ends: 75 [2019-11-26 02:29:41,214 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-26 02:29:41,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-26 02:29:41,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-11-26 02:29:41,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-26 02:29:41,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2019-11-26 02:29:41,241 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 19 [2019-11-26 02:29:41,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:29:41,242 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2019-11-26 02:29:41,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:29:41,243 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2019-11-26 02:29:41,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-26 02:29:41,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:29:41,245 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:29:41,445 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:29:41,446 INFO L410 AbstractCegarLoop]: === Iteration 8 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:29:41,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:29:41,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1643853139, now seen corresponding path program 1 times [2019-11-26 02:29:41,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:29:41,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330708449] [2019-11-26 02:29:41,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:29:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:41,491 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:29:41,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330708449] [2019-11-26 02:29:41,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:29:41,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:29:41,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322190764] [2019-11-26 02:29:41,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:29:41,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:29:41,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:29:41,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:29:41,493 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand 6 states. [2019-11-26 02:29:41,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:29:41,589 INFO L93 Difference]: Finished difference Result 149 states and 206 transitions. [2019-11-26 02:29:41,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:29:41,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-26 02:29:41,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:29:41,593 INFO L225 Difference]: With dead ends: 149 [2019-11-26 02:29:41,593 INFO L226 Difference]: Without dead ends: 91 [2019-11-26 02:29:41,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:29:41,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-26 02:29:41,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2019-11-26 02:29:41,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-26 02:29:41,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 99 transitions. [2019-11-26 02:29:41,622 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 99 transitions. Word has length 21 [2019-11-26 02:29:41,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:29:41,622 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 99 transitions. [2019-11-26 02:29:41,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:29:41,622 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2019-11-26 02:29:41,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-26 02:29:41,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:29:41,626 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:29:41,626 INFO L410 AbstractCegarLoop]: === Iteration 9 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:29:41,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:29:41,626 INFO L82 PathProgramCache]: Analyzing trace with hash 105489077, now seen corresponding path program 1 times [2019-11-26 02:29:41,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:29:41,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870636551] [2019-11-26 02:29:41,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:29:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:41,697 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-26 02:29:41,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870636551] [2019-11-26 02:29:41,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:29:41,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:29:41,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164829967] [2019-11-26 02:29:41,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:29:41,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:29:41,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:29:41,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:29:41,699 INFO L87 Difference]: Start difference. First operand 79 states and 99 transitions. Second operand 6 states. [2019-11-26 02:29:41,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:29:41,780 INFO L93 Difference]: Finished difference Result 158 states and 210 transitions. [2019-11-26 02:29:41,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:29:41,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-26 02:29:41,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:29:41,782 INFO L225 Difference]: With dead ends: 158 [2019-11-26 02:29:41,782 INFO L226 Difference]: Without dead ends: 95 [2019-11-26 02:29:41,785 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-26 02:29:41,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-26 02:29:41,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2019-11-26 02:29:41,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-26 02:29:41,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2019-11-26 02:29:41,807 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 32 [2019-11-26 02:29:41,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:29:41,807 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 108 transitions. [2019-11-26 02:29:41,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:29:41,807 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2019-11-26 02:29:41,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-26 02:29:41,808 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:29:41,809 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:29:41,809 INFO L410 AbstractCegarLoop]: === Iteration 10 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:29:41,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:29:41,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1291302577, now seen corresponding path program 1 times [2019-11-26 02:29:41,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:29:41,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154405183] [2019-11-26 02:29:41,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:29:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:41,870 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-26 02:29:41,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154405183] [2019-11-26 02:29:41,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:29:41,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:29:41,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118906813] [2019-11-26 02:29:41,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:29:41,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:29:41,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:29:41,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:29:41,872 INFO L87 Difference]: Start difference. First operand 87 states and 108 transitions. Second operand 4 states. [2019-11-26 02:29:41,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:29:41,903 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2019-11-26 02:29:41,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:29:41,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-26 02:29:41,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:29:41,906 INFO L225 Difference]: With dead ends: 94 [2019-11-26 02:29:41,906 INFO L226 Difference]: Without dead ends: 93 [2019-11-26 02:29:41,907 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:29:41,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-26 02:29:41,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-11-26 02:29:41,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-26 02:29:41,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2019-11-26 02:29:41,918 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 35 [2019-11-26 02:29:41,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:29:41,918 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2019-11-26 02:29:41,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:29:41,919 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2019-11-26 02:29:41,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-26 02:29:41,919 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:29:41,920 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:29:41,920 INFO L410 AbstractCegarLoop]: === Iteration 11 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:29:41,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:29:41,920 INFO L82 PathProgramCache]: Analyzing trace with hash -552500514, now seen corresponding path program 1 times [2019-11-26 02:29:41,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:29:41,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159541491] [2019-11-26 02:29:41,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:29:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:41,957 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-26 02:29:41,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159541491] [2019-11-26 02:29:41,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:29:41,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:29:41,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102039037] [2019-11-26 02:29:41,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:29:41,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:29:41,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:29:41,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:29:41,959 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand 3 states. [2019-11-26 02:29:41,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:29:41,974 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2019-11-26 02:29:41,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:29:41,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-26 02:29:41,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:29:41,976 INFO L225 Difference]: With dead ends: 91 [2019-11-26 02:29:41,976 INFO L226 Difference]: Without dead ends: 90 [2019-11-26 02:29:41,977 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:29:41,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-26 02:29:41,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-11-26 02:29:41,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-26 02:29:41,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2019-11-26 02:29:41,986 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 31 [2019-11-26 02:29:41,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:29:41,987 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2019-11-26 02:29:41,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:29:41,987 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2019-11-26 02:29:41,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-26 02:29:41,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:29:41,989 INFO L410 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:29:41,989 INFO L410 AbstractCegarLoop]: === Iteration 12 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:29:41,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:29:41,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1111626321, now seen corresponding path program 1 times [2019-11-26 02:29:41,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:29:41,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768926659] [2019-11-26 02:29:41,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:29:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:42,037 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-26 02:29:42,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768926659] [2019-11-26 02:29:42,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:29:42,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:29:42,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614090312] [2019-11-26 02:29:42,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:29:42,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:29:42,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:29:42,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:29:42,039 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand 6 states. [2019-11-26 02:29:42,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:29:42,082 INFO L93 Difference]: Finished difference Result 100 states and 122 transitions. [2019-11-26 02:29:42,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:29:42,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-11-26 02:29:42,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:29:42,084 INFO L225 Difference]: With dead ends: 100 [2019-11-26 02:29:42,084 INFO L226 Difference]: Without dead ends: 99 [2019-11-26 02:29:42,085 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:29:42,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-26 02:29:42,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2019-11-26 02:29:42,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-26 02:29:42,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2019-11-26 02:29:42,094 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 46 [2019-11-26 02:29:42,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:29:42,094 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2019-11-26 02:29:42,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:29:42,095 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2019-11-26 02:29:42,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-26 02:29:42,096 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:29:42,096 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:29:42,096 INFO L410 AbstractCegarLoop]: === Iteration 13 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:29:42,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:29:42,097 INFO L82 PathProgramCache]: Analyzing trace with hash 930510463, now seen corresponding path program 1 times [2019-11-26 02:29:42,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:29:42,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161498058] [2019-11-26 02:29:42,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:29:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:42,166 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-26 02:29:42,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161498058] [2019-11-26 02:29:42,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:29:42,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:29:42,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137328259] [2019-11-26 02:29:42,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:29:42,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:29:42,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:29:42,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:29:42,169 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 6 states. [2019-11-26 02:29:42,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:29:42,208 INFO L93 Difference]: Finished difference Result 89 states and 108 transitions. [2019-11-26 02:29:42,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:29:42,208 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-11-26 02:29:42,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:29:42,209 INFO L225 Difference]: With dead ends: 89 [2019-11-26 02:29:42,209 INFO L226 Difference]: Without dead ends: 88 [2019-11-26 02:29:42,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:29:42,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-26 02:29:42,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-11-26 02:29:42,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-26 02:29:42,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2019-11-26 02:29:42,223 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 36 [2019-11-26 02:29:42,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:29:42,223 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2019-11-26 02:29:42,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:29:42,223 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2019-11-26 02:29:42,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-26 02:29:42,230 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:29:42,230 INFO L410 BasicCegarLoop]: trace histogram [7, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:29:42,230 INFO L410 AbstractCegarLoop]: === Iteration 14 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:29:42,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:29:42,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1401145536, now seen corresponding path program 1 times [2019-11-26 02:29:42,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:29:42,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430503592] [2019-11-26 02:29:42,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:29:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:42,305 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-26 02:29:42,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430503592] [2019-11-26 02:29:42,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977516707] [2019-11-26 02:29:42,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0eddfe49-1742-46e1-bf78-7de3502ce6f1/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-11-26 02:29:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:42,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-26 02:29:42,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:29:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-26 02:29:42,437 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:29:42,608 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-26 02:29:42,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:29:42,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 17 [2019-11-26 02:29:42,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105439672] [2019-11-26 02:29:42,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 02:29:42,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:29:42,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 02:29:42,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-26 02:29:42,610 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand 12 states. [2019-11-26 02:29:43,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:29:43,195 INFO L93 Difference]: Finished difference Result 169 states and 210 transitions. [2019-11-26 02:29:43,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-26 02:29:43,196 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-11-26 02:29:43,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:29:43,198 INFO L225 Difference]: With dead ends: 169 [2019-11-26 02:29:43,198 INFO L226 Difference]: Without dead ends: 166 [2019-11-26 02:29:43,199 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=913, Unknown=0, NotChecked=0, Total=1122 [2019-11-26 02:29:43,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-26 02:29:43,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-11-26 02:29:43,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-26 02:29:43,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 206 transitions. [2019-11-26 02:29:43,221 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 206 transitions. Word has length 50 [2019-11-26 02:29:43,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:29:43,222 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 206 transitions. [2019-11-26 02:29:43,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 02:29:43,222 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 206 transitions. [2019-11-26 02:29:43,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-26 02:29:43,224 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:29:43,225 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:29:43,429 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:29:43,429 INFO L410 AbstractCegarLoop]: === Iteration 15 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-26 02:29:43,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:29:43,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1156205799, now seen corresponding path program 1 times [2019-11-26 02:29:43,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:29:43,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420742273] [2019-11-26 02:29:43,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:29:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:43,552 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-26 02:29:43,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420742273] [2019-11-26 02:29:43,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060361811] [2019-11-26 02:29:43,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0eddfe49-1742-46e1-bf78-7de3502ce6f1/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-11-26 02:29:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:43,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-26 02:29:43,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:29:43,604 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-26 02:29:43,604 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:29:43,723 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-26 02:29:43,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1424630852] [2019-11-26 02:29:43,746 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2019-11-26 02:29:43,747 INFO L166 IcfgInterpreter]: Building call graph [2019-11-26 02:29:43,756 FATAL L310 FreeRefinementEngine]: Exception during interpolant generation: IllegalArgumentException [2019-11-26 02:29:43,959 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:29:43,960 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an 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.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-11-26 02:29:43,964 INFO L168 Benchmark]: Toolchain (without parser) took 4858.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 950.1 MB in the beginning and 1.0 GB in the end (delta: -53.1 MB). Peak memory consumption was 97.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:29:43,965 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:29:43,965 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -198.4 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:29:43,966 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:29:43,966 INFO L168 Benchmark]: Boogie Preprocessor took 15.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:29:43,967 INFO L168 Benchmark]: RCFGBuilder took 357.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:29:43,967 INFO L168 Benchmark]: TraceAbstraction took 4130.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 118.9 MB). Peak memory consumption was 118.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:29:43,969 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 320.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -198.4 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 357.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4130.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 118.9 MB). Peak memory consumption was 118.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalArgumentException: Recursive programs are not supported. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: Recursive programs are not supported.: de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...