./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_7-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2200f2cf-eebe-40c6-a297-f608365f8d16/bin/utaipan-WLngWcDbfI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2200f2cf-eebe-40c6-a297-f608365f8d16/bin/utaipan-WLngWcDbfI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2200f2cf-eebe-40c6-a297-f608365f8d16/bin/utaipan-WLngWcDbfI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2200f2cf-eebe-40c6-a297-f608365f8d16/bin/utaipan-WLngWcDbfI/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_7-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2200f2cf-eebe-40c6-a297-f608365f8d16/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2200f2cf-eebe-40c6-a297-f608365f8d16/bin/utaipan-WLngWcDbfI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c81a149fe338374de067d63dbdea0d00d3f8a8fa ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 02:26:59,479 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 02:26:59,481 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 02:26:59,529 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 02:26:59,530 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 02:26:59,531 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 02:26:59,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 02:26:59,536 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 02:26:59,538 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 02:26:59,540 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 02:26:59,541 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 02:26:59,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 02:26:59,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 02:26:59,545 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 02:26:59,546 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 02:26:59,548 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 02:26:59,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 02:26:59,551 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 02:26:59,553 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 02:26:59,556 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 02:26:59,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 02:26:59,559 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 02:26:59,561 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 02:26:59,562 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 02:26:59,566 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 02:26:59,567 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 02:26:59,567 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 02:26:59,568 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 02:26:59,569 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 02:26:59,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 02:26:59,571 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 02:26:59,572 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 02:26:59,573 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 02:26:59,574 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 02:26:59,575 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 02:26:59,576 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 02:26:59,577 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 02:26:59,577 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 02:26:59,577 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 02:26:59,578 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 02:26:59,579 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 02:26:59,580 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2200f2cf-eebe-40c6-a297-f608365f8d16/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-11 02:26:59,606 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 02:26:59,606 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 02:26:59,607 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-11 02:26:59,607 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-11 02:26:59,607 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-11 02:26:59,607 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-11 02:26:59,607 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-11 02:26:59,607 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-11 02:26:59,608 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-11 02:26:59,608 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-11 02:26:59,608 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-11 02:26:59,608 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-11 02:26:59,608 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-11 02:26:59,609 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-11 02:26:59,609 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-11 02:26:59,610 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 02:26:59,610 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 02:26:59,610 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 02:26:59,610 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 02:26:59,611 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 02:26:59,611 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 02:26:59,611 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 02:26:59,611 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 02:26:59,611 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-11 02:26:59,612 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 02:26:59,612 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 02:26:59,612 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 02:26:59,612 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 02:26:59,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 02:26:59,613 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 02:26:59,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:26:59,618 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 02:26:59,618 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 02:26:59,618 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 02:26:59,618 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-11 02:26:59,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 02:26:59,619 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 02:26:59,619 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 02:26:59,619 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-11 02:26:59,620 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2200f2cf-eebe-40c6-a297-f608365f8d16/bin/utaipan-WLngWcDbfI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_2200f2cf-eebe-40c6-a297-f608365f8d16/bin/utaipan-WLngWcDbfI 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(reach_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 -> c81a149fe338374de067d63dbdea0d00d3f8a8fa [2021-10-11 02:26:59,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 02:26:59,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 02:26:59,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 02:26:59,981 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 02:26:59,981 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 02:26:59,982 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2200f2cf-eebe-40c6-a297-f608365f8d16/bin/utaipan-WLngWcDbfI/../../sv-benchmarks/c/recursive-simple/fibo_7-1.c [2021-10-11 02:27:00,107 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2200f2cf-eebe-40c6-a297-f608365f8d16/bin/utaipan-WLngWcDbfI/data/31c8eb50a/d45a58a064b6449781e95fa62c882686/FLAG7ff2b6436 [2021-10-11 02:27:00,482 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 02:27:00,483 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2200f2cf-eebe-40c6-a297-f608365f8d16/sv-benchmarks/c/recursive-simple/fibo_7-1.c [2021-10-11 02:27:00,488 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2200f2cf-eebe-40c6-a297-f608365f8d16/bin/utaipan-WLngWcDbfI/data/31c8eb50a/d45a58a064b6449781e95fa62c882686/FLAG7ff2b6436 [2021-10-11 02:27:00,893 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2200f2cf-eebe-40c6-a297-f608365f8d16/bin/utaipan-WLngWcDbfI/data/31c8eb50a/d45a58a064b6449781e95fa62c882686 [2021-10-11 02:27:00,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 02:27:00,898 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 02:27:00,906 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 02:27:00,906 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 02:27:00,909 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 02:27:00,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:27:00" (1/1) ... [2021-10-11 02:27:00,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5162e7e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:00, skipping insertion in model container [2021-10-11 02:27:00,914 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:27:00" (1/1) ... [2021-10-11 02:27:00,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 02:27:00,934 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 02:27:01,095 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2200f2cf-eebe-40c6-a297-f608365f8d16/sv-benchmarks/c/recursive-simple/fibo_7-1.c[741,754] [2021-10-11 02:27:01,104 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:27:01,129 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 02:27:01,145 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2200f2cf-eebe-40c6-a297-f608365f8d16/sv-benchmarks/c/recursive-simple/fibo_7-1.c[741,754] [2021-10-11 02:27:01,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:27:01,157 INFO L208 MainTranslator]: Completed translation [2021-10-11 02:27:01,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:01 WrapperNode [2021-10-11 02:27:01,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 02:27:01,160 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 02:27:01,160 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 02:27:01,160 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 02:27:01,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:01" (1/1) ... [2021-10-11 02:27:01,190 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:01" (1/1) ... [2021-10-11 02:27:01,210 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 02:27:01,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 02:27:01,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 02:27:01,212 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 02:27:01,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:01" (1/1) ... [2021-10-11 02:27:01,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:01" (1/1) ... [2021-10-11 02:27:01,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:01" (1/1) ... [2021-10-11 02:27:01,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:01" (1/1) ... [2021-10-11 02:27:01,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:01" (1/1) ... [2021-10-11 02:27:01,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:01" (1/1) ... [2021-10-11 02:27:01,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:01" (1/1) ... [2021-10-11 02:27:01,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 02:27:01,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 02:27:01,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 02:27:01,247 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 02:27:01,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:01" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2200f2cf-eebe-40c6-a297-f608365f8d16/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:27:01,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 02:27:01,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 02:27:01,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 02:27:01,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 02:27:01,338 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2021-10-11 02:27:01,338 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2021-10-11 02:27:01,611 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 02:27:01,611 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-10-11 02:27:01,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:27:01 BoogieIcfgContainer [2021-10-11 02:27:01,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 02:27:01,615 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 02:27:01,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 02:27:01,619 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 02:27:01,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:27:00" (1/3) ... [2021-10-11 02:27:01,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62ffa736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:27:01, skipping insertion in model container [2021-10-11 02:27:01,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:01" (2/3) ... [2021-10-11 02:27:01,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62ffa736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:27:01, skipping insertion in model container [2021-10-11 02:27:01,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:27:01" (3/3) ... [2021-10-11 02:27:01,623 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_7-1.c [2021-10-11 02:27:01,637 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 02:27:01,641 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-10-11 02:27:01,652 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-11 02:27:01,687 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 02:27:01,687 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 02:27:01,687 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 02:27:01,688 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 02:27:01,688 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 02:27:01,688 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 02:27:01,688 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 02:27:01,688 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 02:27:01,703 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2021-10-11 02:27:01,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-11 02:27:01,708 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:01,709 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:01,709 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:01,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:01,715 INFO L82 PathProgramCache]: Analyzing trace with hash -798924922, now seen corresponding path program 1 times [2021-10-11 02:27:01,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:01,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430316717] [2021-10-11 02:27:01,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:01,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:27:01,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430316717] [2021-10-11 02:27:01,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:27:01,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:27:01,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461429013] [2021-10-11 02:27:01,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:27:01,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:01,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:27:01,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:27:01,952 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2021-10-11 02:27:02,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:02,056 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2021-10-11 02:27:02,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:27:02,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2021-10-11 02:27:02,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:02,083 INFO L225 Difference]: With dead ends: 25 [2021-10-11 02:27:02,084 INFO L226 Difference]: Without dead ends: 17 [2021-10-11 02:27:02,086 INFO L677 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 [2021-10-11 02:27:02,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-10-11 02:27:02,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-10-11 02:27:02,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-10-11 02:27:02,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2021-10-11 02:27:02,136 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2021-10-11 02:27:02,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:02,137 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-10-11 02:27:02,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:27:02,137 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2021-10-11 02:27:02,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-11 02:27:02,140 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:02,140 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:02,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 02:27:02,142 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:02,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:02,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1717873930, now seen corresponding path program 1 times [2021-10-11 02:27:02,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:02,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608916880] [2021-10-11 02:27:02,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:02,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:27:02,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608916880] [2021-10-11 02:27:02,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:27:02,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:27:02,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15175219] [2021-10-11 02:27:02,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:27:02,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:02,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:27:02,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:27:02,218 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2021-10-11 02:27:02,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:02,297 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2021-10-11 02:27:02,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:27:02,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2021-10-11 02:27:02,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:02,302 INFO L225 Difference]: With dead ends: 23 [2021-10-11 02:27:02,303 INFO L226 Difference]: Without dead ends: 19 [2021-10-11 02:27:02,305 INFO L677 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 [2021-10-11 02:27:02,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-10-11 02:27:02,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2021-10-11 02:27:02,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-10-11 02:27:02,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2021-10-11 02:27:02,318 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2021-10-11 02:27:02,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:02,319 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-10-11 02:27:02,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:27:02,319 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2021-10-11 02:27:02,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-11 02:27:02,321 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:02,321 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:02,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 02:27:02,322 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:02,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:02,324 INFO L82 PathProgramCache]: Analyzing trace with hash 913644549, now seen corresponding path program 1 times [2021-10-11 02:27:02,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:02,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311562920] [2021-10-11 02:27:02,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:02,460 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-11 02:27:02,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311562920] [2021-10-11 02:27:02,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406718396] [2021-10-11 02:27:02,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2200f2cf-eebe-40c6-a297-f608365f8d16/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:27:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:02,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-11 02:27:02,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:27:02,704 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-11 02:27:02,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:27:03,018 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-11 02:27:03,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1227717524] [2021-10-11 02:27:03,046 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-11 02:27:03,046 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:27:03,052 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:27:03,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:27:03,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2021-10-11 02:27:03,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714155938] [2021-10-11 02:27:03,056 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-10-11 02:27:03,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:03,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-11 02:27:03,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-10-11 02:27:03,057 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 11 states. [2021-10-11 02:27:03,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:03,212 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2021-10-11 02:27:03,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 02:27:03,213 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2021-10-11 02:27:03,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:03,215 INFO L225 Difference]: With dead ends: 34 [2021-10-11 02:27:03,216 INFO L226 Difference]: Without dead ends: 19 [2021-10-11 02:27:03,218 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-10-11 02:27:03,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-10-11 02:27:03,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-10-11 02:27:03,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-10-11 02:27:03,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2021-10-11 02:27:03,229 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 22 [2021-10-11 02:27:03,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:03,230 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-10-11 02:27:03,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-10-11 02:27:03,230 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2021-10-11 02:27:03,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-11 02:27:03,233 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:03,233 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:03,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-10-11 02:27:03,461 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:03,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:03,462 INFO L82 PathProgramCache]: Analyzing trace with hash -252103063, now seen corresponding path program 1 times [2021-10-11 02:27:03,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:03,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829578630] [2021-10-11 02:27:03,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:03,551 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-11 02:27:03,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829578630] [2021-10-11 02:27:03,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34589383] [2021-10-11 02:27:03,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2200f2cf-eebe-40c6-a297-f608365f8d16/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:27:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:03,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-11 02:27:03,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:27:03,691 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-11 02:27:03,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:27:03,918 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-11 02:27:03,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2015203486] [2021-10-11 02:27:03,922 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-11 02:27:03,923 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:27:03,923 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:27:03,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:27:03,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2021-10-11 02:27:03,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456976599] [2021-10-11 02:27:03,925 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-10-11 02:27:03,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:03,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-11 02:27:03,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:27:03,928 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 9 states. [2021-10-11 02:27:04,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:04,028 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2021-10-11 02:27:04,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:27:04,029 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2021-10-11 02:27:04,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:04,035 INFO L225 Difference]: With dead ends: 28 [2021-10-11 02:27:04,036 INFO L226 Difference]: Without dead ends: 24 [2021-10-11 02:27:04,037 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-10-11 02:27:04,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-10-11 02:27:04,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-10-11 02:27:04,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2021-10-11 02:27:04,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2021-10-11 02:27:04,050 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 23 [2021-10-11 02:27:04,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:04,051 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2021-10-11 02:27:04,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-10-11 02:27:04,051 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2021-10-11 02:27:04,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-11 02:27:04,055 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:04,055 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:04,269 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:27:04,269 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:04,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:04,270 INFO L82 PathProgramCache]: Analyzing trace with hash 659330, now seen corresponding path program 2 times [2021-10-11 02:27:04,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:04,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490292083] [2021-10-11 02:27:04,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:04,427 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-10-11 02:27:04,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490292083] [2021-10-11 02:27:04,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069663102] [2021-10-11 02:27:04,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2200f2cf-eebe-40c6-a297-f608365f8d16/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:27:04,479 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-10-11 02:27:04,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:27:04,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-11 02:27:04,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:27:04,589 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-10-11 02:27:04,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:27:04,865 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-11 02:27:04,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1040778814] [2021-10-11 02:27:04,869 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-11 02:27:04,871 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:27:04,874 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:27:04,876 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:27:04,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 14 [2021-10-11 02:27:04,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827830678] [2021-10-11 02:27:04,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-10-11 02:27:04,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:04,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-11 02:27:04,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-10-11 02:27:04,880 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 14 states. [2021-10-11 02:27:05,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:05,159 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2021-10-11 02:27:05,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-11 02:27:05,160 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2021-10-11 02:27:05,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:05,164 INFO L225 Difference]: With dead ends: 55 [2021-10-11 02:27:05,165 INFO L226 Difference]: Without dead ends: 33 [2021-10-11 02:27:05,166 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2021-10-11 02:27:05,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-10-11 02:27:05,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2021-10-11 02:27:05,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2021-10-11 02:27:05,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2021-10-11 02:27:05,190 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 36 [2021-10-11 02:27:05,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:05,194 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2021-10-11 02:27:05,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-10-11 02:27:05,194 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2021-10-11 02:27:05,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-11 02:27:05,196 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:05,196 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:05,421 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:27:05,421 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:05,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:05,422 INFO L82 PathProgramCache]: Analyzing trace with hash 2099733774, now seen corresponding path program 3 times [2021-10-11 02:27:05,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:05,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357523527] [2021-10-11 02:27:05,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:05,506 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-11 02:27:05,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357523527] [2021-10-11 02:27:05,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183159686] [2021-10-11 02:27:05,507 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2200f2cf-eebe-40c6-a297-f608365f8d16/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:27:05,559 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-11 02:27:05,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:27:05,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-11 02:27:05,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:27:05,622 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-11 02:27:05,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:27:05,953 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-10-11 02:27:05,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [930565181] [2021-10-11 02:27:05,956 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-11 02:27:05,956 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:27:05,957 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:27:05,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:27:05,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2021-10-11 02:27:05,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17924591] [2021-10-11 02:27:05,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-10-11 02:27:05,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:05,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-11 02:27:05,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-10-11 02:27:05,960 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 11 states. [2021-10-11 02:27:06,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:06,089 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2021-10-11 02:27:06,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:27:06,090 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2021-10-11 02:27:06,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:06,091 INFO L225 Difference]: With dead ends: 36 [2021-10-11 02:27:06,091 INFO L226 Difference]: Without dead ends: 32 [2021-10-11 02:27:06,092 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-10-11 02:27:06,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-10-11 02:27:06,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-10-11 02:27:06,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2021-10-11 02:27:06,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2021-10-11 02:27:06,098 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 37 [2021-10-11 02:27:06,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:06,098 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2021-10-11 02:27:06,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-10-11 02:27:06,098 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2021-10-11 02:27:06,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-10-11 02:27:06,101 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:06,101 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:06,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:27:06,317 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:06,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:06,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1019643787, now seen corresponding path program 4 times [2021-10-11 02:27:06,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:06,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051861372] [2021-10-11 02:27:06,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:06,458 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2021-10-11 02:27:06,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051861372] [2021-10-11 02:27:06,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57778157] [2021-10-11 02:27:06,463 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2200f2cf-eebe-40c6-a297-f608365f8d16/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:27:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:06,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-11 02:27:06,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:27:06,639 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2021-10-11 02:27:06,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:27:07,306 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 142 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2021-10-11 02:27:07,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [348060650] [2021-10-11 02:27:07,313 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-11 02:27:07,313 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:27:07,314 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:27:07,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:27:07,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2021-10-11 02:27:07,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310445422] [2021-10-11 02:27:07,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-10-11 02:27:07,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:07,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-11 02:27:07,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-10-11 02:27:07,317 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 13 states. [2021-10-11 02:27:07,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:07,498 INFO L93 Difference]: Finished difference Result 41 states and 63 transitions. [2021-10-11 02:27:07,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 02:27:07,499 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 78 [2021-10-11 02:27:07,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:07,503 INFO L225 Difference]: With dead ends: 41 [2021-10-11 02:27:07,503 INFO L226 Difference]: Without dead ends: 37 [2021-10-11 02:27:07,504 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-10-11 02:27:07,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-10-11 02:27:07,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-10-11 02:27:07,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2021-10-11 02:27:07,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2021-10-11 02:27:07,520 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 78 [2021-10-11 02:27:07,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:07,520 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2021-10-11 02:27:07,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-10-11 02:27:07,521 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2021-10-11 02:27:07,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-10-11 02:27:07,533 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:07,533 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:07,759 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-10-11 02:27:07,759 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:07,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:07,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1696376591, now seen corresponding path program 5 times [2021-10-11 02:27:07,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:07,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485505733] [2021-10-11 02:27:07,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:07,930 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2021-10-11 02:27:07,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485505733] [2021-10-11 02:27:07,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462146255] [2021-10-11 02:27:07,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2200f2cf-eebe-40c6-a297-f608365f8d16/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:27:07,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-10-11 02:27:07,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:27:07,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-11 02:27:08,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:27:08,154 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 141 proven. 41 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2021-10-11 02:27:08,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:27:08,662 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 141 proven. 50 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2021-10-11 02:27:08,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1246443812] [2021-10-11 02:27:08,664 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-11 02:27:08,665 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:27:08,665 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:27:08,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:27:08,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 9] total 13 [2021-10-11 02:27:08,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344768522] [2021-10-11 02:27:08,667 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-10-11 02:27:08,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:08,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-11 02:27:08,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2021-10-11 02:27:08,669 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand 13 states. [2021-10-11 02:27:08,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:08,855 INFO L93 Difference]: Finished difference Result 46 states and 78 transitions. [2021-10-11 02:27:08,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-11 02:27:08,856 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 105 [2021-10-11 02:27:08,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:08,858 INFO L225 Difference]: With dead ends: 46 [2021-10-11 02:27:08,858 INFO L226 Difference]: Without dead ends: 42 [2021-10-11 02:27:08,859 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2021-10-11 02:27:08,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-10-11 02:27:08,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2021-10-11 02:27:08,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2021-10-11 02:27:08,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 74 transitions. [2021-10-11 02:27:08,869 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 74 transitions. Word has length 105 [2021-10-11 02:27:08,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:08,870 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 74 transitions. [2021-10-11 02:27:08,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-10-11 02:27:08,870 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 74 transitions. [2021-10-11 02:27:08,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2021-10-11 02:27:08,874 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:08,874 INFO L422 BasicCegarLoop]: trace histogram [35, 35, 30, 17, 17, 17, 17, 17, 17, 17, 13, 5, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:09,085 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:27:09,085 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:09,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:09,086 INFO L82 PathProgramCache]: Analyzing trace with hash -860646155, now seen corresponding path program 6 times [2021-10-11 02:27:09,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:09,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161701024] [2021-10-11 02:27:09,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:09,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3359 backedges. 153 proven. 813 refuted. 0 times theorem prover too weak. 2393 trivial. 0 not checked. [2021-10-11 02:27:09,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161701024] [2021-10-11 02:27:09,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926116926] [2021-10-11 02:27:09,399 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2200f2cf-eebe-40c6-a297-f608365f8d16/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:27:09,543 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-11 02:27:09,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:27:09,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-11 02:27:09,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:27:09,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3359 backedges. 1748 proven. 170 refuted. 0 times theorem prover too weak. 1441 trivial. 0 not checked. [2021-10-11 02:27:09,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:27:11,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3359 backedges. 294 proven. 953 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2021-10-11 02:27:11,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [431544314] [2021-10-11 02:27:11,856 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-11 02:27:11,857 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:27:11,857 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:27:11,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:27:11,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 15] total 21 [2021-10-11 02:27:11,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590967689] [2021-10-11 02:27:11,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-10-11 02:27:11,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:11,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-11 02:27:11,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2021-10-11 02:27:11,865 INFO L87 Difference]: Start difference. First operand 42 states and 74 transitions. Second operand 21 states. [2021-10-11 02:27:12,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:12,570 INFO L93 Difference]: Finished difference Result 105 states and 237 transitions. [2021-10-11 02:27:12,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-11 02:27:12,571 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 243 [2021-10-11 02:27:12,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:12,573 INFO L225 Difference]: With dead ends: 105 [2021-10-11 02:27:12,573 INFO L226 Difference]: Without dead ends: 68 [2021-10-11 02:27:12,577 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 478 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=427, Invalid=1133, Unknown=0, NotChecked=0, Total=1560 [2021-10-11 02:27:12,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-10-11 02:27:12,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-10-11 02:27:12,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2021-10-11 02:27:12,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2021-10-11 02:27:12,588 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 243 [2021-10-11 02:27:12,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:12,588 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2021-10-11 02:27:12,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2021-10-11 02:27:12,589 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2021-10-11 02:27:12,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2021-10-11 02:27:12,594 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:12,594 INFO L422 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:12,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:27:12,809 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:12,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:12,810 INFO L82 PathProgramCache]: Analyzing trace with hash 826064675, now seen corresponding path program 7 times [2021-10-11 02:27:12,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:12,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515235091] [2021-10-11 02:27:12,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:13,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 869 proven. 346 refuted. 0 times theorem prover too weak. 4824 trivial. 0 not checked. [2021-10-11 02:27:13,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515235091] [2021-10-11 02:27:13,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765771341] [2021-10-11 02:27:13,082 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2200f2cf-eebe-40c6-a297-f608365f8d16/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:27:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:13,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-11 02:27:13,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:27:13,669 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1091 proven. 467 refuted. 0 times theorem prover too weak. 4481 trivial. 0 not checked. [2021-10-11 02:27:13,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:27:16,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1091 proven. 518 refuted. 0 times theorem prover too weak. 4430 trivial. 0 not checked. [2021-10-11 02:27:16,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1740619600] [2021-10-11 02:27:16,099 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-11 02:27:16,099 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:27:16,100 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:27:16,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:27:16,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 17] total 21 [2021-10-11 02:27:16,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365228772] [2021-10-11 02:27:16,105 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-10-11 02:27:16,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:16,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-11 02:27:16,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2021-10-11 02:27:16,107 INFO L87 Difference]: Start difference. First operand 68 states and 98 transitions. Second operand 21 states. [2021-10-11 02:27:16,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:16,382 INFO L93 Difference]: Finished difference Result 127 states and 206 transitions. [2021-10-11 02:27:16,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-11 02:27:16,383 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 323 [2021-10-11 02:27:16,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:16,389 INFO L225 Difference]: With dead ends: 127 [2021-10-11 02:27:16,389 INFO L226 Difference]: Without dead ends: 100 [2021-10-11 02:27:16,391 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 638 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=240, Invalid=462, Unknown=0, NotChecked=0, Total=702 [2021-10-11 02:27:16,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-10-11 02:27:16,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 92. [2021-10-11 02:27:16,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2021-10-11 02:27:16,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions. [2021-10-11 02:27:16,422 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 131 transitions. Word has length 323 [2021-10-11 02:27:16,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:16,423 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 131 transitions. [2021-10-11 02:27:16,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2021-10-11 02:27:16,423 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2021-10-11 02:27:16,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2021-10-11 02:27:16,431 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:16,431 INFO L422 BasicCegarLoop]: trace histogram [43, 43, 35, 21, 21, 21, 21, 21, 21, 21, 14, 8, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:16,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-10-11 02:27:16,657 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:16,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:16,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1304661205, now seen corresponding path program 8 times [2021-10-11 02:27:16,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:16,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364173326] [2021-10-11 02:27:16,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:16,940 INFO L134 CoverageAnalysis]: Checked inductivity of 5047 backedges. 316 proven. 1151 refuted. 0 times theorem prover too weak. 3580 trivial. 0 not checked. [2021-10-11 02:27:16,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364173326] [2021-10-11 02:27:16,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064349653] [2021-10-11 02:27:16,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2200f2cf-eebe-40c6-a297-f608365f8d16/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:27:17,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2021-10-11 02:27:17,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:27:17,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 17 conjunts are in the unsatisfiable core [2021-10-11 02:27:17,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:27:17,544 INFO L134 CoverageAnalysis]: Checked inductivity of 5047 backedges. 328 proven. 1133 refuted. 0 times theorem prover too weak. 3586 trivial. 0 not checked. [2021-10-11 02:27:17,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:27:20,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5047 backedges. 322 proven. 1190 refuted. 0 times theorem prover too weak. 3535 trivial. 0 not checked. [2021-10-11 02:27:20,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1891760972] [2021-10-11 02:27:20,032 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-11 02:27:20,032 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:27:20,033 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:27:20,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:27:20,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 18] total 23 [2021-10-11 02:27:20,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664440173] [2021-10-11 02:27:20,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-10-11 02:27:20,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:20,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-10-11 02:27:20,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2021-10-11 02:27:20,036 INFO L87 Difference]: Start difference. First operand 92 states and 131 transitions. Second operand 23 states. [2021-10-11 02:27:20,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:20,296 INFO L93 Difference]: Finished difference Result 137 states and 207 transitions. [2021-10-11 02:27:20,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-11 02:27:20,297 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 296 [2021-10-11 02:27:20,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:20,300 INFO L225 Difference]: With dead ends: 137 [2021-10-11 02:27:20,301 INFO L226 Difference]: Without dead ends: 68 [2021-10-11 02:27:20,302 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 573 SyntacticMatches, 15 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=280, Invalid=532, Unknown=0, NotChecked=0, Total=812 [2021-10-11 02:27:20,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-10-11 02:27:20,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-10-11 02:27:20,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2021-10-11 02:27:20,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2021-10-11 02:27:20,327 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 296 [2021-10-11 02:27:20,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:20,327 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2021-10-11 02:27:20,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-10-11 02:27:20,328 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2021-10-11 02:27:20,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2021-10-11 02:27:20,331 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:20,331 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:20,557 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:27:20,557 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:20,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:20,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1893730074, now seen corresponding path program 9 times [2021-10-11 02:27:20,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:20,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392374942] [2021-10-11 02:27:20,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:21,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 0 proven. 1500 refuted. 0 times theorem prover too weak. 3068 trivial. 0 not checked. [2021-10-11 02:27:21,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392374942] [2021-10-11 02:27:21,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354728527] [2021-10-11 02:27:21,218 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2200f2cf-eebe-40c6-a297-f608365f8d16/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:27:21,475 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-11 02:27:21,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:27:21,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 167 conjunts are in the unsatisfiable core [2021-10-11 02:27:21,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:27:22,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 0 proven. 1500 refuted. 0 times theorem prover too weak. 3068 trivial. 0 not checked. [2021-10-11 02:27:22,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:27:25,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 0 proven. 1500 refuted. 0 times theorem prover too weak. 3068 trivial. 0 not checked. [2021-10-11 02:27:25,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2049701821] [2021-10-11 02:27:25,305 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-11 02:27:25,305 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:27:25,305 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:27:25,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:27:25,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 28 [2021-10-11 02:27:25,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863702606] [2021-10-11 02:27:25,308 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-10-11 02:27:25,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:25,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-10-11 02:27:25,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2021-10-11 02:27:25,309 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand 28 states. [2021-10-11 02:27:25,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:25,606 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2021-10-11 02:27:25,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-11 02:27:25,607 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 282 [2021-10-11 02:27:25,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:25,608 INFO L225 Difference]: With dead ends: 68 [2021-10-11 02:27:25,608 INFO L226 Difference]: Without dead ends: 0 [2021-10-11 02:27:25,609 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 587 SyntacticMatches, 34 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2021-10-11 02:27:25,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-11 02:27:25,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-11 02:27:25,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-10-11 02:27:25,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-11 02:27:25,610 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 282 [2021-10-11 02:27:25,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:25,610 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 02:27:25,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2021-10-11 02:27:25,611 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-11 02:27:25,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-11 02:27:25,825 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:27:25,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-11 02:27:26,575 WARN L197 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 48 [2021-10-11 02:27:26,580 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-11 02:27:26,580 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-11 02:27:26,580 INFO L262 CegarLoopResult]: For program point L29(line 29) no Hoare annotation was computed. [2021-10-11 02:27:26,580 INFO L262 CegarLoopResult]: For program point L28(lines 28 30) no Hoare annotation was computed. [2021-10-11 02:27:26,580 INFO L258 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 7) (<= 7 ULTIMATE.start_main_~x~0)) [2021-10-11 02:27:26,580 INFO L262 CegarLoopResult]: For program point L27-1(line 27) no Hoare annotation was computed. [2021-10-11 02:27:26,580 INFO L258 CegarLoopResult]: At program point L28-2(lines 28 30) the Hoare annotation is: (<= 7 ULTIMATE.start_main_~x~0) [2021-10-11 02:27:26,580 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 29) no Hoare annotation was computed. [2021-10-11 02:27:26,581 INFO L262 CegarLoopResult]: For program point fiboEXIT(lines 7 15) no Hoare annotation was computed. [2021-10-11 02:27:26,581 INFO L262 CegarLoopResult]: For program point fiboFINAL(lines 7 15) no Hoare annotation was computed. [2021-10-11 02:27:26,581 INFO L258 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= fibo_~n |fibo_#in~n|) (<= |fibo_#in~n| fibo_~n) (not (<= |fibo_#in~n| 1))) [2021-10-11 02:27:26,581 INFO L262 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2021-10-11 02:27:26,581 INFO L258 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (let ((.cse4 (<= fibo_~n |fibo_#in~n|)) (.cse5 (<= |fibo_#in~n| fibo_~n)) (.cse6 (<= |fibo_#in~n| 5))) (let ((.cse0 (<= 4 |fibo_#in~n|)) (.cse3 (<= 6 |fibo_#in~n|)) (.cse1 (<= |fibo_#in~n| 3)) (.cse2 (and (<= 5 |fibo_#in~n|) .cse4 .cse5 (<= |fibo_#t~ret7| 3) .cse6 (<= 3 |fibo_#t~ret7|)))) (and (or (and (<= |fibo_#t~ret7| 2) (<= 2 |fibo_#t~ret7|) .cse0) (and (= |fibo_#t~ret7| 1) .cse1) .cse2 .cse3) (or (and (<= |fibo_#t~ret7| 8) (<= 8 |fibo_#t~ret7|)) (<= |fibo_#in~n| 6) (<= 8 |fibo_#in~n|)) (or (and .cse4 (<= |fibo_#in~n| 4) .cse5 .cse0) (and .cse4 .cse5 .cse3) (and .cse4 .cse5 (<= 3 |fibo_#in~n|) .cse1) .cse2 (and .cse4 (<= 2 |fibo_#in~n|) .cse5 (<= |fibo_#in~n| 2))) (or (and (<= 5 |fibo_#t~ret7|) (<= |fibo_#t~ret7| 5)) (<= 7 |fibo_#in~n|) .cse6)))) [2021-10-11 02:27:26,581 INFO L262 CegarLoopResult]: For program point L10(lines 10 14) no Hoare annotation was computed. [2021-10-11 02:27:26,581 INFO L262 CegarLoopResult]: For program point L13-3(line 13) no Hoare annotation was computed. [2021-10-11 02:27:26,581 INFO L262 CegarLoopResult]: For program point L8(lines 8 14) no Hoare annotation was computed. [2021-10-11 02:27:26,582 INFO L265 CegarLoopResult]: At program point fiboENTRY(lines 7 15) the Hoare annotation is: true [2021-10-11 02:27:26,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:27:26 BoogieIcfgContainer [2021-10-11 02:27:26,598 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 02:27:26,598 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 02:27:26,598 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 02:27:26,598 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 02:27:26,599 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:27:01" (3/4) ... [2021-10-11 02:27:26,602 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-11 02:27:26,610 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo [2021-10-11 02:27:26,615 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2021-10-11 02:27:26,615 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-11 02:27:26,615 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-11 02:27:26,615 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-11 02:27:26,646 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2200f2cf-eebe-40c6-a297-f608365f8d16/bin/utaipan-WLngWcDbfI/witness.graphml [2021-10-11 02:27:26,646 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 02:27:26,647 INFO L168 Benchmark]: Toolchain (without parser) took 25749.12 ms. Allocated memory was 88.1 MB in the beginning and 484.4 MB in the end (delta: 396.4 MB). Free memory was 54.1 MB in the beginning and 305.3 MB in the end (delta: -251.2 MB). Peak memory consumption was 144.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:27:26,648 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 88.1 MB. Free memory was 58.7 MB in the beginning and 58.7 MB in the end (delta: 21.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:27:26,648 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.00 ms. Allocated memory was 88.1 MB in the beginning and 123.7 MB in the end (delta: 35.7 MB). Free memory was 53.9 MB in the beginning and 101.2 MB in the end (delta: -47.3 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. [2021-10-11 02:27:26,649 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.15 ms. Allocated memory is still 123.7 MB. Free memory was 100.7 MB in the beginning and 99.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:27:26,649 INFO L168 Benchmark]: Boogie Preprocessor took 31.81 ms. Allocated memory is still 123.7 MB. Free memory was 99.5 MB in the beginning and 98.5 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:27:26,649 INFO L168 Benchmark]: RCFGBuilder took 370.21 ms. Allocated memory is still 123.7 MB. Free memory was 98.5 MB in the beginning and 85.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-11 02:27:26,650 INFO L168 Benchmark]: TraceAbstraction took 24982.24 ms. Allocated memory was 123.7 MB in the beginning and 484.4 MB in the end (delta: 360.7 MB). Free memory was 84.8 MB in the beginning and 308.4 MB in the end (delta: -223.6 MB). Peak memory consumption was 138.6 MB. Max. memory is 16.1 GB. [2021-10-11 02:27:26,650 INFO L168 Benchmark]: Witness Printer took 48.31 ms. Allocated memory is still 484.4 MB. Free memory was 308.4 MB in the beginning and 305.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:27:26,653 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 88.1 MB. Free memory was 58.7 MB in the beginning and 58.7 MB in the end (delta: 21.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 253.00 ms. Allocated memory was 88.1 MB in the beginning and 123.7 MB in the end (delta: 35.7 MB). Free memory was 53.9 MB in the beginning and 101.2 MB in the end (delta: -47.3 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 50.15 ms. Allocated memory is still 123.7 MB. Free memory was 100.7 MB in the beginning and 99.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 31.81 ms. Allocated memory is still 123.7 MB. Free memory was 99.5 MB in the beginning and 98.5 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 370.21 ms. Allocated memory is still 123.7 MB. Free memory was 98.5 MB in the beginning and 85.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 24982.24 ms. Allocated memory was 123.7 MB in the beginning and 484.4 MB in the end (delta: 360.7 MB). Free memory was 84.8 MB in the beginning and 308.4 MB in the end (delta: -223.6 MB). Peak memory consumption was 138.6 MB. Max. memory is 16.1 GB. * Witness Printer took 48.31 ms. Allocated memory is still 484.4 MB. Free memory was 308.4 MB in the beginning and 305.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 29]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: 7 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 24.1s, OverallIterations: 12, TraceHistogramMax: 47, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 213 SDtfs, 474 SDslu, 1014 SDs, 0 SdLazy, 1490 SolverSat, 535 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3134 GetRequests, 2863 SyntacticMatches, 63 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred 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.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 113 PreInvPairs, 263 NumberOfFragments, 160 HoareAnnotationTreeSize, 113 FomulaSimplifications, 1684 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 5 FomulaSimplificationsInter, 1251 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 16.5s InterpolantComputationTime, 2909 NumberOfCodeBlocks, 2704 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 4322 ConstructedInterpolants, 0 QuantifiedInterpolants, 1921026 SizeOfPredicates, 47 NumberOfNonLiveVariables, 3002 ConjunctsInSsa, 258 ConjunctsInUnsatCore, 32 InterpolantComputations, 2 PerfectInterpolantSequences, 47906/60003 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...