./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/id_i15_o15-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3eb1d6f7-dfa4-4f9e-8f09-407a0dd098f0/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3eb1d6f7-dfa4-4f9e-8f09-407a0dd098f0/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3eb1d6f7-dfa4-4f9e-8f09-407a0dd098f0/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3eb1d6f7-dfa4-4f9e-8f09-407a0dd098f0/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/id_i15_o15-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3eb1d6f7-dfa4-4f9e-8f09-407a0dd098f0/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3eb1d6f7-dfa4-4f9e-8f09-407a0dd098f0/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad4e6ad99a266ddeead98987e8e44db723af5bc7 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 16:34:35,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:34:35,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:34:35,564 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:34:35,564 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:34:35,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:34:35,566 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:34:35,567 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:34:35,569 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:34:35,570 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:34:35,571 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:34:35,572 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:34:35,572 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:34:35,573 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:34:35,574 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:34:35,575 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:34:35,576 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:34:35,577 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:34:35,578 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:34:35,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:34:35,582 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:34:35,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:34:35,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:34:35,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:34:35,586 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:34:35,586 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:34:35,587 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:34:35,587 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:34:35,587 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:34:35,588 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:34:35,588 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:34:35,589 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:34:35,589 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:34:35,590 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:34:35,591 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:34:35,591 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:34:35,591 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:34:35,592 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:34:35,592 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:34:35,593 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:34:35,593 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:34:35,594 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3eb1d6f7-dfa4-4f9e-8f09-407a0dd098f0/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 16:34:35,606 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:34:35,607 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:34:35,607 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 16:34:35,607 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 16:34:35,608 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 16:34:35,608 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 16:34:35,608 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 16:34:35,608 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 16:34:35,608 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 16:34:35,608 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 16:34:35,608 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 16:34:35,609 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 16:34:35,609 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 16:34:35,609 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 16:34:35,609 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 16:34:35,610 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:34:35,610 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:34:35,610 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:34:35,610 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:34:35,610 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:34:35,610 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:34:35,610 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:34:35,610 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:34:35,611 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:34:35,611 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:34:35,611 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:34:35,611 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:34:35,611 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:34:35,611 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:34:35,611 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:34:35,611 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:34:35,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:34:35,612 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:34:35,612 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:34:35,612 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:34:35,612 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 16:34:35,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:34:35,612 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:34:35,612 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:34:35,612 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:34:35,612 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_3eb1d6f7-dfa4-4f9e-8f09-407a0dd098f0/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ad4e6ad99a266ddeead98987e8e44db723af5bc7 [2019-12-07 16:34:35,723 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:34:35,731 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:34:35,734 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:34:35,735 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:34:35,735 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:34:35,736 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3eb1d6f7-dfa4-4f9e-8f09-407a0dd098f0/bin/utaipan/../../sv-benchmarks/c/recursive-simple/id_i15_o15-2.c [2019-12-07 16:34:35,775 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3eb1d6f7-dfa4-4f9e-8f09-407a0dd098f0/bin/utaipan/data/a64071ffd/397d508015fe4021a71d47167fde25b8/FLAG3536cb0b3 [2019-12-07 16:34:36,177 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:34:36,177 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3eb1d6f7-dfa4-4f9e-8f09-407a0dd098f0/sv-benchmarks/c/recursive-simple/id_i15_o15-2.c [2019-12-07 16:34:36,181 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3eb1d6f7-dfa4-4f9e-8f09-407a0dd098f0/bin/utaipan/data/a64071ffd/397d508015fe4021a71d47167fde25b8/FLAG3536cb0b3 [2019-12-07 16:34:36,192 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3eb1d6f7-dfa4-4f9e-8f09-407a0dd098f0/bin/utaipan/data/a64071ffd/397d508015fe4021a71d47167fde25b8 [2019-12-07 16:34:36,194 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:34:36,195 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:34:36,196 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:34:36,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:34:36,199 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:34:36,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:34:36" (1/1) ... [2019-12-07 16:34:36,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26e24b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:34:36, skipping insertion in model container [2019-12-07 16:34:36,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:34:36" (1/1) ... [2019-12-07 16:34:36,206 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:34:36,217 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:34:36,321 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:34:36,324 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:34:36,365 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:34:36,377 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:34:36,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:34:36 WrapperNode [2019-12-07 16:34:36,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:34:36,378 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:34:36,378 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:34:36,378 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:34:36,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:34:36" (1/1) ... [2019-12-07 16:34:36,388 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:34:36" (1/1) ... [2019-12-07 16:34:36,398 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:34:36,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:34:36,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:34:36,398 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:34:36,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:34:36" (1/1) ... [2019-12-07 16:34:36,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:34:36" (1/1) ... [2019-12-07 16:34:36,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:34:36" (1/1) ... [2019-12-07 16:34:36,405 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:34:36" (1/1) ... [2019-12-07 16:34:36,406 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:34:36" (1/1) ... [2019-12-07 16:34:36,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:34:36" (1/1) ... [2019-12-07 16:34:36,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:34:36" (1/1) ... [2019-12-07 16:34:36,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:34:36,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:34:36,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:34:36,408 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:34:36,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:34:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3eb1d6f7-dfa4-4f9e-8f09-407a0dd098f0/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:34:36,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:34:36,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:34:36,447 INFO L130 BoogieDeclarations]: Found specification of procedure id [2019-12-07 16:34:36,447 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2019-12-07 16:34:36,541 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:34:36,541 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 16:34:36,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:34:36 BoogieIcfgContainer [2019-12-07 16:34:36,542 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:34:36,543 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:34:36,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:34:36,545 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:34:36,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:34:36" (1/3) ... [2019-12-07 16:34:36,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288cf324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:34:36, skipping insertion in model container [2019-12-07 16:34:36,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:34:36" (2/3) ... [2019-12-07 16:34:36,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288cf324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:34:36, skipping insertion in model container [2019-12-07 16:34:36,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:34:36" (3/3) ... [2019-12-07 16:34:36,547 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i15_o15-2.c [2019-12-07 16:34:36,554 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:34:36,558 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 16:34:36,565 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 16:34:36,579 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:34:36,579 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:34:36,579 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:34:36,580 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:34:36,580 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:34:36,580 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:34:36,580 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:34:36,580 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:34:36,590 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2019-12-07 16:34:36,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 16:34:36,593 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:34:36,594 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:34:36,594 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:34:36,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:34:36,598 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2019-12-07 16:34:36,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:34:36,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464805064] [2019-12-07 16:34:36,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:34:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:34:36,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:34:36,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464805064] [2019-12-07 16:34:36,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:34:36,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 16:34:36,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104698827] [2019-12-07 16:34:36,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:34:36,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:34:36,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:34:36,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:34:36,749 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 7 states. [2019-12-07 16:34:36,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:34:36,838 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-12-07 16:34:36,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:34:36,839 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-12-07 16:34:36,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:34:36,845 INFO L225 Difference]: With dead ends: 24 [2019-12-07 16:34:36,846 INFO L226 Difference]: Without dead ends: 14 [2019-12-07 16:34:36,848 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:34:36,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-12-07 16:34:36,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-12-07 16:34:36,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-12-07 16:34:36,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-12-07 16:34:36,874 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-12-07 16:34:36,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:34:36,874 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-12-07 16:34:36,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:34:36,874 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-12-07 16:34:36,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 16:34:36,875 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:34:36,875 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:34:36,875 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:34:36,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:34:36,876 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2019-12-07 16:34:36,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:34:36,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264587518] [2019-12-07 16:34:36,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:34:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:34:36,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 16:34:36,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264587518] [2019-12-07 16:34:36,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474713340] [2019-12-07 16:34:36,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3eb1d6f7-dfa4-4f9e-8f09-407a0dd098f0/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:34:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:34:36,958 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 16:34:36,961 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:34:37,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 16:34:37,002 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:34:37,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:34:37,117 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 16:34:37,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [397280619] [2019-12-07 16:34:37,133 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:34:37,133 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:34:37,138 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 16:34:37,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:34:37,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 14 [2019-12-07 16:34:37,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513111023] [2019-12-07 16:34:37,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 16:34:37,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:34:37,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 16:34:37,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-07 16:34:37,141 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 14 states. [2019-12-07 16:34:37,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:34:37,203 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-12-07 16:34:37,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:34:37,204 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2019-12-07 16:34:37,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:34:37,204 INFO L225 Difference]: With dead ends: 21 [2019-12-07 16:34:37,204 INFO L226 Difference]: Without dead ends: 17 [2019-12-07 16:34:37,205 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2019-12-07 16:34:37,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-12-07 16:34:37,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-12-07 16:34:37,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 16:34:37,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-12-07 16:34:37,209 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-12-07 16:34:37,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:34:37,209 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-12-07 16:34:37,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 16:34:37,209 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-12-07 16:34:37,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 16:34:37,210 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:34:37,210 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:34:37,410 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:34:37,410 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:34:37,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:34:37,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2019-12-07 16:34:37,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:34:37,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205891625] [2019-12-07 16:34:37,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:34:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:34:37,497 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 16:34:37,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205891625] [2019-12-07 16:34:37,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134004830] [2019-12-07 16:34:37,498 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3eb1d6f7-dfa4-4f9e-8f09-407a0dd098f0/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:34:37,519 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 16:34:37,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:34:37,520 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 16:34:37,521 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:34:37,554 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 16:34:37,554 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:34:37,778 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 16:34:37,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1332495029] [2019-12-07 16:34:37,780 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:34:37,780 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:34:37,780 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 16:34:37,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:34:37,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2019-12-07 16:34:37,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413780798] [2019-12-07 16:34:37,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 16:34:37,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:34:37,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 16:34:37,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-12-07 16:34:37,782 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 18 states. [2019-12-07 16:34:37,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:34:37,878 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-12-07 16:34:37,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 16:34:37,878 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2019-12-07 16:34:37,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:34:37,879 INFO L225 Difference]: With dead ends: 24 [2019-12-07 16:34:37,879 INFO L226 Difference]: Without dead ends: 20 [2019-12-07 16:34:37,880 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2019-12-07 16:34:37,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-12-07 16:34:37,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-12-07 16:34:37,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 16:34:37,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-12-07 16:34:37,883 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2019-12-07 16:34:37,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:34:37,884 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-12-07 16:34:37,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 16:34:37,884 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-12-07 16:34:37,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 16:34:37,885 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:34:37,885 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:34:38,086 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:34:38,086 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:34:38,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:34:38,087 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2019-12-07 16:34:38,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:34:38,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254582439] [2019-12-07 16:34:38,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:34:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:34:38,209 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 16:34:38,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254582439] [2019-12-07 16:34:38,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854640899] [2019-12-07 16:34:38,210 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3eb1d6f7-dfa4-4f9e-8f09-407a0dd098f0/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:34:38,231 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 16:34:38,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:34:38,232 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 16:34:38,233 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:34:38,279 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 16:34:38,279 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:34:38,591 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 16:34:38,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1236842039] [2019-12-07 16:34:38,592 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:34:38,593 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:34:38,593 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 16:34:38,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:34:38,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 11] total 22 [2019-12-07 16:34:38,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053941504] [2019-12-07 16:34:38,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 16:34:38,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:34:38,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 16:34:38,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2019-12-07 16:34:38,595 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 22 states. [2019-12-07 16:34:38,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:34:38,715 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-12-07 16:34:38,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 16:34:38,715 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 27 [2019-12-07 16:34:38,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:34:38,716 INFO L225 Difference]: With dead ends: 27 [2019-12-07 16:34:38,716 INFO L226 Difference]: Without dead ends: 23 [2019-12-07 16:34:38,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2019-12-07 16:34:38,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-12-07 16:34:38,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-12-07 16:34:38,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 16:34:38,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-12-07 16:34:38,721 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2019-12-07 16:34:38,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:34:38,721 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-12-07 16:34:38,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 16:34:38,721 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-12-07 16:34:38,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 16:34:38,722 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:34:38,722 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:34:38,923 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:34:38,924 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:34:38,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:34:38,924 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2019-12-07 16:34:38,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:34:38,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602416653] [2019-12-07 16:34:38,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:34:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:34:39,058 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 16:34:39,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602416653] [2019-12-07 16:34:39,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726736744] [2019-12-07 16:34:39,058 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3eb1d6f7-dfa4-4f9e-8f09-407a0dd098f0/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:34:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:34:39,085 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 16:34:39,087 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:34:39,156 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 16:34:39,156 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:34:39,665 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 16:34:39,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1250419325] [2019-12-07 16:34:39,666 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:34:39,666 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:34:39,667 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 16:34:39,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:34:39,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 13] total 26 [2019-12-07 16:34:39,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25963248] [2019-12-07 16:34:39,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 16:34:39,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:34:39,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 16:34:39,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2019-12-07 16:34:39,668 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 26 states. [2019-12-07 16:34:39,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:34:39,829 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-12-07 16:34:39,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 16:34:39,829 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 33 [2019-12-07 16:34:39,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:34:39,830 INFO L225 Difference]: With dead ends: 30 [2019-12-07 16:34:39,830 INFO L226 Difference]: Without dead ends: 26 [2019-12-07 16:34:39,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 49 SyntacticMatches, 10 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=234, Invalid=956, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 16:34:39,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-07 16:34:39,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-12-07 16:34:39,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 16:34:39,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-12-07 16:34:39,834 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2019-12-07 16:34:39,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:34:39,834 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-12-07 16:34:39,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 16:34:39,835 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-12-07 16:34:39,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 16:34:39,835 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:34:39,836 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:34:40,036 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:34:40,037 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:34:40,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:34:40,038 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2019-12-07 16:34:40,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:34:40,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035913545] [2019-12-07 16:34:40,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:34:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:34:40,179 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-12-07 16:34:40,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035913545] [2019-12-07 16:34:40,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189413171] [2019-12-07 16:34:40,179 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3eb1d6f7-dfa4-4f9e-8f09-407a0dd098f0/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:34:40,207 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-07 16:34:40,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:34:40,207 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 16:34:40,209 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:34:40,273 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-12-07 16:34:40,273 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:34:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 16:34:41,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1564732945] [2019-12-07 16:34:41,063 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:34:41,063 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:34:41,064 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 16:34:41,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:34:41,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 15] total 30 [2019-12-07 16:34:41,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098024260] [2019-12-07 16:34:41,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 16:34:41,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:34:41,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 16:34:41,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2019-12-07 16:34:41,065 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 30 states. [2019-12-07 16:34:41,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:34:41,249 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-12-07 16:34:41,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 16:34:41,249 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 39 [2019-12-07 16:34:41,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:34:41,250 INFO L225 Difference]: With dead ends: 33 [2019-12-07 16:34:41,250 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 16:34:41,251 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 58 SyntacticMatches, 12 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=321, Invalid=1319, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 16:34:41,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 16:34:41,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-12-07 16:34:41,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 16:34:41,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-12-07 16:34:41,255 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2019-12-07 16:34:41,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:34:41,255 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-12-07 16:34:41,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 16:34:41,255 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-12-07 16:34:41,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 16:34:41,256 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:34:41,256 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:34:41,456 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:34:41,458 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:34:41,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:34:41,458 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2019-12-07 16:34:41,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:34:41,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325652922] [2019-12-07 16:34:41,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:34:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:34:41,620 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-12-07 16:34:41,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325652922] [2019-12-07 16:34:41,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802275527] [2019-12-07 16:34:41,620 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3eb1d6f7-dfa4-4f9e-8f09-407a0dd098f0/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:34:41,657 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 16:34:41,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:34:41,658 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 16:34:41,659 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:34:41,738 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-12-07 16:34:41,738 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:34:42,884 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 16:34:42,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1087053920] [2019-12-07 16:34:42,885 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:34:42,885 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:34:42,885 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 16:34:42,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:34:42,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 17] total 34 [2019-12-07 16:34:42,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613405652] [2019-12-07 16:34:42,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-07 16:34:42,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:34:42,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-07 16:34:42,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=964, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 16:34:42,887 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 34 states. [2019-12-07 16:34:43,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:34:43,125 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-12-07 16:34:43,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 16:34:43,126 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 45 [2019-12-07 16:34:43,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:34:43,127 INFO L225 Difference]: With dead ends: 36 [2019-12-07 16:34:43,127 INFO L226 Difference]: Without dead ends: 32 [2019-12-07 16:34:43,128 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 67 SyntacticMatches, 14 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=422, Invalid=1740, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 16:34:43,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-07 16:34:43,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-12-07 16:34:43,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 16:34:43,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-12-07 16:34:43,132 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2019-12-07 16:34:43,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:34:43,132 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-12-07 16:34:43,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-07 16:34:43,132 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-12-07 16:34:43,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 16:34:43,133 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:34:43,133 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:34:43,334 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:34:43,335 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:34:43,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:34:43,335 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2019-12-07 16:34:43,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:34:43,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432723628] [2019-12-07 16:34:43,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:34:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:34:43,516 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-12-07 16:34:43,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432723628] [2019-12-07 16:34:43,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90595554] [2019-12-07 16:34:43,516 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3eb1d6f7-dfa4-4f9e-8f09-407a0dd098f0/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:34:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:34:43,569 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 16:34:43,571 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:34:43,684 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-12-07 16:34:43,684 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:34:45,375 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 16:34:45,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [617661733] [2019-12-07 16:34:45,376 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:34:45,376 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:34:45,376 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 16:34:45,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:34:45,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 19] total 38 [2019-12-07 16:34:45,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897031479] [2019-12-07 16:34:45,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-07 16:34:45,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:34:45,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-07 16:34:45,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1211, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 16:34:45,378 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 38 states. [2019-12-07 16:34:45,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:34:45,665 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-12-07 16:34:45,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 16:34:45,665 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 51 [2019-12-07 16:34:45,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:34:45,666 INFO L225 Difference]: With dead ends: 39 [2019-12-07 16:34:45,666 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 16:34:45,667 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 76 SyntacticMatches, 16 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=537, Invalid=2219, Unknown=0, NotChecked=0, Total=2756 [2019-12-07 16:34:45,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 16:34:45,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-12-07 16:34:45,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 16:34:45,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-12-07 16:34:45,670 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2019-12-07 16:34:45,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:34:45,670 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-12-07 16:34:45,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-07 16:34:45,671 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-12-07 16:34:45,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 16:34:45,671 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:34:45,671 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:34:45,872 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:34:45,873 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:34:45,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:34:45,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2019-12-07 16:34:45,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:34:45,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219057398] [2019-12-07 16:34:45,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:34:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:34:46,068 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 16:34:46,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219057398] [2019-12-07 16:34:46,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599699943] [2019-12-07 16:34:46,069 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3eb1d6f7-dfa4-4f9e-8f09-407a0dd098f0/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:34:46,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-12-07 16:34:46,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:34:46,139 INFO L264 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 16:34:46,140 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:34:46,409 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 16:34:46,409 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:34:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 16:34:48,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1560555935] [2019-12-07 16:34:48,213 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:34:48,213 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:34:48,213 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 16:34:48,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:34:48,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 56 [2019-12-07 16:34:48,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297211085] [2019-12-07 16:34:48,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-12-07 16:34:48,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:34:48,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-12-07 16:34:48,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=2705, Unknown=0, NotChecked=0, Total=3080 [2019-12-07 16:34:48,215 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 56 states. [2019-12-07 16:34:48,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:34:48,905 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2019-12-07 16:34:48,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-07 16:34:48,906 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 57 [2019-12-07 16:34:48,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:34:48,907 INFO L225 Difference]: With dead ends: 62 [2019-12-07 16:34:48,907 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 16:34:48,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 84 SyntacticMatches, 5 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=986, Invalid=6846, Unknown=0, NotChecked=0, Total=7832 [2019-12-07 16:34:48,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 16:34:48,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-12-07 16:34:48,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 16:34:48,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-12-07 16:34:48,916 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 57 [2019-12-07 16:34:48,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:34:48,917 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-12-07 16:34:48,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-12-07 16:34:48,917 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-12-07 16:34:48,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 16:34:48,919 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:34:48,919 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:34:49,120 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:34:49,121 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:34:49,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:34:49,121 INFO L82 PathProgramCache]: Analyzing trace with hash -948911981, now seen corresponding path program 9 times [2019-12-07 16:34:49,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:34:49,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925411669] [2019-12-07 16:34:49,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:34:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:34:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:34:49,203 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 16:34:49,203 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:34:49,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:34:49 BoogieIcfgContainer [2019-12-07 16:34:49,225 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:34:49,225 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:34:49,225 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:34:49,226 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:34:49,226 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:34:36" (3/4) ... [2019-12-07 16:34:49,227 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 16:34:49,263 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3eb1d6f7-dfa4-4f9e-8f09-407a0dd098f0/bin/utaipan/witness.graphml [2019-12-07 16:34:49,263 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:34:49,264 INFO L168 Benchmark]: Toolchain (without parser) took 13068.73 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 230.2 MB). Free memory was 944.7 MB in the beginning and 907.0 MB in the end (delta: 37.8 MB). Peak memory consumption was 267.9 MB. Max. memory is 11.5 GB. [2019-12-07 16:34:49,265 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:34:49,265 INFO L168 Benchmark]: CACSL2BoogieTranslator took 181.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -137.7 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:34:49,265 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.04 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:34:49,265 INFO L168 Benchmark]: Boogie Preprocessor took 9.77 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:34:49,265 INFO L168 Benchmark]: RCFGBuilder took 134.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2019-12-07 16:34:49,266 INFO L168 Benchmark]: TraceAbstraction took 12682.27 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 145.2 MB). Free memory was 1.1 GB in the beginning and 918.4 MB in the end (delta: 144.4 MB). Peak memory consumption was 289.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:34:49,266 INFO L168 Benchmark]: Witness Printer took 37.47 ms. Allocated memory is still 1.3 GB. Free memory was 918.4 MB in the beginning and 907.0 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:34:49,267 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 181.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -137.7 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.04 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 9.77 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 134.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12682.27 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 145.2 MB). Free memory was 1.1 GB in the beginning and 918.4 MB in the end (delta: 144.4 MB). Peak memory consumption was 289.6 MB. Max. memory is 11.5 GB. * Witness Printer took 37.47 ms. Allocated memory is still 1.3 GB. Free memory was 918.4 MB in the beginning and 907.0 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int input = 15; [L11] CALL, EXPR id(input) VAL [\old(x)=15] [L5] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L6] CALL, EXPR id(x-1) VAL [\old(x)=14] [L5] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L6] CALL, EXPR id(x-1) VAL [\old(x)=13] [L5] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L6] CALL, EXPR id(x-1) VAL [\old(x)=12] [L5] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L6] CALL, EXPR id(x-1) VAL [\old(x)=11] [L5] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L6] CALL, EXPR id(x-1) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) [L11] int result = id(input); [L12] COND TRUE result == 15 [L13] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Result: UNSAFE, OverallTime: 12.6s, OverallIterations: 10, TraceHistogramMax: 16, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 72 SDtfs, 304 SDslu, 689 SDs, 0 SdLazy, 1040 SolverSat, 316 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 830 GetRequests, 429 SyntacticMatches, 75 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3792 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 684 NumberOfCodeBlocks, 684 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 848 ConstructedInterpolants, 0 QuantifiedInterpolants, 104272 SizeOfPredicates, 43 NumberOfNonLiveVariables, 696 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 25 InterpolantComputations, 1 PerfectInterpolantSequences, 832/1944 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...