./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i --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_6f5739e3-9209-4a11-b339-dfb933abe5d0/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/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 db17479a00afa98e4ce70a37e790a923b748e4dc .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/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 db17479a00afa98e4ce70a37e790a923b748e4dc ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 20:40:27,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:40:27,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:40:27,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:40:27,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:40:27,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:40:27,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:40:27,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:40:27,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:40:27,879 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:40:27,880 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:40:27,881 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:40:27,881 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:40:27,881 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:40:27,882 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:40:27,883 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:40:27,883 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:40:27,884 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:40:27,886 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:40:27,887 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:40:27,888 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:40:27,889 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:40:27,890 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:40:27,890 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:40:27,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:40:27,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:40:27,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:40:27,893 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:40:27,893 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:40:27,894 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:40:27,894 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:40:27,894 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:40:27,895 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:40:27,895 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:40:27,896 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:40:27,896 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:40:27,896 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:40:27,897 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:40:27,897 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:40:27,897 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:40:27,898 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:40:27,898 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:40:27,908 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:40:27,908 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:40:27,909 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:40:27,909 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:40:27,909 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:40:27,909 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:40:27,909 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:40:27,909 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:40:27,909 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:40:27,909 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:40:27,910 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:40:27,910 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:40:27,910 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:40:27,910 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:40:27,910 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:40:27,910 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:40:27,911 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:40:27,911 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:40:27,911 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:40:27,911 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:40:27,911 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:40:27,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:40:27,911 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:40:27,912 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:40:27,912 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:40:27,912 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:40:27,912 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:40:27,912 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:40:27,912 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:40:27,912 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:40:27,913 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:40:27,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:40:27,913 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:40:27,913 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:40:27,913 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:40:27,913 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:40:27,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:40:27,914 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:40:27,914 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:40:27,914 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:40:27,914 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_6f5739e3-9209-4a11-b339-dfb933abe5d0/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 -> db17479a00afa98e4ce70a37e790a923b748e4dc [2019-12-07 20:40:28,015 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:40:28,026 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:40:28,028 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:40:28,030 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:40:28,030 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:40:28,031 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/bin/utaipan/../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2019-12-07 20:40:28,074 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/bin/utaipan/data/38e317ee3/d44190caa20a44968962378a9ca3e5d7/FLAG2d9935606 [2019-12-07 20:40:28,547 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:40:28,547 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2019-12-07 20:40:28,556 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/bin/utaipan/data/38e317ee3/d44190caa20a44968962378a9ca3e5d7/FLAG2d9935606 [2019-12-07 20:40:28,565 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/bin/utaipan/data/38e317ee3/d44190caa20a44968962378a9ca3e5d7 [2019-12-07 20:40:28,567 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:40:28,568 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:40:28,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:40:28,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:40:28,571 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:40:28,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:40:28" (1/1) ... [2019-12-07 20:40:28,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2833034c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:40:28, skipping insertion in model container [2019-12-07 20:40:28,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:40:28" (1/1) ... [2019-12-07 20:40:28,578 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:40:28,602 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:40:28,807 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:40:28,813 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:40:28,844 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:40:28,877 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:40:28,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:40:28 WrapperNode [2019-12-07 20:40:28,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:40:28,878 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:40:28,878 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:40:28,878 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:40:28,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:40:28" (1/1) ... [2019-12-07 20:40:28,894 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:40:28" (1/1) ... [2019-12-07 20:40:28,910 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:40:28,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:40:28,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:40:28,911 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:40:28,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:40:28" (1/1) ... [2019-12-07 20:40:28,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:40:28" (1/1) ... [2019-12-07 20:40:28,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:40:28" (1/1) ... [2019-12-07 20:40:28,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:40:28" (1/1) ... [2019-12-07 20:40:28,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:40:28" (1/1) ... [2019-12-07 20:40:28,928 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:40:28" (1/1) ... [2019-12-07 20:40:28,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:40:28" (1/1) ... [2019-12-07 20:40:28,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:40:28,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:40:28,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:40:28,933 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:40:28,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:40:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/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 20:40:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 20:40:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 20:40:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 20:40:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 20:40:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 20:40:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 20:40:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:40:28,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:40:29,262 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:40:29,263 INFO L287 CfgBuilder]: Removed 26 assume(true) statements. [2019-12-07 20:40:29,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:40:29 BoogieIcfgContainer [2019-12-07 20:40:29,264 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:40:29,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:40:29,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:40:29,266 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:40:29,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:40:28" (1/3) ... [2019-12-07 20:40:29,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aefd847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:40:29, skipping insertion in model container [2019-12-07 20:40:29,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:40:28" (2/3) ... [2019-12-07 20:40:29,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aefd847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:40:29, skipping insertion in model container [2019-12-07 20:40:29,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:40:29" (3/3) ... [2019-12-07 20:40:29,268 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2019-12-07 20:40:29,274 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:40:29,279 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 20:40:29,286 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 20:40:29,301 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:40:29,301 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:40:29,301 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:40:29,301 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:40:29,301 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:40:29,301 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:40:29,301 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:40:29,301 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:40:29,310 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-12-07 20:40:29,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 20:40:29,314 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:40:29,314 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:40:29,314 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:40:29,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:40:29,318 INFO L82 PathProgramCache]: Analyzing trace with hash 992647339, now seen corresponding path program 1 times [2019-12-07 20:40:29,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:40:29,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690769584] [2019-12-07 20:40:29,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:40:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:40:29,443 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 20:40:29,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690769584] [2019-12-07 20:40:29,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:40:29,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:40:29,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858272164] [2019-12-07 20:40:29,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:40:29,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:40:29,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:40:29,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:40:29,457 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-12-07 20:40:29,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:40:29,485 INFO L93 Difference]: Finished difference Result 33 states and 50 transitions. [2019-12-07 20:40:29,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:40:29,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-07 20:40:29,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:40:29,492 INFO L225 Difference]: With dead ends: 33 [2019-12-07 20:40:29,492 INFO L226 Difference]: Without dead ends: 13 [2019-12-07 20:40:29,494 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:40:29,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-12-07 20:40:29,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-12-07 20:40:29,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-12-07 20:40:29,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-12-07 20:40:29,515 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 8 [2019-12-07 20:40:29,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:40:29,516 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-12-07 20:40:29,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:40:29,516 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2019-12-07 20:40:29,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 20:40:29,516 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:40:29,516 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:40:29,516 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:40:29,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:40:29,516 INFO L82 PathProgramCache]: Analyzing trace with hash 114583931, now seen corresponding path program 1 times [2019-12-07 20:40:29,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:40:29,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390378147] [2019-12-07 20:40:29,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:40:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:40:29,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:40:29,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390378147] [2019-12-07 20:40:29,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:40:29,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:40:29,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915296753] [2019-12-07 20:40:29,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:40:29,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:40:29,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:40:29,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:40:29,562 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 4 states. [2019-12-07 20:40:29,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:40:29,587 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2019-12-07 20:40:29,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:40:29,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 20:40:29,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:40:29,587 INFO L225 Difference]: With dead ends: 24 [2019-12-07 20:40:29,587 INFO L226 Difference]: Without dead ends: 19 [2019-12-07 20:40:29,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:40:29,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-12-07 20:40:29,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 13. [2019-12-07 20:40:29,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-12-07 20:40:29,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-12-07 20:40:29,591 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 10 [2019-12-07 20:40:29,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:40:29,591 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-12-07 20:40:29,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:40:29,591 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2019-12-07 20:40:29,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 20:40:29,592 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:40:29,592 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:40:29,592 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:40:29,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:40:29,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1436073605, now seen corresponding path program 1 times [2019-12-07 20:40:29,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:40:29,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653926513] [2019-12-07 20:40:29,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:40:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:40:29,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:40:29,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653926513] [2019-12-07 20:40:29,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485200132] [2019-12-07 20:40:29,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/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 20:40:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:40:29,720 INFO L264 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 20:40:29,723 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:40:29,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:40:29,754 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:40:29,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:40:29,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:40:29,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [7] total 9 [2019-12-07 20:40:29,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990952325] [2019-12-07 20:40:29,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:40:29,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:40:29,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:40:29,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:40:29,774 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand 5 states. [2019-12-07 20:40:29,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:40:29,815 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2019-12-07 20:40:29,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:40:29,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-12-07 20:40:29,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:40:29,816 INFO L225 Difference]: With dead ends: 27 [2019-12-07 20:40:29,816 INFO L226 Difference]: Without dead ends: 20 [2019-12-07 20:40:29,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-07 20:40:29,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-12-07 20:40:29,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2019-12-07 20:40:29,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-12-07 20:40:29,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-12-07 20:40:29,819 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 12 [2019-12-07 20:40:29,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:40:29,819 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-12-07 20:40:29,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:40:29,820 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2019-12-07 20:40:29,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 20:40:29,820 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:40:29,820 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:40:30,020 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:40:30,021 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:40:30,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:40:30,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1355958553, now seen corresponding path program 1 times [2019-12-07 20:40:30,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:40:30,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167064556] [2019-12-07 20:40:30,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:40:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:40:30,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:40:30,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167064556] [2019-12-07 20:40:30,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914634874] [2019-12-07 20:40:30,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/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 20:40:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:40:30,154 INFO L264 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 20:40:30,156 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:40:30,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 20:40:30,178 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:40:30,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 20:40:30,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1751476388] [2019-12-07 20:40:30,214 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-12-07 20:40:30,215 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:40:30,219 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:40:30,223 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:40:30,223 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:40:30,326 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:40:30,489 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:40:30,713 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:40:30,866 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:40:31,004 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:40:31,093 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:40:31,331 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:40:31,904 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:40:31,935 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:40:32,424 WARN L192 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 99 [2019-12-07 20:40:32,596 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 73 [2019-12-07 20:40:33,428 WARN L192 SmtUtils]: Spent 757.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 148 [2019-12-07 20:40:33,622 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-12-07 20:40:34,048 WARN L192 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 82 [2019-12-07 20:40:34,419 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 98 [2019-12-07 20:40:34,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:40:34,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 4, 4] total 17 [2019-12-07 20:40:34,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113547254] [2019-12-07 20:40:34,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 20:40:34,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:40:34,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 20:40:34,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-12-07 20:40:34,421 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand 9 states. [2019-12-07 20:40:34,616 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 72 [2019-12-07 20:40:35,124 WARN L192 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 145 [2019-12-07 20:40:35,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:40:35,221 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2019-12-07 20:40:35,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 20:40:35,221 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-12-07 20:40:35,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:40:35,222 INFO L225 Difference]: With dead ends: 30 [2019-12-07 20:40:35,222 INFO L226 Difference]: Without dead ends: 25 [2019-12-07 20:40:35,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-12-07 20:40:35,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-12-07 20:40:35,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2019-12-07 20:40:35,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-12-07 20:40:35,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-12-07 20:40:35,231 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 13 [2019-12-07 20:40:35,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:40:35,231 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-12-07 20:40:35,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 20:40:35,231 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2019-12-07 20:40:35,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 20:40:35,232 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:40:35,232 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:40:35,432 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:40:35,433 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:40:35,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:40:35,433 INFO L82 PathProgramCache]: Analyzing trace with hash 913074409, now seen corresponding path program 1 times [2019-12-07 20:40:35,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:40:35,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892103920] [2019-12-07 20:40:35,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:40:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:40:35,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 20:40:35,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892103920] [2019-12-07 20:40:35,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894945210] [2019-12-07 20:40:35,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/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 20:40:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:40:35,521 INFO L264 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 20:40:35,522 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:40:35,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 20:40:35,524 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:40:35,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 20:40:35,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [44201208] [2019-12-07 20:40:35,536 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-12-07 20:40:35,536 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:40:35,537 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:40:35,537 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:40:35,537 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:40:35,570 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:40:35,657 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:40:35,781 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:40:35,876 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:40:35,988 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:40:36,056 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:40:36,270 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:40:36,860 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:40:36,890 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:40:37,131 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 100 [2019-12-07 20:40:37,572 WARN L192 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 99 [2019-12-07 20:40:37,736 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 72 [2019-12-07 20:40:38,355 WARN L192 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 148 [2019-12-07 20:40:38,525 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-12-07 20:40:38,944 WARN L192 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 84 [2019-12-07 20:40:39,162 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2019-12-07 20:40:39,443 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 100 [2019-12-07 20:40:39,445 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:40:39,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:40:39,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2019-12-07 20:40:39,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885007839] [2019-12-07 20:40:39,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:40:39,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:40:39,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:40:39,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-12-07 20:40:39,446 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand 6 states. [2019-12-07 20:40:39,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:40:39,528 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2019-12-07 20:40:39,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:40:39,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-12-07 20:40:39,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:40:39,529 INFO L225 Difference]: With dead ends: 30 [2019-12-07 20:40:39,529 INFO L226 Difference]: Without dead ends: 23 [2019-12-07 20:40:39,529 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2019-12-07 20:40:39,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-12-07 20:40:39,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2019-12-07 20:40:39,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-12-07 20:40:39,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2019-12-07 20:40:39,535 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 14 [2019-12-07 20:40:39,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:40:39,535 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-12-07 20:40:39,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:40:39,535 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2019-12-07 20:40:39,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 20:40:39,536 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:40:39,536 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:40:39,736 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:40:39,737 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:40:39,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:40:39,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1835213847, now seen corresponding path program 2 times [2019-12-07 20:40:39,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:40:39,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944404897] [2019-12-07 20:40:39,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:40:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:40:40,135 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:40:40,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944404897] [2019-12-07 20:40:40,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573159901] [2019-12-07 20:40:40,135 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/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 20:40:40,204 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 20:40:40,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:40:40,206 WARN L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 113 conjunts are in the unsatisfiable core [2019-12-07 20:40:40,209 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:40:41,568 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:40:41,568 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:40:43,276 WARN L192 SmtUtils]: Spent 1.25 s on a formula simplification that was a NOOP. DAG size: 48 [2019-12-07 20:40:54,077 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 77 [2019-12-07 20:41:09,894 WARN L192 SmtUtils]: Spent 4.34 s on a formula simplification that was a NOOP. DAG size: 97 [2019-12-07 20:41:10,042 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-12-07 20:41:10,226 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-12-07 20:41:10,367 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@78618676 [2019-12-07 20:41:10,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1492199834] [2019-12-07 20:41:10,368 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-12-07 20:41:10,368 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:41:10,369 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:41:10,369 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:41:10,369 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:41:10,381 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@78618676 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.assertLhs(IncrementalPlicationChecker.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ArrayIndexEqualityManager.(ArrayIndexEqualityManager.java:91) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:555) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:428) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:234) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:146) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:279) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) 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 20:41:10,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:41:10,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-12-07 20:41:10,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165996395] [2019-12-07 20:41:10,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 20:41:10,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:41:10,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 20:41:10,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1354, Unknown=3, NotChecked=0, Total=1482 [2019-12-07 20:41:10,384 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand 16 states. [2019-12-07 20:41:10,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 20:41:10,584 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:41:10,584 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@78618676 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) 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 20:41:10,587 INFO L168 Benchmark]: Toolchain (without parser) took 42018.65 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 466.6 MB). Free memory was 932.6 MB in the beginning and 1.0 GB in the end (delta: -87.7 MB). Peak memory consumption was 378.9 MB. Max. memory is 11.5 GB. [2019-12-07 20:41:10,587 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:41:10,587 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -166.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-12-07 20:41:10,587 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:41:10,587 INFO L168 Benchmark]: Boogie Preprocessor took 21.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:41:10,588 INFO L168 Benchmark]: RCFGBuilder took 330.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 11.5 GB. [2019-12-07 20:41:10,588 INFO L168 Benchmark]: TraceAbstraction took 41321.74 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 337.6 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 27.7 MB). Peak memory consumption was 365.3 MB. Max. memory is 11.5 GB. [2019-12-07 20:41:10,589 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 308.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -166.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 330.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 41321.74 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 337.6 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 27.7 MB). Peak memory consumption was 365.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@78618676 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@78618676: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 20:41:11,999 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:41:12,000 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:41:12,008 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:41:12,008 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:41:12,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:41:12,010 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:41:12,011 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:41:12,012 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:41:12,013 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:41:12,014 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:41:12,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:41:12,015 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:41:12,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:41:12,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:41:12,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:41:12,017 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:41:12,018 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:41:12,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:41:12,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:41:12,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:41:12,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:41:12,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:41:12,024 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:41:12,026 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:41:12,026 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:41:12,026 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:41:12,027 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:41:12,027 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:41:12,028 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:41:12,028 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:41:12,028 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:41:12,029 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:41:12,029 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:41:12,030 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:41:12,030 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:41:12,030 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:41:12,031 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:41:12,031 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:41:12,031 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:41:12,032 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:41:12,032 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-12-07 20:41:12,042 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:41:12,042 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:41:12,043 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:41:12,043 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:41:12,043 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:41:12,043 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:41:12,044 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:41:12,044 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:41:12,044 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:41:12,044 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:41:12,044 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:41:12,044 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:41:12,045 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:41:12,045 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:41:12,045 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:41:12,045 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:41:12,045 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:41:12,045 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 20:41:12,045 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 20:41:12,046 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:41:12,046 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:41:12,046 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:41:12,046 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:41:12,046 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:41:12,046 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 20:41:12,046 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:41:12,046 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:41:12,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:41:12,047 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:41:12,047 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:41:12,047 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:41:12,047 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 20:41:12,047 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 20:41:12,047 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:41:12,047 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:41:12,048 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:41:12,048 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_6f5739e3-9209-4a11-b339-dfb933abe5d0/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 -> db17479a00afa98e4ce70a37e790a923b748e4dc [2019-12-07 20:41:12,208 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:41:12,217 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:41:12,219 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:41:12,220 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:41:12,220 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:41:12,220 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/bin/utaipan/../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2019-12-07 20:41:12,259 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/bin/utaipan/data/9361a620b/8b640a07162a4a8eb0f18ef6404ee222/FLAGbf6b4ab9b [2019-12-07 20:41:12,704 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:41:12,704 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2019-12-07 20:41:12,713 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/bin/utaipan/data/9361a620b/8b640a07162a4a8eb0f18ef6404ee222/FLAGbf6b4ab9b [2019-12-07 20:41:13,037 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/bin/utaipan/data/9361a620b/8b640a07162a4a8eb0f18ef6404ee222 [2019-12-07 20:41:13,039 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:41:13,040 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:41:13,041 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:41:13,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:41:13,043 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:41:13,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:41:13" (1/1) ... [2019-12-07 20:41:13,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43ab5c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:41:13, skipping insertion in model container [2019-12-07 20:41:13,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:41:13" (1/1) ... [2019-12-07 20:41:13,051 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:41:13,081 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:41:13,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:41:13,315 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:41:13,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:41:13,387 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:41:13,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:41:13 WrapperNode [2019-12-07 20:41:13,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:41:13,388 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:41:13,388 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:41:13,388 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:41:13,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:41:13" (1/1) ... [2019-12-07 20:41:13,406 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:41:13" (1/1) ... [2019-12-07 20:41:13,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:41:13,423 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:41:13,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:41:13,423 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:41:13,429 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:41:13" (1/1) ... [2019-12-07 20:41:13,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:41:13" (1/1) ... [2019-12-07 20:41:13,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:41:13" (1/1) ... [2019-12-07 20:41:13,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:41:13" (1/1) ... [2019-12-07 20:41:13,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:41:13" (1/1) ... [2019-12-07 20:41:13,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:41:13" (1/1) ... [2019-12-07 20:41:13,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:41:13" (1/1) ... [2019-12-07 20:41:13,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:41:13,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:41:13,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:41:13,449 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:41:13,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:41:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/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 20:41:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 20:41:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 20:41:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 20:41:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 20:41:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 20:41:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 20:41:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:41:13,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:41:13,744 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:41:13,744 INFO L287 CfgBuilder]: Removed 26 assume(true) statements. [2019-12-07 20:41:13,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:41:13 BoogieIcfgContainer [2019-12-07 20:41:13,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:41:13,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:41:13,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:41:13,748 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:41:13,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:41:13" (1/3) ... [2019-12-07 20:41:13,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d90e88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:41:13, skipping insertion in model container [2019-12-07 20:41:13,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:41:13" (2/3) ... [2019-12-07 20:41:13,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d90e88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:41:13, skipping insertion in model container [2019-12-07 20:41:13,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:41:13" (3/3) ... [2019-12-07 20:41:13,751 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2019-12-07 20:41:13,757 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:41:13,762 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 20:41:13,769 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 20:41:13,783 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:41:13,783 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:41:13,783 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:41:13,784 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:41:13,784 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:41:13,784 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:41:13,784 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:41:13,784 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:41:13,793 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2019-12-07 20:41:13,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 20:41:13,797 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:41:13,797 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:41:13,797 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:41:13,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:41:13,801 INFO L82 PathProgramCache]: Analyzing trace with hash 680767129, now seen corresponding path program 1 times [2019-12-07 20:41:13,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:41:13,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57205762] [2019-12-07 20:41:13,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 20:41:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:13,876 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 1 conjunts are in the unsatisfiable core [2019-12-07 20:41:13,880 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:41:13,890 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 20:41:13,890 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:41:13,894 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 20:41:13,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57205762] [2019-12-07 20:41:13,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:41:13,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 20:41:13,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650324234] [2019-12-07 20:41:13,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 20:41:13,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:41:13,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 20:41:13,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 20:41:13,909 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2019-12-07 20:41:13,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:41:13,922 INFO L93 Difference]: Finished difference Result 57 states and 83 transitions. [2019-12-07 20:41:13,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 20:41:13,922 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-12-07 20:41:13,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:41:13,929 INFO L225 Difference]: With dead ends: 57 [2019-12-07 20:41:13,929 INFO L226 Difference]: Without dead ends: 24 [2019-12-07 20:41:13,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 20:41:13,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-07 20:41:13,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-07 20:41:13,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 20:41:13,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-12-07 20:41:13,953 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2019-12-07 20:41:13,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:41:13,954 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-12-07 20:41:13,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 20:41:13,954 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-12-07 20:41:13,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 20:41:13,954 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:41:13,954 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:41:14,155 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 20:41:14,155 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:41:14,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:41:14,156 INFO L82 PathProgramCache]: Analyzing trace with hash 68282379, now seen corresponding path program 1 times [2019-12-07 20:41:14,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:41:14,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177134236] [2019-12-07 20:41:14,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 20:41:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:14,283 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 20:41:14,285 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:41:14,301 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 20:41:14,301 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:41:14,311 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 20:41:14,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177134236] [2019-12-07 20:41:14,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:41:14,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 20:41:14,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636852717] [2019-12-07 20:41:14,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:41:14,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:41:14,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:41:14,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:41:14,314 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 4 states. [2019-12-07 20:41:14,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:41:14,342 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2019-12-07 20:41:14,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:41:14,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 20:41:14,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:41:14,343 INFO L225 Difference]: With dead ends: 43 [2019-12-07 20:41:14,343 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 20:41:14,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:41:14,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 20:41:14,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-12-07 20:41:14,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-07 20:41:14,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-12-07 20:41:14,348 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 16 [2019-12-07 20:41:14,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:41:14,348 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-12-07 20:41:14,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:41:14,348 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-12-07 20:41:14,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 20:41:14,348 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:41:14,349 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 20:41:14,549 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 20:41:14,549 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:41:14,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:41:14,550 INFO L82 PathProgramCache]: Analyzing trace with hash -301628989, now seen corresponding path program 1 times [2019-12-07 20:41:14,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:41:14,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281177246] [2019-12-07 20:41:14,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 20:41:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:14,641 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 20:41:14,642 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:41:14,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:41:14,655 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:41:14,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:41:14,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281177246] [2019-12-07 20:41:14,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:41:14,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 20:41:14,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687420478] [2019-12-07 20:41:14,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:41:14,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:41:14,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:41:14,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:41:14,676 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 6 states. [2019-12-07 20:41:14,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:41:14,735 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2019-12-07 20:41:14,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:41:14,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-12-07 20:41:14,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:41:14,737 INFO L225 Difference]: With dead ends: 48 [2019-12-07 20:41:14,737 INFO L226 Difference]: Without dead ends: 39 [2019-12-07 20:41:14,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:41:14,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-12-07 20:41:14,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2019-12-07 20:41:14,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 20:41:14,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-12-07 20:41:14,745 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 20 [2019-12-07 20:41:14,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:41:14,745 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-12-07 20:41:14,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:41:14,746 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-12-07 20:41:14,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 20:41:14,746 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:41:14,747 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] [2019-12-07 20:41:14,947 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 20:41:14,947 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:41:14,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:41:14,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1046019817, now seen corresponding path program 1 times [2019-12-07 20:41:14,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:41:14,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882912896] [2019-12-07 20:41:14,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 20:41:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:15,028 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 20:41:15,029 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:41:15,046 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 20:41:15,046 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:41:15,081 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 20:41:15,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882912896] [2019-12-07 20:41:15,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:41:15,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-12-07 20:41:15,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942475608] [2019-12-07 20:41:15,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:41:15,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:41:15,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:41:15,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:41:15,083 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 8 states. [2019-12-07 20:41:15,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:41:15,149 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2019-12-07 20:41:15,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:41:15,150 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-12-07 20:41:15,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:41:15,150 INFO L225 Difference]: With dead ends: 55 [2019-12-07 20:41:15,150 INFO L226 Difference]: Without dead ends: 39 [2019-12-07 20:41:15,151 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:41:15,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-12-07 20:41:15,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2019-12-07 20:41:15,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 20:41:15,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-12-07 20:41:15,156 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 28 [2019-12-07 20:41:15,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:41:15,156 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-12-07 20:41:15,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:41:15,156 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-12-07 20:41:15,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 20:41:15,157 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:41:15,157 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] [2019-12-07 20:41:15,358 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 20:41:15,358 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:41:15,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:41:15,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1715992049, now seen corresponding path program 1 times [2019-12-07 20:41:15,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:41:15,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010397277] [2019-12-07 20:41:15,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 20:41:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:15,488 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 20:41:15,490 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:41:15,509 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 20:41:15,509 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:41:15,542 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 20:41:15,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010397277] [2019-12-07 20:41:15,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:41:15,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-12-07 20:41:15,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433525313] [2019-12-07 20:41:15,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:41:15,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:41:15,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:41:15,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:41:15,544 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 8 states. [2019-12-07 20:41:15,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:41:15,602 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2019-12-07 20:41:15,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:41:15,603 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-12-07 20:41:15,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:41:15,604 INFO L225 Difference]: With dead ends: 48 [2019-12-07 20:41:15,604 INFO L226 Difference]: Without dead ends: 40 [2019-12-07 20:41:15,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:41:15,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-12-07 20:41:15,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-12-07 20:41:15,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 20:41:15,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-12-07 20:41:15,611 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 29 [2019-12-07 20:41:15,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:41:15,612 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-12-07 20:41:15,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:41:15,612 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-12-07 20:41:15,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 20:41:15,613 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:41:15,613 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 20:41:15,813 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 20:41:15,814 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:41:15,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:41:15,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1604492065, now seen corresponding path program 1 times [2019-12-07 20:41:15,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:41:15,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921294376] [2019-12-07 20:41:15,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 20:41:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:15,988 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 56 conjunts are in the unsatisfiable core [2019-12-07 20:41:15,991 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:41:16,016 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 20:41:16,016 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:41:16,018 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:41:16,019 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:41:16,019 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 20:41:16,047 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:41:16,048 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 20:41:16,049 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:41:16,055 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:41:16,055 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:41:16,055 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2019-12-07 20:41:16,092 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 20:41:16,092 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:41:16,103 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:41:16,107 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 20:41:16,107 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:41:16,117 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:41:16,118 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:41:16,118 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:15 [2019-12-07 20:41:16,143 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_37|], 2=[|v_#memory_$Pointer$.base_37|]} [2019-12-07 20:41:16,147 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-12-07 20:41:16,147 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:41:16,159 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:41:16,181 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:41:16,181 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 53 [2019-12-07 20:41:16,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:16,184 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:41:16,193 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:41:16,194 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:41:16,194 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:34 [2019-12-07 20:41:16,426 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_35|], 6=[|v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.offset_38|]} [2019-12-07 20:41:16,435 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2019-12-07 20:41:16,436 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:41:16,485 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:41:16,583 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:41:16,583 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 195 [2019-12-07 20:41:16,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:41:16,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:16,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:16,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:16,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:16,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:16,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:16,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:16,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:16,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:16,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:16,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:16,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:16,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:16,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:16,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:16,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:16,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:16,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:16,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:16,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:16,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:16,604 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-12-07 20:41:20,260 WARN L192 SmtUtils]: Spent 3.65 s on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-12-07 20:41:20,261 INFO L614 ElimStorePlain]: treesize reduction 1182, result has 13.5 percent of original size [2019-12-07 20:41:20,318 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:41:20,319 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 95 [2019-12-07 20:41:20,320 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 20:41:20,348 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:41:20,348 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 100 [2019-12-07 20:41:20,349 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 20:41:20,565 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2019-12-07 20:41:20,566 INFO L614 ElimStorePlain]: treesize reduction 103, result has 48.2 percent of original size [2019-12-07 20:41:20,567 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:41:20,567 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:141, output treesize:87 [2019-12-07 20:41:20,755 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2019-12-07 20:41:20,755 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:41:20,793 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:41:20,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:41:20,799 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 29 [2019-12-07 20:41:20,800 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:41:20,824 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:41:20,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:41:20,830 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2019-12-07 20:41:20,830 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 20:41:20,848 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:41:20,848 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:41:20,848 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:84, output treesize:33 [2019-12-07 20:41:21,020 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2019-12-07 20:41:21,021 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:41:21,040 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:41:21,043 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2019-12-07 20:41:21,043 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:41:21,053 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:41:21,054 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:41:21,054 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:21 [2019-12-07 20:41:21,126 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-12-07 20:41:21,126 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:41:21,134 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:41:21,134 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:41:21,134 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2019-12-07 20:41:21,298 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 20:41:21,299 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:41:21,777 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:41:21,805 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:41:21,806 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:41:21,816 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:41:21,817 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 20:41:21,817 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:51 [2019-12-07 20:41:26,577 INFO L430 ElimStorePlain]: Different costs {1=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_41|], 2=[|#memory_int|]} [2019-12-07 20:41:26,580 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:41:26,628 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:41:26,630 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:41:26,646 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:41:26,649 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 858 treesize of output 770 [2019-12-07 20:41:26,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:26,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:41:26,651 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 20:41:26,901 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-12-07 20:41:26,901 INFO L614 ElimStorePlain]: treesize reduction 588, result has 21.8 percent of original size [2019-12-07 20:41:26,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 20:41:26,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:41:26,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:41:26,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:41:26,908 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 20 dim-0 vars, and 8 xjuncts. [2019-12-07 20:41:26,908 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:102, output treesize:303 [2019-12-07 20:41:27,411 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 58 [2019-12-07 20:42:01,342 WARN L192 SmtUtils]: Spent 32.64 s on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-12-07 20:42:01,342 INFO L343 Elim1Store]: treesize reduction 69, result has 79.0 percent of original size [2019-12-07 20:42:01,343 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 375 treesize of output 524 [2019-12-07 20:42:01,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:42:01,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:42:01,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:42:01,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:42:01,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:42:01,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:42:01,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:42:01,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:42:01,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:42:01,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:42:01,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:42:01,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:42:01,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:42:01,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:42:01,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:42:01,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:42:01,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:42:01,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:42:01,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:42:01,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:42:01,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:42:01,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:42:01,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:42:01,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:42:01,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:42:01,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,382 INFO L430 ElimStorePlain]: Different costs {1=[v_arrayElimArr_2], 3=[v_arrayElimArr_1]} [2019-12-07 20:42:01,406 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:42:01,407 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 106 [2019-12-07 20:42:01,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:42:01,415 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 20:42:01,438 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_17], 2=[v_arrayElimCell_18]} [2019-12-07 20:42:01,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921294376] [2019-12-07 20:42:01,445 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@441f2aef [2019-12-07 20:42:01,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [812662362] [2019-12-07 20:42:01,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/bin/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:42:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:42:01,624 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 53 conjunts are in the unsatisfiable core [2019-12-07 20:42:01,626 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:42:01,627 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@441f2aef [2019-12-07 20:42:01,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916304534] [2019-12-07 20:42:01,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f5739e3-9209-4a11-b339-dfb933abe5d0/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:42:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:42:01,727 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 57 conjunts are in the unsatisfiable core [2019-12-07 20:42:01,729 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:42:01,730 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@441f2aef [2019-12-07 20:42:01,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:42:01,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 20:42:01,730 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 20:42:01,730 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 20:42:02,334 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 mathsat -unsat_core_generation=3,8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:42:02,349 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 20:42:02,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:42:02 BoogieIcfgContainer [2019-12-07 20:42:02,349 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:42:02,349 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:42:02,349 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:42:02,349 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:42:02,350 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:41:13" (3/4) ... [2019-12-07 20:42:02,352 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 20:42:02,352 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:42:02,353 INFO L168 Benchmark]: Toolchain (without parser) took 49312.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.3 MB). Free memory was 947.0 MB in the beginning and 854.9 MB in the end (delta: 92.1 MB). Peak memory consumption was 292.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:42:02,353 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:42:02,353 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -163.9 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2019-12-07 20:42:02,354 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-12-07 20:42:02,354 INFO L168 Benchmark]: Boogie Preprocessor took 25.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:42:02,354 INFO L168 Benchmark]: RCFGBuilder took 296.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. [2019-12-07 20:42:02,355 INFO L168 Benchmark]: TraceAbstraction took 48603.20 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 854.9 MB in the end (delta: 215.5 MB). Peak memory consumption was 286.8 MB. Max. memory is 11.5 GB. [2019-12-07 20:42:02,355 INFO L168 Benchmark]: Witness Printer took 2.61 ms. Allocated memory is still 1.2 GB. Free memory is still 854.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:42:02,356 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 346.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -163.9 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 296.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 48603.20 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 854.9 MB in the end (delta: 215.5 MB). Peak memory consumption was 286.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.61 ms. Allocated memory is still 1.2 GB. Free memory is still 854.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 626]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L610] const int len = 2; [L611] const int data = 1; [L564] SLL temp = (SLL) malloc(sizeof(struct node)); [L565] COND FALSE !(((void *)0) == temp) [L568] temp->next = ((void *)0) [L569] temp->data = data [L570] return temp; [L573] SLL head = node_create(data); [L574] SLL last = head; [L575] COND TRUE len > 1 [L564] SLL temp = (SLL) malloc(sizeof(struct node)); [L565] COND FALSE !(((void *)0) == temp) [L568] temp->next = ((void *)0) [L569] temp->data = data [L570] return temp; [L576] SLL new_head = node_create(data); [L577] new_head->next = head [L578] head = new_head [L579] len-- [L575] COND FALSE !(len > 1) [L581] last->next = head [L582] return head; [L612] SLL s = sll_circular_create(len, data); [L613] int i = 0; [L614] i = len - 1 [L614] COND TRUE i > -1 [L615] int new_data = i + len; [L603] COND TRUE index > 0 [L604] EXPR head->next [L604] head = head->next [L605] index-- [L603] COND FALSE !(index > 0) [L607] head->data = data [L614] i-- [L614] COND TRUE i > -1 [L615] int new_data = i + len; [L603] COND FALSE !(index > 0) [L607] head->data = data [L614] i-- [L614] COND FALSE !(i > -1) [L618] i = len - 1 [L618] COND TRUE i > -1 [L619] int expected = i + len; [L596] COND TRUE index > 0 [L597] EXPR head->next [L597] head = head->next [L598] index-- [L596] COND FALSE !(index > 0) [L600] EXPR head->data [L600] return head->data; [L620] COND TRUE expected != sll_circular_get_data_at(s, i) [L626] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 1 error locations. Result: UNKNOWN, OverallTime: 48.5s, OverallIterations: 6, TraceHistogramMax: 2, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 132 SDtfs, 144 SDslu, 167 SDs, 0 SdLazy, 73 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=0, 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, 5 MinimizatonAttempts, 27 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 14166 SizeOfPredicates, 13 NumberOfNonLiveVariables, 432 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 34/34 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request...