./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/sum_10x0-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a13a447d-afcd-4001-90ac-99b652a87109/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a13a447d-afcd-4001-90ac-99b652a87109/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a13a447d-afcd-4001-90ac-99b652a87109/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a13a447d-afcd-4001-90ac-99b652a87109/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/sum_10x0-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a13a447d-afcd-4001-90ac-99b652a87109/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a13a447d-afcd-4001-90ac-99b652a87109/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b1d9bbb15ebabc8fa7bed11dd5ef1fc8e11e37bc .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 16:15:53,046 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:15:53,047 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:15:53,055 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:15:53,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:15:53,056 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:15:53,057 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:15:53,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:15:53,059 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:15:53,060 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:15:53,060 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:15:53,061 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:15:53,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:15:53,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:15:53,063 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:15:53,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:15:53,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:15:53,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:15:53,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:15:53,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:15:53,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:15:53,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:15:53,070 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:15:53,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:15:53,072 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:15:53,072 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:15:53,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:15:53,073 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:15:53,073 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:15:53,074 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:15:53,074 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:15:53,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:15:53,075 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:15:53,076 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:15:53,076 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:15:53,077 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:15:53,077 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:15:53,077 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:15:53,077 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:15:53,078 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:15:53,079 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:15:53,079 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a13a447d-afcd-4001-90ac-99b652a87109/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 16:15:53,090 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:15:53,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:15:53,090 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 16:15:53,091 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 16:15:53,091 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 16:15:53,091 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 16:15:53,091 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 16:15:53,091 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 16:15:53,091 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 16:15:53,091 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 16:15:53,092 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 16:15:53,092 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 16:15:53,092 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 16:15:53,092 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 16:15:53,092 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 16:15:53,092 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:15:53,093 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:15:53,093 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:15:53,093 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:15:53,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:15:53,093 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:15:53,093 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:15:53,093 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:15:53,093 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:15:53,094 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:15:53,094 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:15:53,094 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:15:53,094 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:15:53,094 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:15:53,094 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:15:53,094 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:15:53,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:15:53,094 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:15:53,094 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:15:53,095 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:15:53,095 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 16:15:53,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:15:53,095 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:15:53,095 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:15:53,095 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:15:53,095 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_a13a447d-afcd-4001-90ac-99b652a87109/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 ! call(__VERIFIER_error())) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b1d9bbb15ebabc8fa7bed11dd5ef1fc8e11e37bc [2019-12-07 16:15:53,193 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:15:53,200 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:15:53,203 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:15:53,204 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:15:53,204 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:15:53,204 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a13a447d-afcd-4001-90ac-99b652a87109/bin/utaipan/../../sv-benchmarks/c/recursive-simple/sum_10x0-1.c [2019-12-07 16:15:53,243 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a13a447d-afcd-4001-90ac-99b652a87109/bin/utaipan/data/b3541f049/29b03c7e083a4a4fbe16d92b015c3132/FLAG6466b07a3 [2019-12-07 16:15:53,644 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:15:53,644 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a13a447d-afcd-4001-90ac-99b652a87109/sv-benchmarks/c/recursive-simple/sum_10x0-1.c [2019-12-07 16:15:53,647 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a13a447d-afcd-4001-90ac-99b652a87109/bin/utaipan/data/b3541f049/29b03c7e083a4a4fbe16d92b015c3132/FLAG6466b07a3 [2019-12-07 16:15:53,656 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a13a447d-afcd-4001-90ac-99b652a87109/bin/utaipan/data/b3541f049/29b03c7e083a4a4fbe16d92b015c3132 [2019-12-07 16:15:53,658 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:15:53,659 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:15:53,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:15:53,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:15:53,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:15:53,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:15:53" (1/1) ... [2019-12-07 16:15:53,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@621e05d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:15:53, skipping insertion in model container [2019-12-07 16:15:53,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:15:53" (1/1) ... [2019-12-07 16:15:53,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:15:53,678 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:15:53,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:15:53,774 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:15:53,820 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:15:53,829 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:15:53,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:15:53 WrapperNode [2019-12-07 16:15:53,829 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:15:53,830 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:15:53,830 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:15:53,830 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:15:53,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:15:53" (1/1) ... [2019-12-07 16:15:53,839 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:15:53" (1/1) ... [2019-12-07 16:15:53,850 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:15:53,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:15:53,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:15:53,851 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:15:53,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:15:53" (1/1) ... [2019-12-07 16:15:53,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:15:53" (1/1) ... [2019-12-07 16:15:53,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:15:53" (1/1) ... [2019-12-07 16:15:53,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:15:53" (1/1) ... [2019-12-07 16:15:53,859 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:15:53" (1/1) ... [2019-12-07 16:15:53,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:15:53" (1/1) ... [2019-12-07 16:15:53,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:15:53" (1/1) ... [2019-12-07 16:15:53,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:15:53,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:15:53,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:15:53,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:15:53,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:15:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a13a447d-afcd-4001-90ac-99b652a87109/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:15:53,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:15:53,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:15:53,904 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2019-12-07 16:15:53,904 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2019-12-07 16:15:54,000 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:15:54,000 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 16:15:54,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:15:54 BoogieIcfgContainer [2019-12-07 16:15:54,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:15:54,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:15:54,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:15:54,003 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:15:54,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:15:53" (1/3) ... [2019-12-07 16:15:54,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d7c3ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:15:54, skipping insertion in model container [2019-12-07 16:15:54,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:15:53" (2/3) ... [2019-12-07 16:15:54,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d7c3ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:15:54, skipping insertion in model container [2019-12-07 16:15:54,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:15:54" (3/3) ... [2019-12-07 16:15:54,006 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_10x0-1.c [2019-12-07 16:15:54,012 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:15:54,016 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 16:15:54,023 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 16:15:54,037 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:15:54,037 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:15:54,037 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:15:54,038 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:15:54,038 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:15:54,038 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:15:54,038 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:15:54,038 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:15:54,048 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2019-12-07 16:15:54,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 16:15:54,051 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:15:54,052 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:15:54,052 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:15:54,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:15:54,056 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2019-12-07 16:15:54,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:15:54,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356400904] [2019-12-07 16:15:54,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:15:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:15:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:15:54,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356400904] [2019-12-07 16:15:54,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:15:54,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:15:54,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425873197] [2019-12-07 16:15:54,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:15:54,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:15:54,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:15:54,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:15:54,181 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 5 states. [2019-12-07 16:15:54,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:15:54,230 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-12-07 16:15:54,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:15:54,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 16:15:54,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:15:54,237 INFO L225 Difference]: With dead ends: 22 [2019-12-07 16:15:54,237 INFO L226 Difference]: Without dead ends: 14 [2019-12-07 16:15:54,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:15:54,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-12-07 16:15:54,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-12-07 16:15:54,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-12-07 16:15:54,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-12-07 16:15:54,274 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-12-07 16:15:54,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:15:54,275 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-12-07 16:15:54,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:15:54,275 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-12-07 16:15:54,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 16:15:54,276 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:15:54,276 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:15:54,276 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:15:54,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:15:54,276 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2019-12-07 16:15:54,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:15:54,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903567878] [2019-12-07 16:15:54,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:15:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:15:54,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 16:15:54,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903567878] [2019-12-07 16:15:54,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269084537] [2019-12-07 16:15:54,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a13a447d-afcd-4001-90ac-99b652a87109/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:15:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:15:54,360 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 16:15:54,363 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:15:54,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 16:15:54,388 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:15:54,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:15:54,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 16:15:54,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1030371078] [2019-12-07 16:15:54,511 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:15:54,512 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:15:54,516 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 16:15:54,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:15:54,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2019-12-07 16:15:54,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761012995] [2019-12-07 16:15:54,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 16:15:54,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:15:54,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 16:15:54,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:15:54,518 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 9 states. [2019-12-07 16:15:54,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:15:54,561 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-12-07 16:15:54,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:15:54,562 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-07 16:15:54,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:15:54,563 INFO L225 Difference]: With dead ends: 21 [2019-12-07 16:15:54,563 INFO L226 Difference]: Without dead ends: 17 [2019-12-07 16:15:54,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:15:54,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-12-07 16:15:54,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-12-07 16:15:54,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 16:15:54,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-12-07 16:15:54,568 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-12-07 16:15:54,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:15:54,569 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-12-07 16:15:54,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 16:15:54,569 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-12-07 16:15:54,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 16:15:54,570 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:15:54,570 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:15:54,770 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:15:54,771 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:15:54,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:15:54,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2019-12-07 16:15:54,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:15:54,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516394113] [2019-12-07 16:15:54,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:15:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:15:54,864 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 16:15:54,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516394113] [2019-12-07 16:15:54,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921837405] [2019-12-07 16:15:54,864 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a13a447d-afcd-4001-90ac-99b652a87109/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:15:54,893 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 16:15:54,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:15:54,894 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 16:15:54,896 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:15:54,906 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 16:15:54,906 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:15:55,094 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 16:15:55,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [874395331] [2019-12-07 16:15:55,096 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:15:55,096 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:15:55,096 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 16:15:55,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:15:55,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2019-12-07 16:15:55,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285898719] [2019-12-07 16:15:55,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 16:15:55,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:15:55,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 16:15:55,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:15:55,098 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 11 states. [2019-12-07 16:15:55,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:15:55,148 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-12-07 16:15:55,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:15:55,148 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-07 16:15:55,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:15:55,149 INFO L225 Difference]: With dead ends: 24 [2019-12-07 16:15:55,149 INFO L226 Difference]: Without dead ends: 20 [2019-12-07 16:15:55,149 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-12-07 16:15:55,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-12-07 16:15:55,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-12-07 16:15:55,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 16:15:55,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-12-07 16:15:55,153 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2019-12-07 16:15:55,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:15:55,153 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-12-07 16:15:55,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 16:15:55,153 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-12-07 16:15:55,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 16:15:55,154 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:15:55,154 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:15:55,355 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:15:55,355 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:15:55,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:15:55,356 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2019-12-07 16:15:55,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:15:55,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943461452] [2019-12-07 16:15:55,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:15:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:15:55,470 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 16:15:55,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943461452] [2019-12-07 16:15:55,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626142680] [2019-12-07 16:15:55,471 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a13a447d-afcd-4001-90ac-99b652a87109/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:15:55,520 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 16:15:55,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:15:55,522 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 16:15:55,525 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:15:55,542 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 16:15:55,542 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:15:56,033 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 16:15:56,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [270765012] [2019-12-07 16:15:56,034 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:15:56,034 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:15:56,035 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 16:15:56,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:15:56,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2019-12-07 16:15:56,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753124604] [2019-12-07 16:15:56,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 16:15:56,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:15:56,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 16:15:56,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:15:56,037 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 13 states. [2019-12-07 16:15:56,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:15:56,098 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-12-07 16:15:56,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 16:15:56,099 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2019-12-07 16:15:56,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:15:56,099 INFO L225 Difference]: With dead ends: 27 [2019-12-07 16:15:56,100 INFO L226 Difference]: Without dead ends: 23 [2019-12-07 16:15:56,100 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-12-07 16:15:56,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-12-07 16:15:56,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-12-07 16:15:56,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 16:15:56,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-12-07 16:15:56,105 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2019-12-07 16:15:56,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:15:56,105 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-12-07 16:15:56,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 16:15:56,105 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-12-07 16:15:56,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 16:15:56,106 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:15:56,107 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:15:56,307 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:15:56,307 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:15:56,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:15:56,308 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2019-12-07 16:15:56,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:15:56,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420393417] [2019-12-07 16:15:56,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:15:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:15:56,396 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 16:15:56,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420393417] [2019-12-07 16:15:56,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317796321] [2019-12-07 16:15:56,396 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a13a447d-afcd-4001-90ac-99b652a87109/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:15:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:15:56,425 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 16:15:56,426 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:15:56,436 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 16:15:56,436 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:15:56,886 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 16:15:56,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1065160103] [2019-12-07 16:15:56,888 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:15:56,888 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:15:56,888 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 16:15:56,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:15:56,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 15 [2019-12-07 16:15:56,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923089476] [2019-12-07 16:15:56,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 16:15:56,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:15:56,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 16:15:56,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-07 16:15:56,890 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 15 states. [2019-12-07 16:15:56,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:15:56,951 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-12-07 16:15:56,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 16:15:56,951 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2019-12-07 16:15:56,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:15:56,952 INFO L225 Difference]: With dead ends: 30 [2019-12-07 16:15:56,952 INFO L226 Difference]: Without dead ends: 26 [2019-12-07 16:15:56,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 54 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2019-12-07 16:15:56,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-07 16:15:56,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-12-07 16:15:56,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 16:15:56,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-12-07 16:15:56,956 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2019-12-07 16:15:56,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:15:56,956 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-12-07 16:15:56,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 16:15:56,956 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-12-07 16:15:56,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 16:15:56,957 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:15:56,957 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:15:57,158 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:15:57,159 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:15:57,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:15:57,159 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2019-12-07 16:15:57,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:15:57,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284860712] [2019-12-07 16:15:57,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:15:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:15:57,316 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-12-07 16:15:57,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284860712] [2019-12-07 16:15:57,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087641363] [2019-12-07 16:15:57,317 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a13a447d-afcd-4001-90ac-99b652a87109/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:15:57,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-07 16:15:57,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:15:57,384 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 16:15:57,388 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:15:57,404 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-12-07 16:15:57,404 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:15:58,194 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 16:15:58,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [90482222] [2019-12-07 16:15:58,195 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:15:58,195 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:15:58,195 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 16:15:58,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:15:58,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2019-12-07 16:15:58,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090787430] [2019-12-07 16:15:58,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 16:15:58,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:15:58,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 16:15:58,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-12-07 16:15:58,197 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 17 states. [2019-12-07 16:15:58,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:15:58,270 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-12-07 16:15:58,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 16:15:58,270 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2019-12-07 16:15:58,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:15:58,271 INFO L225 Difference]: With dead ends: 33 [2019-12-07 16:15:58,271 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 16:15:58,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 64 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2019-12-07 16:15:58,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 16:15:58,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-12-07 16:15:58,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 16:15:58,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-12-07 16:15:58,277 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2019-12-07 16:15:58,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:15:58,278 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-12-07 16:15:58,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 16:15:58,278 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-12-07 16:15:58,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 16:15:58,279 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:15:58,279 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:15:58,480 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:15:58,480 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:15:58,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:15:58,481 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2019-12-07 16:15:58,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:15:58,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517348131] [2019-12-07 16:15:58,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:15:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:15:58,570 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-12-07 16:15:58,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517348131] [2019-12-07 16:15:58,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375488151] [2019-12-07 16:15:58,570 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a13a447d-afcd-4001-90ac-99b652a87109/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:15:58,606 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 16:15:58,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:15:58,607 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 16:15:58,609 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:15:58,617 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-12-07 16:15:58,617 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:15:59,936 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 16:15:59,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1280018299] [2019-12-07 16:15:59,938 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:15:59,938 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:15:59,938 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 16:15:59,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:15:59,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2019-12-07 16:15:59,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481850261] [2019-12-07 16:15:59,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 16:15:59,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:15:59,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 16:15:59,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-12-07 16:15:59,939 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 19 states. [2019-12-07 16:16:00,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:16:00,033 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-12-07 16:16:00,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 16:16:00,033 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2019-12-07 16:16:00,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:16:00,034 INFO L225 Difference]: With dead ends: 36 [2019-12-07 16:16:00,034 INFO L226 Difference]: Without dead ends: 32 [2019-12-07 16:16:00,035 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 74 SyntacticMatches, 14 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2019-12-07 16:16:00,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-07 16:16:00,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-12-07 16:16:00,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 16:16:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-12-07 16:16:00,039 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2019-12-07 16:16:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:16:00,039 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-12-07 16:16:00,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 16:16:00,039 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-12-07 16:16:00,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 16:16:00,040 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:16:00,040 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:16:00,241 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:16:00,241 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:16:00,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:16:00,242 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2019-12-07 16:16:00,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:16:00,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464735870] [2019-12-07 16:16:00,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:16:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:16:00,338 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-12-07 16:16:00,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464735870] [2019-12-07 16:16:00,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343490468] [2019-12-07 16:16:00,338 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a13a447d-afcd-4001-90ac-99b652a87109/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:16:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:16:00,398 INFO L264 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 16:16:00,400 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:16:00,411 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-12-07 16:16:00,412 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:16:02,011 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 16:16:02,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2103411840] [2019-12-07 16:16:02,012 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:16:02,013 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:16:02,013 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 16:16:02,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:16:02,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 21 [2019-12-07 16:16:02,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141505792] [2019-12-07 16:16:02,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 16:16:02,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:16:02,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 16:16:02,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-12-07 16:16:02,014 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 21 states. [2019-12-07 16:16:02,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:16:02,105 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-12-07 16:16:02,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 16:16:02,106 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2019-12-07 16:16:02,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:16:02,107 INFO L225 Difference]: With dead ends: 39 [2019-12-07 16:16:02,107 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 16:16:02,107 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 84 SyntacticMatches, 16 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2019-12-07 16:16:02,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 16:16:02,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-12-07 16:16:02,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 16:16:02,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-12-07 16:16:02,111 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2019-12-07 16:16:02,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:16:02,111 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-12-07 16:16:02,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 16:16:02,111 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-12-07 16:16:02,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 16:16:02,112 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:16:02,112 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:16:02,312 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:16:02,313 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:16:02,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:16:02,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2019-12-07 16:16:02,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:16:02,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958966835] [2019-12-07 16:16:02,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:16:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:16:02,412 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 16:16:02,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958966835] [2019-12-07 16:16:02,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931767075] [2019-12-07 16:16:02,413 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a13a447d-afcd-4001-90ac-99b652a87109/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:16:02,484 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-12-07 16:16:02,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:16:02,485 INFO L264 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 16:16:02,487 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:16:02,497 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 16:16:02,497 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:16:04,705 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 16:16:04,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1867691836] [2019-12-07 16:16:04,706 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:16:04,706 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:16:04,706 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 16:16:04,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:16:04,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 23 [2019-12-07 16:16:04,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70537499] [2019-12-07 16:16:04,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 16:16:04,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:16:04,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 16:16:04,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-12-07 16:16:04,708 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 23 states. [2019-12-07 16:16:04,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:16:04,806 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-12-07 16:16:04,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 16:16:04,807 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2019-12-07 16:16:04,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:16:04,808 INFO L225 Difference]: With dead ends: 42 [2019-12-07 16:16:04,808 INFO L226 Difference]: Without dead ends: 38 [2019-12-07 16:16:04,808 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 94 SyntacticMatches, 18 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=323, Invalid=669, Unknown=0, NotChecked=0, Total=992 [2019-12-07 16:16:04,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-07 16:16:04,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-12-07 16:16:04,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 16:16:04,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-12-07 16:16:04,812 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2019-12-07 16:16:04,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:16:04,812 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-12-07 16:16:04,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 16:16:04,812 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-12-07 16:16:04,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 16:16:04,813 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:16:04,813 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:16:05,013 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:16:05,014 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:16:05,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:16:05,014 INFO L82 PathProgramCache]: Analyzing trace with hash -2055304301, now seen corresponding path program 9 times [2019-12-07 16:16:05,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:16:05,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074538608] [2019-12-07 16:16:05,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:16:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:16:05,115 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-12-07 16:16:05,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074538608] [2019-12-07 16:16:05,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249321339] [2019-12-07 16:16:05,116 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a13a447d-afcd-4001-90ac-99b652a87109/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:16:05,199 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 16:16:05,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:16:05,200 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 16:16:05,201 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:16:05,211 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-12-07 16:16:05,211 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:16:08,206 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 16:16:08,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [950259431] [2019-12-07 16:16:08,207 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:16:08,208 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:16:08,208 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 16:16:08,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:16:08,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 24 [2019-12-07 16:16:08,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043569366] [2019-12-07 16:16:08,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 16:16:08,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:16:08,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 16:16:08,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-12-07 16:16:08,209 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 24 states. [2019-12-07 16:16:08,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:16:08,343 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-12-07 16:16:08,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 16:16:08,343 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 63 [2019-12-07 16:16:08,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:16:08,344 INFO L225 Difference]: With dead ends: 45 [2019-12-07 16:16:08,344 INFO L226 Difference]: Without dead ends: 41 [2019-12-07 16:16:08,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 104 SyntacticMatches, 21 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=385, Invalid=737, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 16:16:08,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-07 16:16:08,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-12-07 16:16:08,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 16:16:08,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-12-07 16:16:08,349 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2019-12-07 16:16:08,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:16:08,349 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-12-07 16:16:08,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 16:16:08,349 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-12-07 16:16:08,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 16:16:08,350 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:16:08,350 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:16:08,550 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:16:08,551 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:16:08,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:16:08,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1172322647, now seen corresponding path program 10 times [2019-12-07 16:16:08,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:16:08,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520148845] [2019-12-07 16:16:08,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:16:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:16:09,022 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 135 proven. 39 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 16:16:09,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520148845] [2019-12-07 16:16:09,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389237723] [2019-12-07 16:16:09,023 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a13a447d-afcd-4001-90ac-99b652a87109/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:16:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:16:09,149 WARN L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 117 conjunts are in the unsatisfiable core [2019-12-07 16:16:09,150 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:16:09,292 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 154 proven. 20 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 16:16:09,293 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:16:15,638 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 135 proven. 120 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-12-07 16:16:15,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [902766484] [2019-12-07 16:16:15,639 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:16:15,639 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:16:15,639 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 16:16:15,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:16:15,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 38] total 65 [2019-12-07 16:16:15,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695567823] [2019-12-07 16:16:15,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-12-07 16:16:15,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:16:15,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-12-07 16:16:15,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=868, Invalid=3292, Unknown=0, NotChecked=0, Total=4160 [2019-12-07 16:16:15,642 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 65 states. [2019-12-07 16:16:16,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:16:16,389 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-12-07 16:16:16,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 16:16:16,389 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 69 [2019-12-07 16:16:16,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:16:16,390 INFO L225 Difference]: With dead ends: 42 [2019-12-07 16:16:16,390 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 16:16:16,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 105 SyntacticMatches, 6 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1896 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1764, Invalid=5892, Unknown=0, NotChecked=0, Total=7656 [2019-12-07 16:16:16,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 16:16:16,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 16:16:16,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 16:16:16,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 16:16:16,392 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2019-12-07 16:16:16,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:16:16,393 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 16:16:16,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-12-07 16:16:16,393 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 16:16:16,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 16:16:16,593 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:16:16,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 16:16:16,635 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 16:16:16,635 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 16:16:16,636 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2019-12-07 16:16:16,636 INFO L246 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2019-12-07 16:16:16,636 INFO L246 CegarLoopResult]: For program point L15(lines 15 17) no Hoare annotation was computed. [2019-12-07 16:16:16,636 INFO L242 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (and (<= 10 ULTIMATE.start_main_~a~0) (<= ULTIMATE.start_main_~a~0 10)) [2019-12-07 16:16:16,637 INFO L246 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-12-07 16:16:16,637 INFO L246 CegarLoopResult]: For program point L11(lines 11 18) no Hoare annotation was computed. [2019-12-07 16:16:16,637 INFO L246 CegarLoopResult]: For program point sumEXIT(lines 3 9) no Hoare annotation was computed. [2019-12-07 16:16:16,637 INFO L242 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: (and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (< 0 sum_~n)) [2019-12-07 16:16:16,638 INFO L246 CegarLoopResult]: For program point L7-1(line 7) no Hoare annotation was computed. [2019-12-07 16:16:16,638 INFO L246 CegarLoopResult]: For program point L4(lines 4 8) no Hoare annotation was computed. [2019-12-07 16:16:16,638 INFO L246 CegarLoopResult]: For program point sumFINAL(lines 3 9) no Hoare annotation was computed. [2019-12-07 16:16:16,638 INFO L249 CegarLoopResult]: At program point sumENTRY(lines 3 9) the Hoare annotation is: true [2019-12-07 16:16:16,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:16:16 BoogieIcfgContainer [2019-12-07 16:16:16,647 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:16:16,647 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:16:16,648 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:16:16,648 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:16:16,649 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:15:54" (3/4) ... [2019-12-07 16:16:16,652 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 16:16:16,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sum [2019-12-07 16:16:16,661 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-12-07 16:16:16,661 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 16:16:16,686 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a13a447d-afcd-4001-90ac-99b652a87109/bin/utaipan/witness.graphml [2019-12-07 16:16:16,686 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:16:16,687 INFO L168 Benchmark]: Toolchain (without parser) took 23028.41 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 330.3 MB). Free memory was 934.0 MB in the beginning and 1.2 GB in the end (delta: -296.0 MB). Peak memory consumption was 34.3 MB. Max. memory is 11.5 GB. [2019-12-07 16:16:16,688 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 951.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:16:16,688 INFO L168 Benchmark]: CACSL2BoogieTranslator took 170.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2019-12-07 16:16:16,688 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. [2019-12-07 16:16:16,688 INFO L168 Benchmark]: Boogie Preprocessor took 11.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. [2019-12-07 16:16:16,689 INFO L168 Benchmark]: RCFGBuilder took 139.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 16:16:16,689 INFO L168 Benchmark]: TraceAbstraction took 22645.46 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 227.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -150.4 MB). Peak memory consumption was 77.1 MB. Max. memory is 11.5 GB. [2019-12-07 16:16:16,689 INFO L168 Benchmark]: Witness Printer took 38.43 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2019-12-07 16:16:16,691 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 951.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 170.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 139.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22645.46 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 227.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -150.4 MB). Peak memory consumption was 77.1 MB. Max. memory is 11.5 GB. * Witness Printer took 38.43 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Result: SAFE, OverallTime: 22.5s, OverallIterations: 11, TraceHistogramMax: 11, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 96 SDtfs, 566 SDslu, 548 SDs, 0 SdLazy, 982 SolverSat, 230 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1076 GetRequests, 683 SyntacticMatches, 115 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2965 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 5 PreInvPairs, 5 NumberOfFragments, 18 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 3 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 17.8s InterpolantComputationTime, 849 NumberOfCodeBlocks, 828 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1238 ConstructedInterpolants, 0 QuantifiedInterpolants, 296692 SizeOfPredicates, 89 NumberOfNonLiveVariables, 1186 ConjunctsInSsa, 243 ConjunctsInUnsatCore, 31 InterpolantComputations, 1 PerfectInterpolantSequences, 1816/3630 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...