./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/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 573d04c3ab16ffed1ccac6c6179d92b670a825d7 ........................................................................................................................................................................................................................................................................................................................................................................................................................ 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/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/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 573d04c3ab16ffed1ccac6c6179d92b670a825d7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:26:48,892 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:26:48,894 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:26:48,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:26:48,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:26:48,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:26:48,908 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:26:48,910 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:26:48,911 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:26:48,912 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:26:48,912 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:26:48,913 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:26:48,914 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:26:48,914 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:26:48,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:26:48,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:26:48,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:26:48,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:26:48,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:26:48,920 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:26:48,921 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:26:48,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:26:48,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:26:48,923 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:26:48,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:26:48,926 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:26:48,926 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:26:48,927 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:26:48,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:26:48,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:26:48,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:26:48,928 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:26:48,929 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:26:48,930 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:26:48,930 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:26:48,931 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:26:48,931 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:26:48,931 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:26:48,932 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:26:48,932 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:26:48,933 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:26:48,933 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:26:48,944 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:26:48,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:26:48,945 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:26:48,945 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:26:48,946 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:26:48,946 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:26:48,946 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:26:48,946 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:26:48,946 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:26:48,947 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:26:48,947 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:26:48,947 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:26:48,948 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:26:48,948 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:26:48,948 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:26:48,948 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:26:48,948 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:26:48,948 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:26:48,949 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:26:48,949 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:26:48,949 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:26:48,949 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:26:48,949 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:26:48,949 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:26:48,950 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:26:48,950 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:26:48,950 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:26:48,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:26:48,950 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:26:48,951 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:26:48,951 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:26:48,951 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:26:48,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:26:48,951 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:26:48,951 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:26:48,952 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/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/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 -> 573d04c3ab16ffed1ccac6c6179d92b670a825d7 [2019-10-22 11:26:48,975 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:26:48,985 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:26:48,987 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:26:48,989 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:26:48,989 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:26:48,990 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/bin/utaipan/../../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2019-10-22 11:26:49,035 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/bin/utaipan/data/08b198b4d/a8e9af6546f84153be8561ed3b74ea6e/FLAG16c3925d9 [2019-10-22 11:26:49,438 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:26:49,439 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2019-10-22 11:26:49,454 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/bin/utaipan/data/08b198b4d/a8e9af6546f84153be8561ed3b74ea6e/FLAG16c3925d9 [2019-10-22 11:26:49,464 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/bin/utaipan/data/08b198b4d/a8e9af6546f84153be8561ed3b74ea6e [2019-10-22 11:26:49,466 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:26:49,467 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:26:49,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:49,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:26:49,473 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:26:49,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:49" (1/1) ... [2019-10-22 11:26:49,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ebe0986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:49, skipping insertion in model container [2019-10-22 11:26:49,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:49" (1/1) ... [2019-10-22 11:26:49,482 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:26:49,517 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:26:49,880 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:49,891 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:26:49,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:49,973 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:26:49,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:49 WrapperNode [2019-10-22 11:26:49,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:49,974 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:49,974 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:26:49,975 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:26:49,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:49" (1/1) ... [2019-10-22 11:26:49,997 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:49" (1/1) ... [2019-10-22 11:26:50,018 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:50,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:26:50,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:26:50,019 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:26:50,030 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:49" (1/1) ... [2019-10-22 11:26:50,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:49" (1/1) ... [2019-10-22 11:26:50,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:49" (1/1) ... [2019-10-22 11:26:50,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:49" (1/1) ... [2019-10-22 11:26:50,043 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:49" (1/1) ... [2019-10-22 11:26:50,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:49" (1/1) ... [2019-10-22 11:26:50,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:49" (1/1) ... [2019-10-22 11:26:50,053 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:26:50,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:26:50,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:26:50,054 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:26:50,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/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-10-22 11:26:50,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:26:50,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:26:50,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:26:50,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:26:50,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:26:50,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:26:50,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:26:50,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:26:50,518 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:26:50,518 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-10-22 11:26:50,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:50 BoogieIcfgContainer [2019-10-22 11:26:50,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:26:50,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:26:50,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:26:50,524 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:26:50,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:26:49" (1/3) ... [2019-10-22 11:26:50,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3c0409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:50, skipping insertion in model container [2019-10-22 11:26:50,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:49" (2/3) ... [2019-10-22 11:26:50,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3c0409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:50, skipping insertion in model container [2019-10-22 11:26:50,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:50" (3/3) ... [2019-10-22 11:26:50,528 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_nullified-1.i [2019-10-22 11:26:50,539 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:26:50,547 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:26:50,560 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:26:50,586 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:26:50,586 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:26:50,586 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:26:50,587 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:26:50,587 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:26:50,591 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:26:50,592 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:26:50,592 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:26:50,610 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-10-22 11:26:50,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:26:50,622 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:50,623 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:50,625 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:50,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:50,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1957812527, now seen corresponding path program 1 times [2019-10-22 11:26:50,639 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:50,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114391459] [2019-10-22 11:26:50,640 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:50,640 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:50,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:50,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:50,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114391459] [2019-10-22 11:26:50,742 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:50,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:50,743 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165462586] [2019-10-22 11:26:50,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:26:50,751 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:50,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:26:50,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:26:50,773 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-10-22 11:26:50,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:50,797 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2019-10-22 11:26:50,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:26:50,798 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-10-22 11:26:50,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:50,812 INFO L225 Difference]: With dead ends: 48 [2019-10-22 11:26:50,813 INFO L226 Difference]: Without dead ends: 24 [2019-10-22 11:26:50,817 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-10-22 11:26:50,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-22 11:26:50,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-22 11:26:50,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 11:26:50,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-10-22 11:26:50,866 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 12 [2019-10-22 11:26:50,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:50,867 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-10-22 11:26:50,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:26:50,867 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2019-10-22 11:26:50,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:26:50,868 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:50,868 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:50,868 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:50,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:50,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1580862863, now seen corresponding path program 1 times [2019-10-22 11:26:50,869 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:50,869 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236219249] [2019-10-22 11:26:50,869 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:50,870 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:50,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:50,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:50,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236219249] [2019-10-22 11:26:50,931 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:50,931 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:50,932 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789074610] [2019-10-22 11:26:50,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:50,933 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:50,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:50,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:50,934 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 3 states. [2019-10-22 11:26:50,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:50,984 INFO L93 Difference]: Finished difference Result 46 states and 64 transitions. [2019-10-22 11:26:50,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:50,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-22 11:26:50,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:50,987 INFO L225 Difference]: With dead ends: 46 [2019-10-22 11:26:50,987 INFO L226 Difference]: Without dead ends: 31 [2019-10-22 11:26:50,988 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:50,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-22 11:26:50,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-10-22 11:26:50,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-22 11:26:50,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2019-10-22 11:26:50,995 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 12 [2019-10-22 11:26:50,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:50,996 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-10-22 11:26:50,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:50,996 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2019-10-22 11:26:50,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:26:50,996 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:50,997 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:50,997 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:50,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:50,997 INFO L82 PathProgramCache]: Analyzing trace with hash -2031015874, now seen corresponding path program 1 times [2019-10-22 11:26:50,997 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:50,998 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829460364] [2019-10-22 11:26:50,998 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:50,998 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:50,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:51,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:51,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829460364] [2019-10-22 11:26:51,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311622908] [2019-10-22 11:26:51,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/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-10-22 11:26:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:51,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 11:26:51,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:26:51,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:51,255 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:26:51,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:51,261 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-22 11:26:51,261 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-22 11:26:51,261 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211901168] [2019-10-22 11:26:51,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:51,262 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:51,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:51,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:51,263 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand 3 states. [2019-10-22 11:26:51,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:51,284 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2019-10-22 11:26:51,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:51,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-22 11:26:51,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:51,285 INFO L225 Difference]: With dead ends: 53 [2019-10-22 11:26:51,285 INFO L226 Difference]: Without dead ends: 31 [2019-10-22 11:26:51,286 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:51,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-22 11:26:51,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-10-22 11:26:51,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-22 11:26:51,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2019-10-22 11:26:51,290 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 19 [2019-10-22 11:26:51,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:51,290 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-10-22 11:26:51,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:51,291 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2019-10-22 11:26:51,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:26:51,292 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:51,292 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:51,492 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:26:51,493 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:51,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:51,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1772850436, now seen corresponding path program 1 times [2019-10-22 11:26:51,493 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:51,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090732857] [2019-10-22 11:26:51,494 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:51,494 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:51,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:51,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:51,550 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090732857] [2019-10-22 11:26:51,550 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249519842] [2019-10-22 11:26:51,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/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-10-22 11:26:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:51,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 11:26:51,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:26:51,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:51,645 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:26:51,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:51,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [685768841] [2019-10-22 11:26:51,671 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 20 [2019-10-22 11:26:51,710 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-10-22 11:26:51,711 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-22 11:26:52,004 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:26:52,005 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inappropriate decl info IMPLEMENTATION at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:222) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.getBoogieVar(NonrelationalStatementProcessor.java:348) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleHavocStatement(NonrelationalStatementProcessor.java:325) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:159) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:138) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:107) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:422) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:413) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:140) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.restoreOriginalStateVariables(PoormanCachedPostOperation.java:322) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:120) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.(CegarAbsIntRunner.java:158) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAbstractInterpretation.getOrConstructRunner(IpTcStrategyModuleAbstractInterpretation.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAbstractInterpretation.construct(IpTcStrategyModuleAbstractInterpretation.java:81) 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.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) 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.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) 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-10-22 11:26:52,011 INFO L168 Benchmark]: Toolchain (without parser) took 2542.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 940.5 MB in the beginning and 1.0 GB in the end (delta: -69.7 MB). Peak memory consumption was 74.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:52,011 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:26:52,012 INFO L168 Benchmark]: CACSL2BoogieTranslator took 504.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:52,012 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.47 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:52,013 INFO L168 Benchmark]: Boogie Preprocessor took 34.15 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-10-22 11:26:52,014 INFO L168 Benchmark]: RCFGBuilder took 466.50 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:52,014 INFO L168 Benchmark]: TraceAbstraction took 1488.03 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: 77.9 MB). Peak memory consumption was 77.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:52,018 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 504.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.47 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.15 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 466.50 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1488.03 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: 77.9 MB). Peak memory consumption was 77.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inappropriate decl info IMPLEMENTATION de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inappropriate decl info IMPLEMENTATION: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:222) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-10-22 11:26:54,206 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:26:54,208 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:26:54,218 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:26:54,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:26:54,219 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:26:54,220 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:26:54,222 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:26:54,223 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:26:54,224 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:26:54,225 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:26:54,226 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:26:54,226 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:26:54,227 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:26:54,228 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:26:54,229 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:26:54,229 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:26:54,230 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:26:54,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:26:54,233 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:26:54,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:26:54,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:26:54,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:26:54,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:26:54,239 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:26:54,240 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:26:54,240 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:26:54,241 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:26:54,241 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:26:54,242 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:26:54,242 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:26:54,243 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:26:54,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:26:54,244 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:26:54,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:26:54,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:26:54,246 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:26:54,246 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:26:54,246 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:26:54,247 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:26:54,248 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:26:54,248 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-10-22 11:26:54,260 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:26:54,260 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:26:54,261 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:26:54,261 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:26:54,262 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:26:54,262 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:26:54,262 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:26:54,262 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:26:54,262 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:26:54,263 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:26:54,263 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:26:54,263 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:26:54,263 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:26:54,264 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:26:54,264 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:26:54,264 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:26:54,264 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:26:54,264 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:26:54,264 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:26:54,264 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:26:54,265 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:26:54,265 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:26:54,265 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:26:54,265 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:26:54,265 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:26:54,265 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:26:54,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:26:54,266 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:26:54,266 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:26:54,266 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:26:54,266 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:26:54,266 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:26:54,267 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:26:54,267 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:26:54,267 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/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/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 -> 573d04c3ab16ffed1ccac6c6179d92b670a825d7 [2019-10-22 11:26:54,294 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:26:54,304 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:26:54,308 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:26:54,309 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:26:54,309 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:26:54,310 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/bin/utaipan/../../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2019-10-22 11:26:54,367 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/bin/utaipan/data/0013fb27c/47e2083124d04bb99b7f35bd5cb89061/FLAGe8cca0881 [2019-10-22 11:26:54,808 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:26:54,808 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2019-10-22 11:26:54,819 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/bin/utaipan/data/0013fb27c/47e2083124d04bb99b7f35bd5cb89061/FLAGe8cca0881 [2019-10-22 11:26:55,147 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/bin/utaipan/data/0013fb27c/47e2083124d04bb99b7f35bd5cb89061 [2019-10-22 11:26:55,149 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:26:55,151 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:26:55,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:55,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:26:55,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:26:55,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:55" (1/1) ... [2019-10-22 11:26:55,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15cd6168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:55, skipping insertion in model container [2019-10-22 11:26:55,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:55" (1/1) ... [2019-10-22 11:26:55,169 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:26:55,209 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:26:55,651 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:55,667 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:26:55,718 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:55,765 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:26:55,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:55 WrapperNode [2019-10-22 11:26:55,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:55,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:55,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:26:55,766 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:26:55,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:55" (1/1) ... [2019-10-22 11:26:55,788 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:55" (1/1) ... [2019-10-22 11:26:55,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:55,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:26:55,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:26:55,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:26:55,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:55" (1/1) ... [2019-10-22 11:26:55,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:55" (1/1) ... [2019-10-22 11:26:55,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:55" (1/1) ... [2019-10-22 11:26:55,823 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:55" (1/1) ... [2019-10-22 11:26:55,832 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:55" (1/1) ... [2019-10-22 11:26:55,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:55" (1/1) ... [2019-10-22 11:26:55,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:55" (1/1) ... [2019-10-22 11:26:55,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:26:55,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:26:55,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:26:55,852 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:26:55,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/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-10-22 11:26:55,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 11:26:55,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:26:55,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:26:55,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:26:55,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:26:55,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-10-22 11:26:55,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:26:55,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:26:56,252 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:26:56,252 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-10-22 11:26:56,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:56 BoogieIcfgContainer [2019-10-22 11:26:56,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:26:56,255 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:26:56,255 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:26:56,258 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:26:56,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:26:55" (1/3) ... [2019-10-22 11:26:56,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9de3fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:56, skipping insertion in model container [2019-10-22 11:26:56,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:55" (2/3) ... [2019-10-22 11:26:56,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9de3fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:56, skipping insertion in model container [2019-10-22 11:26:56,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:56" (3/3) ... [2019-10-22 11:26:56,262 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_nullified-1.i [2019-10-22 11:26:56,273 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:26:56,281 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:26:56,295 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:26:56,321 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:26:56,321 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:26:56,322 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:26:56,322 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:26:56,322 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:26:56,322 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:26:56,322 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:26:56,322 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:26:56,334 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-10-22 11:26:56,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:26:56,340 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:56,341 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:56,343 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:56,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:56,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1957812527, now seen corresponding path program 1 times [2019-10-22 11:26:56,357 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:26:56,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1796572187] [2019-10-22 11:26:56,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/bin/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:26:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:56,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-22 11:26:56,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:26:56,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:56,528 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:26:56,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:56,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1796572187] [2019-10-22 11:26:56,538 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:56,539 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-10-22 11:26:56,539 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411399597] [2019-10-22 11:26:56,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:26:56,545 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:26:56,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:26:56,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:26:56,565 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-10-22 11:26:56,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:56,590 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2019-10-22 11:26:56,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:26:56,592 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-10-22 11:26:56,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:56,602 INFO L225 Difference]: With dead ends: 48 [2019-10-22 11:26:56,602 INFO L226 Difference]: Without dead ends: 24 [2019-10-22 11:26:56,607 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 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-10-22 11:26:56,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-22 11:26:56,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-22 11:26:56,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 11:26:56,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-10-22 11:26:56,637 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 12 [2019-10-22 11:26:56,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:56,637 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-10-22 11:26:56,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:26:56,638 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2019-10-22 11:26:56,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:26:56,638 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:56,639 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:56,839 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:26:56,840 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:56,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:56,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1580862863, now seen corresponding path program 1 times [2019-10-22 11:26:56,841 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:26:56,841 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [112575647] [2019-10-22 11:26:56,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/bin/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:26:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:56,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 11:26:56,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:26:56,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:56,964 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:26:56,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:56,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [112575647] [2019-10-22 11:26:56,984 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:56,984 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 11:26:56,984 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940819281] [2019-10-22 11:26:56,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:56,986 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:26:56,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:56,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:56,986 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 4 states. [2019-10-22 11:26:57,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:57,039 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2019-10-22 11:26:57,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:26:57,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-22 11:26:57,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:57,042 INFO L225 Difference]: With dead ends: 47 [2019-10-22 11:26:57,042 INFO L226 Difference]: Without dead ends: 32 [2019-10-22 11:26:57,043 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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-10-22 11:26:57,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-22 11:26:57,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-10-22 11:26:57,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-22 11:26:57,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2019-10-22 11:26:57,049 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 12 [2019-10-22 11:26:57,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:57,049 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-10-22 11:26:57,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:57,050 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2019-10-22 11:26:57,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 11:26:57,050 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:57,051 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:57,251 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:26:57,252 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:57,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:57,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1406565039, now seen corresponding path program 1 times [2019-10-22 11:26:57,253 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:26:57,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [699543269] [2019-10-22 11:26:57,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/bin/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:26:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:57,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 11:26:57,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:26:57,407 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:26:57,407 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:26:57,419 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:26:57,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [699543269] [2019-10-22 11:26:57,423 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:57,424 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 11:26:57,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137613062] [2019-10-22 11:26:57,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:57,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:26:57,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:57,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:57,425 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand 3 states. [2019-10-22 11:26:57,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:57,527 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2019-10-22 11:26:57,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:57,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-22 11:26:57,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:57,529 INFO L225 Difference]: With dead ends: 57 [2019-10-22 11:26:57,529 INFO L226 Difference]: Without dead ends: 33 [2019-10-22 11:26:57,531 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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-10-22 11:26:57,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-22 11:26:57,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-10-22 11:26:57,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-22 11:26:57,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2019-10-22 11:26:57,536 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 26 [2019-10-22 11:26:57,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:57,536 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-10-22 11:26:57,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:57,537 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2019-10-22 11:26:57,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 11:26:57,537 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:57,537 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:57,738 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:26:57,738 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:57,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:57,739 INFO L82 PathProgramCache]: Analyzing trace with hash -282378703, now seen corresponding path program 1 times [2019-10-22 11:26:57,739 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:26:57,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [209064118] [2019-10-22 11:26:57,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/bin/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:26:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:57,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 11:26:57,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:26:57,902 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:57,902 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:26:57,962 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:57,963 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [209064118] [2019-10-22 11:26:57,963 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345748453] [2019-10-22 11:26:57,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:26:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:58,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 11:26:58,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:26:58,057 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:58,057 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:26:58,162 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:58,163 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-22 11:26:58,164 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 6] total 10 [2019-10-22 11:26:58,165 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022001585] [2019-10-22 11:26:58,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:26:58,167 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:26:58,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:26:58,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:26:58,168 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand 10 states. [2019-10-22 11:26:58,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:58,413 INFO L93 Difference]: Finished difference Result 68 states and 93 transitions. [2019-10-22 11:26:58,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:26:58,417 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-10-22 11:26:58,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:58,418 INFO L225 Difference]: With dead ends: 68 [2019-10-22 11:26:58,418 INFO L226 Difference]: Without dead ends: 53 [2019-10-22 11:26:58,419 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:26:58,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-22 11:26:58,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-10-22 11:26:58,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-22 11:26:58,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2019-10-22 11:26:58,430 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 26 [2019-10-22 11:26:58,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:58,431 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 69 transitions. [2019-10-22 11:26:58,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:26:58,431 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2019-10-22 11:26:58,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 11:26:58,435 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:58,435 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:58,836 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:26:58,836 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:58,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:58,836 INFO L82 PathProgramCache]: Analyzing trace with hash 2036506556, now seen corresponding path program 2 times [2019-10-22 11:26:58,837 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:26:58,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1414014165] [2019-10-22 11:26:58,837 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/bin/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:26:59,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 11:26:59,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 11:26:59,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-22 11:26:59,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:26:59,320 INFO L375 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-10-22 11:26:59,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:59,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:59,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:59,329 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-22 11:26:59,355 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:59,355 INFO L375 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-10-22 11:26:59,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:59,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:59,363 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:59,363 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2019-10-22 11:26:59,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:26:59,383 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2019-10-22 11:26:59,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:59,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:59,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:59,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:24 [2019-10-22 11:26:59,426 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_33|], 10=[|v_#memory_int_35|]} [2019-10-22 11:26:59,432 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:26:59,535 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-10-22 11:26:59,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:59,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:26:59,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:26:59,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:26:59,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:26:59,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:26:59,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:26:59,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:26:59,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:26:59,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:26:59,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:26:59,553 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-10-22 11:26:59,554 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:59,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:59,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:59,574 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:24 [2019-10-22 11:26:59,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:26:59,585 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-10-22 11:26:59,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:59,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:59,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:59,598 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:20 [2019-10-22 11:26:59,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,728 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-22 11:26:59,729 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:26:59,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,848 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:26:59,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:59,857 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 11:26:59,857 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2019-10-22 11:26:59,954 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_33|], 3=[|v_#memory_int_38|]} [2019-10-22 11:26:59,958 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:26:59,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:00,005 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:27:00,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:00,017 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-10-22 11:27:00,017 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:63, output treesize:57 [2019-10-22 11:27:00,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:00,229 INFO L567 ElimStorePlain]: treesize reduction 9, result has 60.9 percent of original size [2019-10-22 11:27:00,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:27:00,230 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:10 [2019-10-22 11:27:00,327 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-22 11:27:00,328 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1414014165] [2019-10-22 11:27:00,328 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565218486] [2019-10-22 11:27:00,328 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:27:00,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 11:27:00,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 11:27:00,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-22 11:27:00,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:27:00,442 INFO L375 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-10-22 11:27:00,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:00,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:00,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:27:00,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-22 11:27:00,461 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:00,462 INFO L375 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-10-22 11:27:00,463 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:00,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:00,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:27:00,469 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2019-10-22 11:27:00,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:00,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2019-10-22 11:27:00,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:00,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:00,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:27:00,514 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:24 [2019-10-22 11:27:00,520 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_43|], 10=[|v_#memory_int_45|]} [2019-10-22 11:27:00,524 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:27:00,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:00,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:00,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:00,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:00,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:00,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:00,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:00,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:00,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:00,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:00,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:00,616 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-10-22 11:27:00,617 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:00,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:00,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:27:00,632 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:24 [2019-10-22 11:27:00,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:00,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-10-22 11:27:00,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:00,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:00,659 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:27:00,659 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:20 [2019-10-22 11:27:00,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:27:00,668 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-22 11:27:00,668 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:27:00,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:27:00,676 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:27:00,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:00,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 11:27:00,681 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2019-10-22 11:27:00,755 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_43|], 3=[|v_#memory_int_48|]} [2019-10-22 11:27:00,757 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:27:00,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:00,782 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:27:00,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:00,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-10-22 11:27:00,792 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:63, output treesize:57 [2019-10-22 11:27:01,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:01,139 INFO L567 ElimStorePlain]: treesize reduction 9, result has 60.9 percent of original size [2019-10-22 11:27:01,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:27:01,140 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:10 [2019-10-22 11:27:01,157 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-22 11:27:01,157 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-22 11:27:01,157 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11, 11] total 18 [2019-10-22 11:27:01,157 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835152053] [2019-10-22 11:27:01,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-22 11:27:01,158 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:27:01,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-22 11:27:01,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-22 11:27:01,158 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. Second operand 18 states. [2019-10-22 11:27:03,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:03,151 INFO L93 Difference]: Finished difference Result 86 states and 116 transitions. [2019-10-22 11:27:03,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 11:27:03,152 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2019-10-22 11:27:03,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:03,153 INFO L225 Difference]: With dead ends: 86 [2019-10-22 11:27:03,153 INFO L226 Difference]: Without dead ends: 73 [2019-10-22 11:27:03,154 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 165 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2019-10-22 11:27:03,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-22 11:27:03,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2019-10-22 11:27:03,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-22 11:27:03,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2019-10-22 11:27:03,162 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 73 transitions. Word has length 47 [2019-10-22 11:27:03,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:03,162 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 73 transitions. [2019-10-22 11:27:03,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-22 11:27:03,162 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 73 transitions. [2019-10-22 11:27:03,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 11:27:03,163 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:03,164 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:03,564 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:27:03,565 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:03,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:03,565 INFO L82 PathProgramCache]: Analyzing trace with hash 2038353598, now seen corresponding path program 1 times [2019-10-22 11:27:03,566 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:27:03,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1950141925] [2019-10-22 11:27:03,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/bin/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:27:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:04,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-22 11:27:04,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:27:04,021 INFO L375 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-10-22 11:27:04,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:04,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:04,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:27:04,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-22 11:27:04,043 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:04,043 INFO L375 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-10-22 11:27:04,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:04,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:04,050 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:27:04,050 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2019-10-22 11:27:04,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:04,072 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2019-10-22 11:27:04,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:04,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:04,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:27:04,086 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:24 [2019-10-22 11:27:04,112 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_53|], 10=[|v_#memory_int_55|]} [2019-10-22 11:27:04,115 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:27:04,216 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-10-22 11:27:04,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:04,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:04,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:04,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:04,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:04,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:04,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:04,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:04,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:04,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:04,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:04,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-10-22 11:27:04,234 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:04,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:04,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:27:04,257 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:24 [2019-10-22 11:27:04,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:04,266 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-10-22 11:27:04,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:04,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:04,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:27:04,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:20 [2019-10-22 11:27:04,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:27:04,417 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-22 11:27:04,418 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:27:04,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:27:04,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:27:04,567 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:27:04,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:04,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 11:27:04,574 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2019-10-22 11:27:04,676 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_53|], 3=[|v_#memory_int_58|]} [2019-10-22 11:27:04,680 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:27:04,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:04,705 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:27:04,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:04,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-10-22 11:27:04,714 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:65, output treesize:59 [2019-10-22 11:27:04,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:04,907 INFO L567 ElimStorePlain]: treesize reduction 11, result has 59.3 percent of original size [2019-10-22 11:27:04,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:27:04,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:12 [2019-10-22 11:27:04,984 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-22 11:27:04,985 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1950141925] [2019-10-22 11:27:04,985 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71197108] [2019-10-22 11:27:04,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:27:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:05,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-22 11:27:05,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:27:05,076 INFO L375 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-10-22 11:27:05,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:05,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:05,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:27:05,079 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-22 11:27:05,087 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:05,087 INFO L375 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-10-22 11:27:05,088 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:05,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:05,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:27:05,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2019-10-22 11:27:05,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:05,102 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2019-10-22 11:27:05,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:05,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:05,113 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:27:05,113 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:24 [2019-10-22 11:27:05,116 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_63|], 10=[|v_#memory_int_65|]} [2019-10-22 11:27:05,118 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:27:05,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:05,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:05,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:05,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:05,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:05,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:05,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:05,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:05,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:05,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:05,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:05,208 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-10-22 11:27:05,209 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:05,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:05,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:27:05,235 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:24 [2019-10-22 11:27:05,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:05,242 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-10-22 11:27:05,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:05,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:05,253 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:27:05,253 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:20 [2019-10-22 11:27:05,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:27:05,261 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-22 11:27:05,261 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:27:05,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:27:05,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:27:05,269 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:27:05,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:05,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 11:27:05,274 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2019-10-22 11:27:05,353 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_63|], 3=[|v_#memory_int_68|]} [2019-10-22 11:27:05,355 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:27:05,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:05,385 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:27:05,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:05,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-10-22 11:27:05,392 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:65, output treesize:59 [2019-10-22 11:27:05,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:05,535 INFO L567 ElimStorePlain]: treesize reduction 11, result has 59.3 percent of original size [2019-10-22 11:27:05,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:27:05,536 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:12 [2019-10-22 11:27:05,558 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-22 11:27:05,559 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-22 11:27:05,559 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12, 12] total 19 [2019-10-22 11:27:05,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331367150] [2019-10-22 11:27:05,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-22 11:27:05,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:27:05,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-22 11:27:05,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-10-22 11:27:05,560 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. Second operand 19 states. [2019-10-22 11:27:07,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:07,476 INFO L93 Difference]: Finished difference Result 86 states and 115 transitions. [2019-10-22 11:27:07,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 11:27:07,477 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2019-10-22 11:27:07,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:07,478 INFO L225 Difference]: With dead ends: 86 [2019-10-22 11:27:07,478 INFO L226 Difference]: Without dead ends: 73 [2019-10-22 11:27:07,478 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 164 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2019-10-22 11:27:07,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-22 11:27:07,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 58. [2019-10-22 11:27:07,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-22 11:27:07,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2019-10-22 11:27:07,485 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 47 [2019-10-22 11:27:07,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:07,485 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2019-10-22 11:27:07,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-22 11:27:07,485 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2019-10-22 11:27:07,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 11:27:07,486 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:07,486 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:07,886 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:27:07,887 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:07,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:07,887 INFO L82 PathProgramCache]: Analyzing trace with hash 2038355520, now seen corresponding path program 1 times [2019-10-22 11:27:07,888 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:27:07,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1686444862] [2019-10-22 11:27:07,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/bin/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:27:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:27:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:27:10,165 INFO L168 tionRefinementEngine]: Strategy WALRUS found a feasible trace [2019-10-22 11:27:10,165 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:27:10,366 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:27:10,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:27:10 BoogieIcfgContainer [2019-10-22 11:27:10,425 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:27:10,425 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:27:10,425 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:27:10,425 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:27:10,426 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:56" (3/4) ... [2019-10-22 11:27:10,428 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:27:10,483 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fdef3f96-bb0c-49b7-b16c-d2c319403374/bin/utaipan/witness.graphml [2019-10-22 11:27:10,483 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:27:10,485 INFO L168 Benchmark]: Toolchain (without parser) took 15334.18 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 271.6 MB). Free memory was 945.6 MB in the beginning and 1.2 GB in the end (delta: -248.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:10,485 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:27:10,485 INFO L168 Benchmark]: CACSL2BoogieTranslator took 613.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -204.0 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:10,485 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.85 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:10,486 INFO L168 Benchmark]: Boogie Preprocessor took 44.56 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-10-22 11:27:10,486 INFO L168 Benchmark]: RCFGBuilder took 402.14 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: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:10,486 INFO L168 Benchmark]: TraceAbstraction took 14169.85 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 102.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -83.4 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:10,486 INFO L168 Benchmark]: Witness Printer took 58.39 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:10,489 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 613.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -204.0 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.85 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.56 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 402.14 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: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14169.85 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 102.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -83.4 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * Witness Printer took 58.39 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 605]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L588] const int len = 5; [L568] DLL head = ((void *)0); [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); [L571] COND FALSE !(((void *)0) == new_head) [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) [L579] COND FALSE !(\read(head)) [L582] head = new_head [L583] len-- [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); [L571] COND FALSE !(((void *)0) == new_head) [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) [L579] COND TRUE \read(head) [L580] head->prev = new_head [L582] head = new_head [L583] len-- [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); [L571] COND FALSE !(((void *)0) == new_head) [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) [L579] COND TRUE \read(head) [L580] head->prev = new_head [L582] head = new_head [L583] len-- [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); [L571] COND FALSE !(((void *)0) == new_head) [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) [L579] COND TRUE \read(head) [L580] head->prev = new_head [L582] head = new_head [L583] len-- [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); [L571] COND FALSE !(((void *)0) == new_head) [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) [L579] COND TRUE \read(head) [L580] head->prev = new_head [L582] head = new_head [L583] len-- [L569] COND FALSE !(len > 0) [L585] return head; [L589] DLL head = dll_create(len); [L590] head->next [L590] COND TRUE head->next [L591] EXPR head->data_0 [L591] EXPR 0 != head->data_0 || 0 != head->data_1 [L591] EXPR head->data_1 [L591] EXPR 0 != head->data_0 || 0 != head->data_1 [L591] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L591] EXPR head->data_2 [L591] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L591] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L605] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. Result: UNSAFE, OverallTime: 14.1s, OverallIterations: 7, TraceHistogramMax: 5, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 177 SDtfs, 679 SDslu, 495 SDs, 0 SdLazy, 644 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 595 GetRequests, 511 SyntacticMatches, 15 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=6, 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, 6 MinimizatonAttempts, 33 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 337 NumberOfCodeBlocks, 337 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 562 ConstructedInterpolants, 14 QuantifiedInterpolants, 97296 SizeOfPredicates, 97 NumberOfNonLiveVariables, 998 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 562/654 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...