./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Primes.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_0c0679e9-9d5d-4002-9f38-1702f15f2abf/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0c0679e9-9d5d-4002-9f38-1702f15f2abf/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0c0679e9-9d5d-4002-9f38-1702f15f2abf/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0c0679e9-9d5d-4002-9f38-1702f15f2abf/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Primes.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0c0679e9-9d5d-4002-9f38-1702f15f2abf/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0c0679e9-9d5d-4002-9f38-1702f15f2abf/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 82151ec4435da78821025b3100fe51201edc8f02 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 21:38:46,206 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:38:46,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:38:46,214 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:38:46,215 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:38:46,215 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:38:46,216 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:38:46,218 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:38:46,219 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:38:46,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:38:46,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:38:46,221 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:38:46,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:38:46,222 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:38:46,222 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:38:46,223 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:38:46,224 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:38:46,224 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:38:46,226 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:38:46,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:38:46,228 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:38:46,229 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:38:46,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:38:46,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:38:46,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:38:46,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:38:46,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:38:46,233 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:38:46,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:38:46,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:38:46,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:38:46,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:38:46,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:38:46,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:38:46,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:38:46,236 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:38:46,236 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:38:46,236 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:38:46,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:38:46,237 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:38:46,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:38:46,238 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0c0679e9-9d5d-4002-9f38-1702f15f2abf/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 21:38:46,247 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:38:46,247 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:38:46,248 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:38:46,248 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:38:46,248 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:38:46,248 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:38:46,248 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:38:46,248 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:38:46,249 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:38:46,249 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:38:46,249 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:38:46,249 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:38:46,249 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:38:46,249 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:38:46,249 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:38:46,250 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:38:46,250 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:38:46,250 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:38:46,250 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:38:46,250 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:38:46,250 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:38:46,250 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:38:46,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:38:46,250 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:38:46,251 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:38:46,251 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:38:46,251 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:38:46,251 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:38:46,251 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:38:46,251 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:38:46,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:38:46,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:38:46,252 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:38:46,252 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:38:46,252 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:38:46,252 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:38:46,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:38:46,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:38:46,252 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:38:46,252 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:38:46,252 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_0c0679e9-9d5d-4002-9f38-1702f15f2abf/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 -> 82151ec4435da78821025b3100fe51201edc8f02 [2019-12-07 21:38:46,351 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:38:46,360 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:38:46,363 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:38:46,364 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:38:46,364 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:38:46,365 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0c0679e9-9d5d-4002-9f38-1702f15f2abf/bin/utaipan/../../sv-benchmarks/c/recursive/Primes.c [2019-12-07 21:38:46,407 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0c0679e9-9d5d-4002-9f38-1702f15f2abf/bin/utaipan/data/04ebd8124/b956e264709047c3ae0479751bc1f063/FLAG30adb93ef [2019-12-07 21:38:46,721 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:38:46,721 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0c0679e9-9d5d-4002-9f38-1702f15f2abf/sv-benchmarks/c/recursive/Primes.c [2019-12-07 21:38:46,726 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0c0679e9-9d5d-4002-9f38-1702f15f2abf/bin/utaipan/data/04ebd8124/b956e264709047c3ae0479751bc1f063/FLAG30adb93ef [2019-12-07 21:38:46,734 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0c0679e9-9d5d-4002-9f38-1702f15f2abf/bin/utaipan/data/04ebd8124/b956e264709047c3ae0479751bc1f063 [2019-12-07 21:38:46,736 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:38:46,737 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:38:46,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:38:46,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:38:46,740 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:38:46,741 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:38:46" (1/1) ... [2019-12-07 21:38:46,743 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@202782c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:38:46, skipping insertion in model container [2019-12-07 21:38:46,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:38:46" (1/1) ... [2019-12-07 21:38:46,748 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:38:46,761 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:38:46,867 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:38:46,906 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:38:46,925 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:38:46,934 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:38:46,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:38:46 WrapperNode [2019-12-07 21:38:46,935 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:38:46,936 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:38:46,936 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:38:46,936 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:38:46,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:38:46" (1/1) ... [2019-12-07 21:38:46,949 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:38:46" (1/1) ... [2019-12-07 21:38:46,964 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:38:46,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:38:46,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:38:46,964 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:38:46,970 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:38:46" (1/1) ... [2019-12-07 21:38:46,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:38:46" (1/1) ... [2019-12-07 21:38:46,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:38:46" (1/1) ... [2019-12-07 21:38:46,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:38:46" (1/1) ... [2019-12-07 21:38:46,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:38:46" (1/1) ... [2019-12-07 21:38:46,976 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:38:46" (1/1) ... [2019-12-07 21:38:46,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:38:46" (1/1) ... [2019-12-07 21:38:46,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:38:46,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:38:46,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:38:46,979 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:38:46,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:38:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0c0679e9-9d5d-4002-9f38-1702f15f2abf/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 21:38:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2019-12-07 21:38:47,018 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2019-12-07 21:38:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2019-12-07 21:38:47,018 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2019-12-07 21:38:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:38:47,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:38:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2019-12-07 21:38:47,019 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2019-12-07 21:38:47,184 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:38:47,184 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-07 21:38:47,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:38:47 BoogieIcfgContainer [2019-12-07 21:38:47,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:38:47,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:38:47,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:38:47,189 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:38:47,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:38:46" (1/3) ... [2019-12-07 21:38:47,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf31787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:38:47, skipping insertion in model container [2019-12-07 21:38:47,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:38:46" (2/3) ... [2019-12-07 21:38:47,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf31787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:38:47, skipping insertion in model container [2019-12-07 21:38:47,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:38:47" (3/3) ... [2019-12-07 21:38:47,191 INFO L109 eAbstractionObserver]: Analyzing ICFG Primes.c [2019-12-07 21:38:47,198 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:38:47,202 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 21:38:47,209 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 21:38:47,225 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:38:47,225 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:38:47,225 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:38:47,225 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:38:47,225 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:38:47,225 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:38:47,225 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:38:47,226 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:38:47,239 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2019-12-07 21:38:47,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 21:38:47,243 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:38:47,244 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:38:47,244 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:38:47,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:38:47,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1530839267, now seen corresponding path program 1 times [2019-12-07 21:38:47,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:38:47,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550624466] [2019-12-07 21:38:47,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:38:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:38:47,351 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 21:38:47,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550624466] [2019-12-07 21:38:47,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:38:47,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:38:47,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050942768] [2019-12-07 21:38:47,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:38:47,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:38:47,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:38:47,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:38:47,367 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2019-12-07 21:38:47,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:38:47,402 INFO L93 Difference]: Finished difference Result 54 states and 76 transitions. [2019-12-07 21:38:47,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:38:47,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 21:38:47,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:38:47,411 INFO L225 Difference]: With dead ends: 54 [2019-12-07 21:38:47,411 INFO L226 Difference]: Without dead ends: 47 [2019-12-07 21:38:47,414 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:38:47,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-12-07 21:38:47,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-12-07 21:38:47,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 21:38:47,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2019-12-07 21:38:47,448 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 13 [2019-12-07 21:38:47,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:38:47,449 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2019-12-07 21:38:47,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:38:47,449 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2019-12-07 21:38:47,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 21:38:47,451 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:38:47,451 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:38:47,451 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:38:47,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:38:47,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1151819093, now seen corresponding path program 1 times [2019-12-07 21:38:47,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:38:47,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392589396] [2019-12-07 21:38:47,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:38:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:38:47,593 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 21:38:47,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392589396] [2019-12-07 21:38:47,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:38:47,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 21:38:47,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165431919] [2019-12-07 21:38:47,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 21:38:47,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:38:47,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 21:38:47,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-07 21:38:47,597 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand 12 states. [2019-12-07 21:38:47,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:38:47,787 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2019-12-07 21:38:47,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 21:38:47,788 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-12-07 21:38:47,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:38:47,791 INFO L225 Difference]: With dead ends: 64 [2019-12-07 21:38:47,791 INFO L226 Difference]: Without dead ends: 60 [2019-12-07 21:38:47,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2019-12-07 21:38:47,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-12-07 21:38:47,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2019-12-07 21:38:47,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 21:38:47,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2019-12-07 21:38:47,806 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 20 [2019-12-07 21:38:47,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:38:47,806 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2019-12-07 21:38:47,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 21:38:47,807 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2019-12-07 21:38:47,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 21:38:47,808 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:38:47,809 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:38:47,809 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:38:47,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:38:47,809 INFO L82 PathProgramCache]: Analyzing trace with hash 2047361873, now seen corresponding path program 1 times [2019-12-07 21:38:47,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:38:47,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203782087] [2019-12-07 21:38:47,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:38:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:38:47,875 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 21:38:47,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203782087] [2019-12-07 21:38:47,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:38:47,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 21:38:47,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843636283] [2019-12-07 21:38:47,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 21:38:47,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:38:47,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 21:38:47,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:38:47,876 INFO L87 Difference]: Start difference. First operand 56 states and 77 transitions. Second operand 9 states. [2019-12-07 21:38:47,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:38:47,951 INFO L93 Difference]: Finished difference Result 74 states and 101 transitions. [2019-12-07 21:38:47,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 21:38:47,952 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-07 21:38:47,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:38:47,953 INFO L225 Difference]: With dead ends: 74 [2019-12-07 21:38:47,953 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 21:38:47,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-07 21:38:47,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 21:38:47,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2019-12-07 21:38:47,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 21:38:47,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2019-12-07 21:38:47,960 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 21 [2019-12-07 21:38:47,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:38:47,960 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2019-12-07 21:38:47,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 21:38:47,960 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2019-12-07 21:38:47,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 21:38:47,962 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:38:47,962 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:38:47,962 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:38:47,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:38:47,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1016042269, now seen corresponding path program 1 times [2019-12-07 21:38:47,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:38:47,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128172722] [2019-12-07 21:38:47,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:38:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:38:48,046 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 21:38:48,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128172722] [2019-12-07 21:38:48,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:38:48,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 21:38:48,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741433695] [2019-12-07 21:38:48,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 21:38:48,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:38:48,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 21:38:48,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 21:38:48,047 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. Second operand 11 states. [2019-12-07 21:38:48,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:38:48,200 INFO L93 Difference]: Finished difference Result 81 states and 105 transitions. [2019-12-07 21:38:48,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 21:38:48,201 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-07 21:38:48,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:38:48,202 INFO L225 Difference]: With dead ends: 81 [2019-12-07 21:38:48,202 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 21:38:48,203 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-12-07 21:38:48,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 21:38:48,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2019-12-07 21:38:48,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-12-07 21:38:48,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2019-12-07 21:38:48,211 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 21 [2019-12-07 21:38:48,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:38:48,212 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2019-12-07 21:38:48,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 21:38:48,212 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2019-12-07 21:38:48,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 21:38:48,213 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:38:48,213 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:38:48,213 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:38:48,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:38:48,214 INFO L82 PathProgramCache]: Analyzing trace with hash -731830909, now seen corresponding path program 1 times [2019-12-07 21:38:48,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:38:48,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240708989] [2019-12-07 21:38:48,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:38:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:38:48,295 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 21:38:48,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240708989] [2019-12-07 21:38:48,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:38:48,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 21:38:48,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674317989] [2019-12-07 21:38:48,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 21:38:48,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:38:48,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 21:38:48,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 21:38:48,297 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. Second operand 11 states. [2019-12-07 21:38:48,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:38:48,424 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2019-12-07 21:38:48,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 21:38:48,424 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-12-07 21:38:48,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:38:48,425 INFO L225 Difference]: With dead ends: 59 [2019-12-07 21:38:48,425 INFO L226 Difference]: Without dead ends: 55 [2019-12-07 21:38:48,426 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-12-07 21:38:48,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-07 21:38:48,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2019-12-07 21:38:48,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-12-07 21:38:48,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2019-12-07 21:38:48,432 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 22 [2019-12-07 21:38:48,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:38:48,432 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2019-12-07 21:38:48,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 21:38:48,432 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2019-12-07 21:38:48,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 21:38:48,433 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:38:48,433 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:38:48,433 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:38:48,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:38:48,434 INFO L82 PathProgramCache]: Analyzing trace with hash 766139575, now seen corresponding path program 1 times [2019-12-07 21:38:48,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:38:48,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104104252] [2019-12-07 21:38:48,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:38:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:38:48,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 21:38:48,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104104252] [2019-12-07 21:38:48,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:38:48,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 21:38:48,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576975132] [2019-12-07 21:38:48,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 21:38:48,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:38:48,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 21:38:48,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-12-07 21:38:48,527 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. Second operand 14 states. [2019-12-07 21:38:48,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:38:48,726 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2019-12-07 21:38:48,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 21:38:48,726 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-12-07 21:38:48,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:38:48,727 INFO L225 Difference]: With dead ends: 64 [2019-12-07 21:38:48,727 INFO L226 Difference]: Without dead ends: 60 [2019-12-07 21:38:48,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2019-12-07 21:38:48,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-12-07 21:38:48,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2019-12-07 21:38:48,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 21:38:48,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2019-12-07 21:38:48,733 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 27 [2019-12-07 21:38:48,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:38:48,734 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2019-12-07 21:38:48,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 21:38:48,734 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2019-12-07 21:38:48,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 21:38:48,735 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:38:48,735 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:38:48,735 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:38:48,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:38:48,735 INFO L82 PathProgramCache]: Analyzing trace with hash -800009103, now seen corresponding path program 1 times [2019-12-07 21:38:48,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:38:48,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017589980] [2019-12-07 21:38:48,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:38:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:38:48,818 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 21:38:48,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017589980] [2019-12-07 21:38:48,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721173006] [2019-12-07 21:38:48,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0c0679e9-9d5d-4002-9f38-1702f15f2abf/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 21:38:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:38:48,845 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 21:38:48,849 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:38:48,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:38:48,877 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:38:48,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:38:48,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [549054152] [2019-12-07 21:38:48,951 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2019-12-07 21:38:48,951 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:38:48,955 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 21:38:48,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:38:48,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5] total 17 [2019-12-07 21:38:48,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076051175] [2019-12-07 21:38:48,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 21:38:48,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:38:48,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 21:38:48,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-12-07 21:38:48,957 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. Second operand 17 states. [2019-12-07 21:38:49,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:38:49,156 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2019-12-07 21:38:49,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 21:38:49,156 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2019-12-07 21:38:49,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:38:49,157 INFO L225 Difference]: With dead ends: 70 [2019-12-07 21:38:49,157 INFO L226 Difference]: Without dead ends: 66 [2019-12-07 21:38:49,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-12-07 21:38:49,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-12-07 21:38:49,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 51. [2019-12-07 21:38:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-12-07 21:38:49,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2019-12-07 21:38:49,163 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 28 [2019-12-07 21:38:49,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:38:49,163 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2019-12-07 21:38:49,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 21:38:49,164 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2019-12-07 21:38:49,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 21:38:49,164 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:38:49,164 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:38:49,365 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:38:49,365 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:38:49,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:38:49,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1406795475, now seen corresponding path program 1 times [2019-12-07 21:38:49,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:38:49,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398965108] [2019-12-07 21:38:49,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:38:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:38:49,419 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:38:49,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398965108] [2019-12-07 21:38:49,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704992762] [2019-12-07 21:38:49,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0c0679e9-9d5d-4002-9f38-1702f15f2abf/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 21:38:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:38:49,441 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 21:38:49,442 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:38:49,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:38:49,453 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:38:49,499 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:38:49,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [493407250] [2019-12-07 21:38:49,500 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2019-12-07 21:38:49,500 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:38:49,501 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 21:38:49,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:38:49,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2019-12-07 21:38:49,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835984815] [2019-12-07 21:38:49,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 21:38:49,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:38:49,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 21:38:49,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:38:49,502 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. Second operand 8 states. [2019-12-07 21:38:49,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:38:49,552 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2019-12-07 21:38:49,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 21:38:49,553 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-12-07 21:38:49,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:38:49,553 INFO L225 Difference]: With dead ends: 66 [2019-12-07 21:38:49,553 INFO L226 Difference]: Without dead ends: 49 [2019-12-07 21:38:49,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 21:38:49,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-07 21:38:49,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-12-07 21:38:49,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 21:38:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2019-12-07 21:38:49,558 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 29 [2019-12-07 21:38:49,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:38:49,558 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2019-12-07 21:38:49,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 21:38:49,558 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2019-12-07 21:38:49,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 21:38:49,559 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:38:49,559 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:38:49,759 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:38:49,760 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:38:49,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:38:49,760 INFO L82 PathProgramCache]: Analyzing trace with hash -687843933, now seen corresponding path program 1 times [2019-12-07 21:38:49,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:38:49,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16735544] [2019-12-07 21:38:49,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:38:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:38:49,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:38:49,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16735544] [2019-12-07 21:38:49,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146445976] [2019-12-07 21:38:49,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0c0679e9-9d5d-4002-9f38-1702f15f2abf/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 21:38:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:38:49,887 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 21:38:49,889 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:38:49,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:38:49,955 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:38:50,105 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:38:50,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [710707732] [2019-12-07 21:38:50,107 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2019-12-07 21:38:50,107 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:38:50,107 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 21:38:50,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:38:50,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2019-12-07 21:38:50,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458444939] [2019-12-07 21:38:50,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 21:38:50,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:38:50,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 21:38:50,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-12-07 21:38:50,108 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand 22 states. [2019-12-07 21:38:50,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:38:50,327 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2019-12-07 21:38:50,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 21:38:50,328 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-12-07 21:38:50,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:38:50,329 INFO L225 Difference]: With dead ends: 66 [2019-12-07 21:38:50,329 INFO L226 Difference]: Without dead ends: 52 [2019-12-07 21:38:50,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=853, Unknown=0, NotChecked=0, Total=992 [2019-12-07 21:38:50,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-07 21:38:50,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2019-12-07 21:38:50,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 21:38:50,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2019-12-07 21:38:50,334 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 30 [2019-12-07 21:38:50,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:38:50,334 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2019-12-07 21:38:50,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 21:38:50,335 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2019-12-07 21:38:50,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 21:38:50,335 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:38:50,335 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:38:50,536 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:38:50,536 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:38:50,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:38:50,537 INFO L82 PathProgramCache]: Analyzing trace with hash 361573319, now seen corresponding path program 1 times [2019-12-07 21:38:50,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:38:50,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637229587] [2019-12-07 21:38:50,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:38:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:38:50,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 21:38:50,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637229587] [2019-12-07 21:38:50,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:38:50,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 21:38:50,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19361011] [2019-12-07 21:38:50,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:38:50,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:38:50,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:38:50,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:38:50,598 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand 7 states. [2019-12-07 21:38:50,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:38:50,625 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2019-12-07 21:38:50,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:38:50,625 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-12-07 21:38:50,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:38:50,626 INFO L225 Difference]: With dead ends: 70 [2019-12-07 21:38:50,626 INFO L226 Difference]: Without dead ends: 51 [2019-12-07 21:38:50,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:38:50,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-07 21:38:50,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-12-07 21:38:50,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 21:38:50,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2019-12-07 21:38:50,630 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 32 [2019-12-07 21:38:50,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:38:50,630 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2019-12-07 21:38:50,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:38:50,630 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2019-12-07 21:38:50,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 21:38:50,631 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:38:50,631 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:38:50,631 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:38:50,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:38:50,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1068128087, now seen corresponding path program 1 times [2019-12-07 21:38:50,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:38:50,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895941752] [2019-12-07 21:38:50,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:38:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:38:50,658 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 21:38:50,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895941752] [2019-12-07 21:38:50,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:38:50,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:38:50,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642317848] [2019-12-07 21:38:50,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:38:50,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:38:50,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:38:50,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:38:50,659 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand 5 states. [2019-12-07 21:38:50,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:38:50,687 INFO L93 Difference]: Finished difference Result 101 states and 128 transitions. [2019-12-07 21:38:50,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:38:50,687 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-12-07 21:38:50,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:38:50,688 INFO L225 Difference]: With dead ends: 101 [2019-12-07 21:38:50,688 INFO L226 Difference]: Without dead ends: 49 [2019-12-07 21:38:50,689 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:38:50,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-07 21:38:50,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-12-07 21:38:50,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 21:38:50,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2019-12-07 21:38:50,692 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 50 [2019-12-07 21:38:50,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:38:50,692 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2019-12-07 21:38:50,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:38:50,692 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2019-12-07 21:38:50,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 21:38:50,693 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:38:50,693 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:38:50,693 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:38:50,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:38:50,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1846386231, now seen corresponding path program 1 times [2019-12-07 21:38:50,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:38:50,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545414483] [2019-12-07 21:38:50,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:38:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:38:50,734 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 21:38:50,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545414483] [2019-12-07 21:38:50,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008003189] [2019-12-07 21:38:50,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0c0679e9-9d5d-4002-9f38-1702f15f2abf/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 21:38:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:38:50,761 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 21:38:50,763 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:38:50,781 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 21:38:50,781 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:38:50,840 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 21:38:50,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-12-07 21:38:50,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 5] total 11 [2019-12-07 21:38:50,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971547946] [2019-12-07 21:38:50,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:38:50,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:38:50,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:38:50,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-07 21:38:50,841 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 5 states. [2019-12-07 21:38:50,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:38:50,869 INFO L93 Difference]: Finished difference Result 93 states and 113 transitions. [2019-12-07 21:38:50,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:38:50,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-07 21:38:50,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:38:50,870 INFO L225 Difference]: With dead ends: 93 [2019-12-07 21:38:50,870 INFO L226 Difference]: Without dead ends: 49 [2019-12-07 21:38:50,871 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-07 21:38:50,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-07 21:38:50,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-12-07 21:38:50,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 21:38:50,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2019-12-07 21:38:50,874 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 51 [2019-12-07 21:38:50,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:38:50,874 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2019-12-07 21:38:50,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:38:50,874 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2019-12-07 21:38:50,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 21:38:50,875 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:38:50,875 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:38:51,075 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:38:51,076 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:38:51,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:38:51,076 INFO L82 PathProgramCache]: Analyzing trace with hash -2024433465, now seen corresponding path program 1 times [2019-12-07 21:38:51,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:38:51,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825585] [2019-12-07 21:38:51,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:38:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:38:51,173 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 21:38:51,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825585] [2019-12-07 21:38:51,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938756327] [2019-12-07 21:38:51,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0c0679e9-9d5d-4002-9f38-1702f15f2abf/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 21:38:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:38:51,217 INFO L264 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 21:38:51,219 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:38:51,244 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 21:38:51,244 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:38:51,415 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 21:38:51,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [855161031] [2019-12-07 21:38:51,417 INFO L159 IcfgInterpreter]: Started Sifa with 41 locations of interest [2019-12-07 21:38:51,417 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:38:51,418 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 21:38:51,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:38:51,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2019-12-07 21:38:51,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541315112] [2019-12-07 21:38:51,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 21:38:51,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:38:51,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 21:38:51,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-07 21:38:51,419 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand 13 states. [2019-12-07 21:38:51,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:38:51,529 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2019-12-07 21:38:51,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 21:38:51,529 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-07 21:38:51,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:38:51,530 INFO L225 Difference]: With dead ends: 82 [2019-12-07 21:38:51,530 INFO L226 Difference]: Without dead ends: 55 [2019-12-07 21:38:51,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 110 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-12-07 21:38:51,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-07 21:38:51,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-12-07 21:38:51,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 21:38:51,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2019-12-07 21:38:51,534 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 60 [2019-12-07 21:38:51,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:38:51,535 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2019-12-07 21:38:51,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 21:38:51,535 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2019-12-07 21:38:51,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 21:38:51,536 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:38:51,536 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:38:51,736 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:38:51,737 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:38:51,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:38:51,737 INFO L82 PathProgramCache]: Analyzing trace with hash -217299261, now seen corresponding path program 2 times [2019-12-07 21:38:51,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:38:51,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109630813] [2019-12-07 21:38:51,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:38:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:38:51,820 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 21:38:51,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109630813] [2019-12-07 21:38:51,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992330208] [2019-12-07 21:38:51,821 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0c0679e9-9d5d-4002-9f38-1702f15f2abf/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 21:38:51,858 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 21:38:51,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:38:51,858 INFO L264 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 21:38:51,861 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:38:51,974 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 21:38:51,974 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:38:56,563 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 21:38:56,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [97363144] [2019-12-07 21:38:56,565 INFO L159 IcfgInterpreter]: Started Sifa with 41 locations of interest [2019-12-07 21:38:56,565 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:38:56,566 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:38:56,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:38:56,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 25 [2019-12-07 21:38:56,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39780465] [2019-12-07 21:38:56,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 21:38:56,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:38:56,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 21:38:56,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=508, Unknown=1, NotChecked=0, Total=600 [2019-12-07 21:38:56,567 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 25 states. [2019-12-07 21:38:56,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:38:56,856 INFO L93 Difference]: Finished difference Result 112 states and 140 transitions. [2019-12-07 21:38:56,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 21:38:56,857 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 69 [2019-12-07 21:38:56,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:38:56,858 INFO L225 Difference]: With dead ends: 112 [2019-12-07 21:38:56,858 INFO L226 Difference]: Without dead ends: 77 [2019-12-07 21:38:56,858 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 117 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=177, Invalid=814, Unknown=1, NotChecked=0, Total=992 [2019-12-07 21:38:56,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-12-07 21:38:56,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2019-12-07 21:38:56,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-07 21:38:56,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 84 transitions. [2019-12-07 21:38:56,862 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 84 transitions. Word has length 69 [2019-12-07 21:38:56,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:38:56,862 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 84 transitions. [2019-12-07 21:38:56,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 21:38:56,862 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2019-12-07 21:38:56,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 21:38:56,863 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:38:56,863 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:38:57,063 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:38:57,064 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:38:57,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:38:57,064 INFO L82 PathProgramCache]: Analyzing trace with hash -2111068321, now seen corresponding path program 1 times [2019-12-07 21:38:57,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:38:57,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990761277] [2019-12-07 21:38:57,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:38:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:38:57,095 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-12-07 21:38:57,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990761277] [2019-12-07 21:38:57,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:38:57,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:38:57,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936458887] [2019-12-07 21:38:57,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:38:57,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:38:57,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:38:57,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:38:57,097 INFO L87 Difference]: Start difference. First operand 67 states and 84 transitions. Second operand 5 states. [2019-12-07 21:38:57,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:38:57,125 INFO L93 Difference]: Finished difference Result 131 states and 179 transitions. [2019-12-07 21:38:57,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:38:57,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-12-07 21:38:57,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:38:57,126 INFO L225 Difference]: With dead ends: 131 [2019-12-07 21:38:57,126 INFO L226 Difference]: Without dead ends: 67 [2019-12-07 21:38:57,126 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:38:57,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-12-07 21:38:57,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-12-07 21:38:57,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-07 21:38:57,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2019-12-07 21:38:57,130 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 76 [2019-12-07 21:38:57,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:38:57,130 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2019-12-07 21:38:57,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:38:57,130 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2019-12-07 21:38:57,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 21:38:57,131 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:38:57,131 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:38:57,131 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:38:57,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:38:57,131 INFO L82 PathProgramCache]: Analyzing trace with hash 322011229, now seen corresponding path program 2 times [2019-12-07 21:38:57,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:38:57,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135738734] [2019-12-07 21:38:57,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:38:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:38:57,190 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 36 proven. 19 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 21:38:57,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135738734] [2019-12-07 21:38:57,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949872837] [2019-12-07 21:38:57,190 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0c0679e9-9d5d-4002-9f38-1702f15f2abf/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 21:38:57,230 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-07 21:38:57,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:38:57,231 INFO L264 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 21:38:57,232 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:38:57,307 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 41 proven. 13 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 21:38:57,307 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:38:57,727 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 21:38:57,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [454993690] [2019-12-07 21:38:57,729 INFO L159 IcfgInterpreter]: Started Sifa with 43 locations of interest [2019-12-07 21:38:57,729 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:38:57,729 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 21:38:57,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:38:57,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 21 [2019-12-07 21:38:57,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427327752] [2019-12-07 21:38:57,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 21:38:57,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:38:57,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 21:38:57,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2019-12-07 21:38:57,731 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand 21 states. [2019-12-07 21:38:57,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:38:57,867 INFO L93 Difference]: Finished difference Result 103 states and 136 transitions. [2019-12-07 21:38:57,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 21:38:57,867 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 85 [2019-12-07 21:38:57,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:38:57,867 INFO L225 Difference]: With dead ends: 103 [2019-12-07 21:38:57,867 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 21:38:57,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 154 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=616, Unknown=0, NotChecked=0, Total=812 [2019-12-07 21:38:57,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 21:38:57,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 21:38:57,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 21:38:57,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 21:38:57,868 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2019-12-07 21:38:57,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:38:57,868 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 21:38:57,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 21:38:57,868 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 21:38:57,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 21:38:58,069 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:38:58,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 21:38:58,337 INFO L246 CegarLoopResult]: For program point L33(lines 33 35) no Hoare annotation was computed. [2019-12-07 21:38:58,337 INFO L246 CegarLoopResult]: For program point L34-1(line 34) no Hoare annotation was computed. [2019-12-07 21:38:58,337 INFO L242 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (and (<= |multiple_of_#in~m| 0) (<= |multiple_of_#in~m| multiple_of_~m)) [2019-12-07 21:38:58,337 INFO L246 CegarLoopResult]: For program point L30(lines 30 32) no Hoare annotation was computed. [2019-12-07 21:38:58,338 INFO L246 CegarLoopResult]: For program point L31-1(line 31) no Hoare annotation was computed. [2019-12-07 21:38:58,338 INFO L246 CegarLoopResult]: For program point multiple_ofFINAL(lines 29 43) no Hoare annotation was computed. [2019-12-07 21:38:58,338 INFO L242 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (and (< 0 multiple_of_~n) (<= multiple_of_~m |multiple_of_#in~m|) (<= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n)) [2019-12-07 21:38:58,338 INFO L249 CegarLoopResult]: At program point multiple_ofENTRY(lines 29 43) the Hoare annotation is: true [2019-12-07 21:38:58,338 INFO L246 CegarLoopResult]: For program point L42-1(line 42) no Hoare annotation was computed. [2019-12-07 21:38:58,338 INFO L246 CegarLoopResult]: For program point L39(lines 39 41) no Hoare annotation was computed. [2019-12-07 21:38:58,338 INFO L246 CegarLoopResult]: For program point L36(lines 36 38) no Hoare annotation was computed. [2019-12-07 21:38:58,338 INFO L246 CegarLoopResult]: For program point multiple_ofEXIT(lines 29 43) no Hoare annotation was computed. [2019-12-07 21:38:58,338 INFO L242 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (and (<= multiple_of_~m |multiple_of_#in~m|) (not (= 0 multiple_of_~n)) (<= |multiple_of_#in~m| multiple_of_~m) (<= |multiple_of_#in~n| 0) (= |multiple_of_#in~n| multiple_of_~n)) [2019-12-07 21:38:58,338 INFO L249 CegarLoopResult]: At program point multENTRY(lines 15 26) the Hoare annotation is: true [2019-12-07 21:38:58,338 INFO L242 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (<= |mult_#in~m| mult_~m) (< 1 mult_~m) (<= |mult_#in~n| mult_~n)) [2019-12-07 21:38:58,338 INFO L246 CegarLoopResult]: For program point L25-1(line 25) no Hoare annotation was computed. [2019-12-07 21:38:58,338 INFO L246 CegarLoopResult]: For program point L22(lines 22 24) no Hoare annotation was computed. [2019-12-07 21:38:58,338 INFO L246 CegarLoopResult]: For program point L19(lines 19 21) no Hoare annotation was computed. [2019-12-07 21:38:58,338 INFO L242 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (<= |mult_#in~m| mult_~m) (<= (+ mult_~m |mult_#in~m| 2) 0)) [2019-12-07 21:38:58,339 INFO L246 CegarLoopResult]: For program point L16(lines 16 18) no Hoare annotation was computed. [2019-12-07 21:38:58,339 INFO L246 CegarLoopResult]: For program point L17-1(line 17) no Hoare annotation was computed. [2019-12-07 21:38:58,339 INFO L246 CegarLoopResult]: For program point multFINAL(lines 15 26) no Hoare annotation was computed. [2019-12-07 21:38:58,339 INFO L246 CegarLoopResult]: For program point multEXIT(lines 15 26) no Hoare annotation was computed. [2019-12-07 21:38:58,339 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 21:38:58,339 INFO L246 CegarLoopResult]: For program point L95(line 95) no Hoare annotation was computed. [2019-12-07 21:38:58,339 INFO L242 CegarLoopResult]: At program point L95-1(line 95) the Hoare annotation is: (and (<= ULTIMATE.start_main_~n~0 2) (= ULTIMATE.start_main_~n~0 ULTIMATE.start_is_prime_~n) (<= 2 ULTIMATE.start_main_~n~0) (<= 1 ULTIMATE.start_main_~f2~0)) [2019-12-07 21:38:58,339 INFO L246 CegarLoopResult]: For program point L95-2(line 95) no Hoare annotation was computed. [2019-12-07 21:38:58,339 INFO L246 CegarLoopResult]: For program point L95-4(lines 95 99) no Hoare annotation was computed. [2019-12-07 21:38:58,339 INFO L246 CegarLoopResult]: For program point L89(lines 89 93) no Hoare annotation was computed. [2019-12-07 21:38:58,339 INFO L246 CegarLoopResult]: For program point L83(lines 83 87) no Hoare annotation was computed. [2019-12-07 21:38:58,339 INFO L249 CegarLoopResult]: At program point L98(lines 74 100) the Hoare annotation is: true [2019-12-07 21:38:58,339 INFO L246 CegarLoopResult]: For program point L96(line 96) no Hoare annotation was computed. [2019-12-07 21:38:58,339 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 21:38:58,339 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 96) no Hoare annotation was computed. [2019-12-07 21:38:58,339 INFO L242 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (and (= ULTIMATE.start_is_prime_~n ULTIMATE.start_main_~n~0) (<= 1 ULTIMATE.start_main_~n~0)) [2019-12-07 21:38:58,339 INFO L242 CegarLoopResult]: At program point L51-1(line 51) the Hoare annotation is: (or (and (<= |ULTIMATE.start_is_prime_#t~ret5| 0) (<= 1 ULTIMATE.start_main_~n~0)) (and (<= ULTIMATE.start_main_~n~0 2) (= ULTIMATE.start_main_~n~0 ULTIMATE.start_is_prime_~n) (<= 2 ULTIMATE.start_main_~n~0))) [2019-12-07 21:38:58,340 INFO L246 CegarLoopResult]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-12-07 21:38:58,340 INFO L246 CegarLoopResult]: For program point L66-1(line 66) no Hoare annotation was computed. [2019-12-07 21:38:58,340 INFO L246 CegarLoopResult]: For program point is_prime_EXIT(lines 55 72) no Hoare annotation was computed. [2019-12-07 21:38:58,340 INFO L246 CegarLoopResult]: For program point L66-2(lines 66 68) no Hoare annotation was computed. [2019-12-07 21:38:58,340 INFO L246 CegarLoopResult]: For program point L63(lines 63 70) no Hoare annotation was computed. [2019-12-07 21:38:58,340 INFO L246 CegarLoopResult]: For program point L62(lines 62 71) no Hoare annotation was computed. [2019-12-07 21:38:58,340 INFO L246 CegarLoopResult]: For program point is_prime_FINAL(lines 55 72) no Hoare annotation was computed. [2019-12-07 21:38:58,340 INFO L249 CegarLoopResult]: At program point is_prime_ENTRY(lines 55 72) the Hoare annotation is: true [2019-12-07 21:38:58,340 INFO L246 CegarLoopResult]: For program point L59(lines 59 61) no Hoare annotation was computed. [2019-12-07 21:38:58,340 INFO L246 CegarLoopResult]: For program point L56(lines 56 58) no Hoare annotation was computed. [2019-12-07 21:38:58,340 INFO L242 CegarLoopResult]: At program point L69(line 69) the Hoare annotation is: (and (<= |is_prime__#in~m| is_prime__~m) (let ((.cse0 (= |is_prime__#in~n| is_prime__~n)) (.cse1 (<= is_prime__~m |is_prime__#in~m|))) (or (and .cse0 .cse1 (exists ((|v_multiple_of_#in~n_AFTER_CALL_6| Int)) (and (<= |is_prime__#in~m| (div |v_multiple_of_#in~n_AFTER_CALL_6| 2)) (<= |v_multiple_of_#in~n_AFTER_CALL_6| is_prime__~n))) (<= (+ |is_prime__#in~m| 2) (* 2 is_prime__~m))) (and .cse0 (< 2 is_prime__~n) .cse1 (<= |is_prime__#in~n| |is_prime__#in~m|))))) [2019-12-07 21:38:58,340 INFO L246 CegarLoopResult]: For program point L69-1(line 69) no Hoare annotation was computed. [2019-12-07 21:38:58,340 INFO L242 CegarLoopResult]: At program point L66(line 66) the Hoare annotation is: (and (= |is_prime__#in~n| is_prime__~n) (<= is_prime__~m |is_prime__#in~m|) (<= |is_prime__#in~m| is_prime__~m) (<= 3 |is_prime__#in~n|) (<= (+ |is_prime__#in~m| 2) (* 2 is_prime__~m))) [2019-12-07 21:38:58,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:38:58 BoogieIcfgContainer [2019-12-07 21:38:58,353 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:38:58,354 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:38:58,354 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:38:58,354 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:38:58,355 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:38:47" (3/4) ... [2019-12-07 21:38:58,357 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 21:38:58,362 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure multiple_of [2019-12-07 21:38:58,362 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure mult [2019-12-07 21:38:58,362 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_prime_ [2019-12-07 21:38:58,366 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-12-07 21:38:58,367 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 21:38:58,408 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0c0679e9-9d5d-4002-9f38-1702f15f2abf/bin/utaipan/witness.graphml [2019-12-07 21:38:58,408 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:38:58,410 INFO L168 Benchmark]: Toolchain (without parser) took 11672.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 940.8 MB in the beginning and 899.8 MB in the end (delta: 41.0 MB). Peak memory consumption was 200.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:38:58,410 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:38:58,411 INFO L168 Benchmark]: CACSL2BoogieTranslator took 197.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -160.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-12-07 21:38:58,411 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.18 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 21:38:58,411 INFO L168 Benchmark]: Boogie Preprocessor took 15.09 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 21:38:58,411 INFO L168 Benchmark]: RCFGBuilder took 206.05 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: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2019-12-07 21:38:58,412 INFO L168 Benchmark]: TraceAbstraction took 11167.37 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 51.4 MB). Free memory was 1.1 GB in the beginning and 902.1 MB in the end (delta: 172.4 MB). Peak memory consumption was 223.8 MB. Max. memory is 11.5 GB. [2019-12-07 21:38:58,412 INFO L168 Benchmark]: Witness Printer took 54.14 ms. Allocated memory is still 1.2 GB. Free memory was 902.1 MB in the beginning and 899.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 11.5 GB. [2019-12-07 21:38:58,414 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 197.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -160.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.18 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 15.09 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 206.05 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: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11167.37 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 51.4 MB). Free memory was 1.1 GB in the beginning and 902.1 MB in the end (delta: 172.4 MB). Peak memory consumption was 223.8 MB. Max. memory is 11.5 GB. * Witness Printer took 54.14 ms. Allocated memory is still 1.2 GB. Free memory was 902.1 MB in the beginning and 899.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 96]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: (aux-is_prime_(n, n - 1)-aux <= 0 && 1 <= n) || ((n <= 2 && n == n) && 2 <= n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 49 locations, 1 error locations. Result: SAFE, OverallTime: 10.8s, OverallIterations: 16, TraceHistogramMax: 5, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 751 SDtfs, 561 SDslu, 4129 SDs, 0 SdLazy, 2260 SolverSat, 206 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 913 GetRequests, 644 SyntacticMatches, 37 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=14, 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, 16 MinimizatonAttempts, 55 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 173 PreInvPairs, 203 NumberOfFragments, 161 HoareAnnotationTreeSize, 173 FomulaSimplifications, 282 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 14 FomulaSimplificationsInter, 156 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 986 NumberOfCodeBlocks, 977 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1308 ConstructedInterpolants, 22 QuantifiedInterpolants, 207296 SizeOfPredicates, 40 NumberOfNonLiveVariables, 987 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 30 InterpolantComputations, 10 PerfectInterpolantSequences, 393/569 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...