./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/list_search-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bfa38fdd-6a22-443d-ba91-43880cffa6b9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bfa38fdd-6a22-443d-ba91-43880cffa6b9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bfa38fdd-6a22-443d-ba91-43880cffa6b9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bfa38fdd-6a22-443d-ba91-43880cffa6b9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/list_search-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_bfa38fdd-6a22-443d-ba91-43880cffa6b9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bfa38fdd-6a22-443d-ba91-43880cffa6b9/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b9ae191666cff52a5646f600ca779e3fb8cdedc ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-6b5699a [2019-11-25 08:47:48,842 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:47:48,844 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:47:48,858 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:47:48,858 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:47:48,860 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:47:48,861 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:47:48,870 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:47:48,871 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:47:48,872 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:47:48,873 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:47:48,874 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:47:48,874 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:47:48,875 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:47:48,876 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:47:48,877 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:47:48,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:47:48,878 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:47:48,879 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:47:48,881 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:47:48,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:47:48,883 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:47:48,884 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:47:48,885 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:47:48,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:47:48,887 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:47:48,887 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:47:48,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:47:48,888 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:47:48,889 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:47:48,889 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:47:48,890 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:47:48,890 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:47:48,891 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:47:48,892 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:47:48,892 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:47:48,893 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:47:48,893 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:47:48,893 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:47:48,894 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:47:48,895 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:47:48,895 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bfa38fdd-6a22-443d-ba91-43880cffa6b9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:47:48,908 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:47:48,908 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:47:48,909 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:47:48,909 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:47:48,909 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:47:48,910 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:47:48,910 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:47:48,910 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:47:48,910 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:47:48,910 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:47:48,910 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:47:48,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:47:48,911 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:47:48,911 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:47:48,911 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:47:48,911 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:47:48,912 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:47:48,912 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:47:48,912 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:47:48,912 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:47:48,912 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:47:48,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:47:48,913 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:47:48,913 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:47:48,913 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:47:48,914 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:47:48,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:47:48,914 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:47:48,914 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_bfa38fdd-6a22-443d-ba91-43880cffa6b9/bin/uautomizer 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 -> Automizer 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 -> 8b9ae191666cff52a5646f600ca779e3fb8cdedc [2019-11-25 08:47:49,062 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:47:49,074 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:47:49,079 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:47:49,086 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:47:49,087 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:47:49,088 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bfa38fdd-6a22-443d-ba91-43880cffa6b9/bin/uautomizer/../../sv-benchmarks/c/list-properties/list_search-1.i [2019-11-25 08:47:49,135 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bfa38fdd-6a22-443d-ba91-43880cffa6b9/bin/uautomizer/data/ef9604fb9/8dac097697f84083b50feda80543a1ee/FLAGc9703b128 [2019-11-25 08:47:49,619 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:47:49,625 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bfa38fdd-6a22-443d-ba91-43880cffa6b9/sv-benchmarks/c/list-properties/list_search-1.i [2019-11-25 08:47:49,647 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bfa38fdd-6a22-443d-ba91-43880cffa6b9/bin/uautomizer/data/ef9604fb9/8dac097697f84083b50feda80543a1ee/FLAGc9703b128 [2019-11-25 08:47:49,941 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bfa38fdd-6a22-443d-ba91-43880cffa6b9/bin/uautomizer/data/ef9604fb9/8dac097697f84083b50feda80543a1ee [2019-11-25 08:47:49,944 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:47:49,945 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:47:49,945 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:47:49,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:47:49,949 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:47:49,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:47:49" (1/1) ... [2019-11-25 08:47:49,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dc5bc16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:49, skipping insertion in model container [2019-11-25 08:47:49,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:47:49" (1/1) ... [2019-11-25 08:47:49,957 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:47:50,000 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:47:50,369 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:47:50,378 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:47:50,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:47:50,487 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:47:50,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:50 WrapperNode [2019-11-25 08:47:50,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:47:50,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:47:50,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:47:50,489 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:47:50,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:50" (1/1) ... [2019-11-25 08:47:50,520 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:50" (1/1) ... [2019-11-25 08:47:50,547 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:47:50,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:47:50,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:47:50,548 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:47:50,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:50" (1/1) ... [2019-11-25 08:47:50,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:50" (1/1) ... [2019-11-25 08:47:50,561 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:50" (1/1) ... [2019-11-25 08:47:50,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:50" (1/1) ... [2019-11-25 08:47:50,571 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:50" (1/1) ... [2019-11-25 08:47:50,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:50" (1/1) ... [2019-11-25 08:47:50,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:50" (1/1) ... [2019-11-25 08:47:50,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:47:50,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:47:50,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:47:50,587 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:47:50,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bfa38fdd-6a22-443d-ba91-43880cffa6b9/bin/uautomizer/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-11-25 08:47:50,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 08:47:50,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:47:50,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 08:47:50,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 08:47:50,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 08:47:50,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:47:50,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:47:50,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:47:51,068 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:47:51,069 INFO L284 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-25 08:47:51,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:51 BoogieIcfgContainer [2019-11-25 08:47:51,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:47:51,071 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:47:51,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:47:51,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:47:51,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:47:49" (1/3) ... [2019-11-25 08:47:51,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6456a863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:47:51, skipping insertion in model container [2019-11-25 08:47:51,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:50" (2/3) ... [2019-11-25 08:47:51,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6456a863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:47:51, skipping insertion in model container [2019-11-25 08:47:51,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:51" (3/3) ... [2019-11-25 08:47:51,075 INFO L109 eAbstractionObserver]: Analyzing ICFG list_search-1.i [2019-11-25 08:47:51,081 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:47:51,086 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:47:51,093 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:47:51,113 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:47:51,114 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:47:51,114 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:47:51,114 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:47:51,114 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:47:51,114 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:47:51,114 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:47:51,114 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:47:51,127 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-11-25 08:47:51,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 08:47:51,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:51,134 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:51,134 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:51,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:51,139 INFO L82 PathProgramCache]: Analyzing trace with hash -332178203, now seen corresponding path program 1 times [2019-11-25 08:47:51,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:51,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803374141] [2019-11-25 08:47:51,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:51,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:51,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803374141] [2019-11-25 08:47:51,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:51,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:47:51,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133944434] [2019-11-25 08:47:51,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:47:51,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:51,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:47:51,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:47:51,392 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 4 states. [2019-11-25 08:47:51,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:51,489 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2019-11-25 08:47:51,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:47:51,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-25 08:47:51,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:51,499 INFO L225 Difference]: With dead ends: 49 [2019-11-25 08:47:51,499 INFO L226 Difference]: Without dead ends: 22 [2019-11-25 08:47:51,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:47:51,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-25 08:47:51,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-25 08:47:51,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-25 08:47:51,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-11-25 08:47:51,537 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2019-11-25 08:47:51,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:51,538 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-25 08:47:51,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:47:51,538 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-11-25 08:47:51,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 08:47:51,539 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:51,540 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:51,540 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:51,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:51,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1321983588, now seen corresponding path program 1 times [2019-11-25 08:47:51,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:51,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604392851] [2019-11-25 08:47:51,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:51,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:51,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604392851] [2019-11-25 08:47:51,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:51,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:47:51,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548193199] [2019-11-25 08:47:51,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:47:51,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:51,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:47:51,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:47:51,700 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 6 states. [2019-11-25 08:47:51,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:51,915 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-11-25 08:47:51,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:47:51,916 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-25 08:47:51,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:51,917 INFO L225 Difference]: With dead ends: 38 [2019-11-25 08:47:51,917 INFO L226 Difference]: Without dead ends: 30 [2019-11-25 08:47:51,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:47:51,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-25 08:47:51,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-11-25 08:47:51,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-25 08:47:51,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-11-25 08:47:51,924 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2019-11-25 08:47:51,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:51,924 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-25 08:47:51,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:47:51,924 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-11-25 08:47:51,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 08:47:51,925 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:51,928 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:51,928 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:51,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:51,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1379241890, now seen corresponding path program 1 times [2019-11-25 08:47:51,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:51,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274359598] [2019-11-25 08:47:51,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:52,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:52,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274359598] [2019-11-25 08:47:52,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:52,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:47:52,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532831201] [2019-11-25 08:47:52,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:47:52,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:52,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:47:52,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:47:52,108 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 7 states. [2019-11-25 08:47:52,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:52,306 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-11-25 08:47:52,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:47:52,308 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-25 08:47:52,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:52,309 INFO L225 Difference]: With dead ends: 30 [2019-11-25 08:47:52,309 INFO L226 Difference]: Without dead ends: 25 [2019-11-25 08:47:52,309 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-25 08:47:52,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-25 08:47:52,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-25 08:47:52,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-25 08:47:52,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-11-25 08:47:52,319 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2019-11-25 08:47:52,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:52,320 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-11-25 08:47:52,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:47:52,321 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-11-25 08:47:52,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-25 08:47:52,321 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:52,322 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:52,322 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:52,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:52,322 INFO L82 PathProgramCache]: Analyzing trace with hash -633881513, now seen corresponding path program 1 times [2019-11-25 08:47:52,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:52,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246893823] [2019-11-25 08:47:52,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:52,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:52,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246893823] [2019-11-25 08:47:52,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013098282] [2019-11-25 08:47:52,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bfa38fdd-6a22-443d-ba91-43880cffa6b9/bin/uautomizer/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-11-25 08:47:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:52,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-25 08:47:52,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:52,812 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-25 08:47:52,812 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:52,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:52,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:52,822 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-11-25 08:47:52,853 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-25 08:47:52,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:52,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:52,856 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:52,857 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-11-25 08:47:52,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:52,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:52,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:52,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2019-11-25 08:47:52,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2543914] [2019-11-25 08:47:52,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-25 08:47:52,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:52,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-25 08:47:52,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:47:52,866 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 14 states. [2019-11-25 08:47:53,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:53,327 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-11-25 08:47:53,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 08:47:53,330 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-11-25 08:47:53,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:53,331 INFO L225 Difference]: With dead ends: 45 [2019-11-25 08:47:53,332 INFO L226 Difference]: Without dead ends: 37 [2019-11-25 08:47:53,332 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2019-11-25 08:47:53,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-25 08:47:53,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2019-11-25 08:47:53,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-25 08:47:53,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-11-25 08:47:53,338 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2019-11-25 08:47:53,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:53,338 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-11-25 08:47:53,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-25 08:47:53,339 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-11-25 08:47:53,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-25 08:47:53,340 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:53,340 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:53,541 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:53,541 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:53,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:53,542 INFO L82 PathProgramCache]: Analyzing trace with hash -691139815, now seen corresponding path program 1 times [2019-11-25 08:47:53,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:53,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480251523] [2019-11-25 08:47:53,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:53,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:53,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480251523] [2019-11-25 08:47:53,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274819787] [2019-11-25 08:47:53,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bfa38fdd-6a22-443d-ba91-43880cffa6b9/bin/uautomizer/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-11-25 08:47:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:54,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-25 08:47:54,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:54,053 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 08:47:54,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:54,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:54,064 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:54,064 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-25 08:47:54,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:47:54,100 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2019-11-25 08:47:54,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:54,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:54,107 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:54,107 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:16 [2019-11-25 08:47:54,177 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:54,177 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-25 08:47:54,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:54,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:54,204 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-25 08:47:54,204 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:54,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:54,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:54,216 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:25 [2019-11-25 08:47:54,275 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_36|, |v_#memory_$Pointer$.offset_35|], 10=[|v_#memory_int_33|]} [2019-11-25 08:47:54,283 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-25 08:47:54,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:54,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:54,311 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-25 08:47:54,311 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:54,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:54,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:47:54,337 INFO L377 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 34 treesize of output 18 [2019-11-25 08:47:54,338 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:54,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:54,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:54,352 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:67, output treesize:36 [2019-11-25 08:47:54,478 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-25 08:47:54,479 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:54,494 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:54,496 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-25 08:47:54,497 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:54,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:54,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:54,504 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:14 [2019-11-25 08:47:54,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:54,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:54,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:54,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2019-11-25 08:47:54,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889584159] [2019-11-25 08:47:54,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-25 08:47:54,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:54,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-25 08:47:54,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2019-11-25 08:47:54,567 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 22 states. [2019-11-25 08:47:55,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:55,096 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-11-25 08:47:55,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:47:55,097 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2019-11-25 08:47:55,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:55,098 INFO L225 Difference]: With dead ends: 33 [2019-11-25 08:47:55,098 INFO L226 Difference]: Without dead ends: 28 [2019-11-25 08:47:55,099 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2019-11-25 08:47:55,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-25 08:47:55,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-25 08:47:55,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-25 08:47:55,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-11-25 08:47:55,104 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 24 [2019-11-25 08:47:55,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:55,104 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-11-25 08:47:55,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-25 08:47:55,104 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-11-25 08:47:55,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-25 08:47:55,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:55,105 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:55,305 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:55,306 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:55,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:55,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1263868996, now seen corresponding path program 2 times [2019-11-25 08:47:55,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:55,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623151588] [2019-11-25 08:47:55,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:55,652 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:55,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623151588] [2019-11-25 08:47:55,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967744425] [2019-11-25 08:47:55,653 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bfa38fdd-6a22-443d-ba91-43880cffa6b9/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:55,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:47:55,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:47:55,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-25 08:47:55,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:55,856 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 08:47:55,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:55,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:55,867 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:55,867 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-25 08:47:55,876 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-25 08:47:55,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:55,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:55,883 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:55,884 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-25 08:47:55,900 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:55,901 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-25 08:47:55,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:55,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:55,918 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-11-25 08:47:55,918 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:55,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:55,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:55,965 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:19 [2019-11-25 08:47:55,969 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_36|], 2=[|v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.base_40|]} [2019-11-25 08:47:55,973 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-25 08:47:55,973 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:55,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:55,989 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:55,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:56,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:47:56,006 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2019-11-25 08:47:56,006 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:56,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:56,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:56,022 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:57, output treesize:37 [2019-11-25 08:47:56,111 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-25 08:47:56,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:56,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:56,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:56,121 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:31 [2019-11-25 08:47:56,173 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:56,173 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:56,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:56,175 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:56,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:56,177 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:56,177 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:4 [2019-11-25 08:47:56,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:56,183 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:56,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:56,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 18 [2019-11-25 08:47:56,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628348059] [2019-11-25 08:47:56,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-25 08:47:56,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:56,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-25 08:47:56,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-11-25 08:47:56,185 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 18 states. [2019-11-25 08:47:56,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:56,934 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-11-25 08:47:56,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-25 08:47:56,935 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2019-11-25 08:47:56,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:56,936 INFO L225 Difference]: With dead ends: 51 [2019-11-25 08:47:56,936 INFO L226 Difference]: Without dead ends: 43 [2019-11-25 08:47:56,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=210, Invalid=660, Unknown=0, NotChecked=0, Total=870 [2019-11-25 08:47:56,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-25 08:47:56,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2019-11-25 08:47:56,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-25 08:47:56,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-11-25 08:47:56,943 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 27 [2019-11-25 08:47:56,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:56,944 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-25 08:47:56,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-25 08:47:56,944 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-11-25 08:47:56,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-25 08:47:56,945 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:56,945 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:57,149 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:57,150 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:57,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:57,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1321127298, now seen corresponding path program 2 times [2019-11-25 08:47:57,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:57,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598685032] [2019-11-25 08:47:57,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:57,687 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:57,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598685032] [2019-11-25 08:47:57,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056719720] [2019-11-25 08:47:57,688 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bfa38fdd-6a22-443d-ba91-43880cffa6b9/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:57,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:47:57,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:47:57,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 80 conjunts are in the unsatisfiable core [2019-11-25 08:47:57,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:57,840 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 08:47:57,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:57,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:57,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:57,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-25 08:47:57,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:47:57,906 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2019-11-25 08:47:57,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:57,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:57,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:57,918 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:16 [2019-11-25 08:47:58,008 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:58,008 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-25 08:47:58,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:58,036 INFO L567 ElimStorePlain]: treesize reduction 14, result has 73.6 percent of original size [2019-11-25 08:47:58,043 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-25 08:47:58,044 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:58,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:58,063 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:58,064 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:35 [2019-11-25 08:47:58,119 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_37|, |v_#memory_$Pointer$.base_41|], 10=[|v_#memory_int_36|]} [2019-11-25 08:47:58,125 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-25 08:47:58,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:58,151 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:58,156 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-25 08:47:58,156 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:58,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:58,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:47:58,178 INFO L377 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 34 treesize of output 18 [2019-11-25 08:47:58,179 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:58,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:58,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:58,200 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:77, output treesize:52 [2019-11-25 08:47:58,300 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:58,300 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-11-25 08:47:58,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:58,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:58,330 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-11-25 08:47:58,331 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:58,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:58,355 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-25 08:47:58,356 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:58,372 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:58,375 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2019-11-25 08:47:58,376 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:58,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:58,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:58,403 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:101, output treesize:60 [2019-11-25 08:47:58,450 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_38|, |v_#memory_$Pointer$.base_42|, |v_#memory_$Pointer$.offset_40|, |v_#memory_$Pointer$.base_44|], 10=[|v_#memory_int_38|]} [2019-11-25 08:47:58,453 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:58,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:58,500 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:58,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:58,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:47:58,528 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-11-25 08:47:58,529 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:58,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:58,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:47:58,563 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2019-11-25 08:47:58,564 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:58,618 INFO L567 ElimStorePlain]: treesize reduction 4, result has 96.0 percent of original size [2019-11-25 08:47:58,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:47:58,623 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2019-11-25 08:47:58,624 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:58,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:58,639 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:58,640 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:124, output treesize:77 [2019-11-25 08:47:58,807 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 08:47:58,820 INFO L343 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-11-25 08:47:58,820 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 53 [2019-11-25 08:47:58,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:58,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:58,823 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:58,849 INFO L567 ElimStorePlain]: treesize reduction 4, result has 92.6 percent of original size [2019-11-25 08:47:58,856 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:58,856 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2019-11-25 08:47:58,856 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:58,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:58,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:58,865 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:99, output treesize:14 [2019-11-25 08:47:58,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:58,896 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_int|], 2=[v_prenex_1]} [2019-11-25 08:47:58,898 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2019-11-25 08:47:58,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:58,911 INFO L567 ElimStorePlain]: treesize reduction 21, result has 19.2 percent of original size [2019-11-25 08:47:58,911 INFO L464 ElimStorePlain]: Eliminatee v_prenex_1 vanished before elimination [2019-11-25 08:47:58,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:58,911 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:5 [2019-11-25 08:47:58,941 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:58,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:58,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 30 [2019-11-25 08:47:58,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448652210] [2019-11-25 08:47:58,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-25 08:47:58,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:58,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-25 08:47:58,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2019-11-25 08:47:58,944 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 30 states. [2019-11-25 08:47:59,847 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 110 [2019-11-25 08:48:00,055 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 111 [2019-11-25 08:48:00,243 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 107 [2019-11-25 08:48:00,412 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2019-11-25 08:48:00,687 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 86 [2019-11-25 08:48:00,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:00,738 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-11-25 08:48:00,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-25 08:48:00,739 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 27 [2019-11-25 08:48:00,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:00,739 INFO L225 Difference]: With dead ends: 36 [2019-11-25 08:48:00,740 INFO L226 Difference]: Without dead ends: 31 [2019-11-25 08:48:00,741 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=278, Invalid=1614, Unknown=0, NotChecked=0, Total=1892 [2019-11-25 08:48:00,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-25 08:48:00,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-25 08:48:00,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-25 08:48:00,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-11-25 08:48:00,747 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-11-25 08:48:00,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:00,747 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-11-25 08:48:00,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-25 08:48:00,747 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-11-25 08:48:00,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-25 08:48:00,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:00,748 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:00,952 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:48:00,954 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:00,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:00,954 INFO L82 PathProgramCache]: Analyzing trace with hash -213891529, now seen corresponding path program 3 times [2019-11-25 08:48:00,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:00,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241929208] [2019-11-25 08:48:00,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:01,717 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:48:01,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241929208] [2019-11-25 08:48:01,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572683378] [2019-11-25 08:48:01,717 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bfa38fdd-6a22-443d-ba91-43880cffa6b9/bin/uautomizer/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-11-25 08:48:02,453 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-25 08:48:02,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:48:02,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 62 conjunts are in the unsatisfiable core [2019-11-25 08:48:02,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:48:02,522 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-25 08:48:02,522 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:02,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:02,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:48:02,535 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-11-25 08:48:02,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:48:02,584 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-11-25 08:48:02,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:02,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:02,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:48:02,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2019-11-25 08:48:02,617 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_41|], 2=[|v_#memory_$Pointer$.base_46|, |v_#memory_$Pointer$.base_49|]} [2019-11-25 08:48:02,620 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-25 08:48:02,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:02,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:02,634 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:48:02,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:02,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:48:02,649 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 08:48:02,658 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:02,658 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 44 [2019-11-25 08:48:02,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:48:02,659 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:02,687 INFO L567 ElimStorePlain]: treesize reduction 16, result has 71.9 percent of original size [2019-11-25 08:48:02,688 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:48:02,688 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:57, output treesize:37 [2019-11-25 08:48:02,752 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_43|], 6=[|v_#memory_$Pointer$.base_50|]} [2019-11-25 08:48:02,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:48:02,764 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-25 08:48:02,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:02,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:02,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:48:02,784 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 08:48:02,793 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:02,793 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2019-11-25 08:48:02,794 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:02,812 INFO L567 ElimStorePlain]: treesize reduction 30, result has 57.1 percent of original size [2019-11-25 08:48:02,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:48:02,813 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:40 [2019-11-25 08:48:02,859 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_47|, |v_#memory_$Pointer$.offset_44|, |v_#memory_$Pointer$.offset_42|], 5=[|v_#memory_$Pointer$.base_51|]} [2019-11-25 08:48:02,861 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:48:02,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:02,887 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-25 08:48:02,887 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:02,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:02,915 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 08:48:02,924 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:02,924 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 36 [2019-11-25 08:48:02,925 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:02,955 INFO L567 ElimStorePlain]: treesize reduction 16, result has 78.9 percent of original size [2019-11-25 08:48:02,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:48:02,961 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 08:48:02,981 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:02,981 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 82 [2019-11-25 08:48:02,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:48:02,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:48:02,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:48:02,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:48:02,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:48:02,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:48:02,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:48:02,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:48:02,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:48:02,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:48:02,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:48:02,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:48:02,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:48:02,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:48:02,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:48:02,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:48:02,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:48:02,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:48:02,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:48:02,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:48:03,000 INFO L496 ElimStorePlain]: Start of recursive call 5: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-25 08:48:03,133 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2019-11-25 08:48:03,133 INFO L567 ElimStorePlain]: treesize reduction 122, result has 52.0 percent of original size [2019-11-25 08:48:03,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:48:03,135 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-25 08:48:03,135 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:91, output treesize:194 [2019-11-25 08:48:03,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:48:03,388 INFO L343 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2019-11-25 08:48:03,388 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 48 [2019-11-25 08:48:03,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:03,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:03,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:48:03,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:89, output treesize:51 [2019-11-25 08:48:03,473 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:03,473 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 46 [2019-11-25 08:48:03,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:48:03,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:48:03,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:48:03,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:48:03,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:03,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:03,479 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:48:03,480 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:4 [2019-11-25 08:48:03,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:48:03,485 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:48:03,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:48:03,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2019-11-25 08:48:03,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688184023] [2019-11-25 08:48:03,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-25 08:48:03,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:03,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-25 08:48:03,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2019-11-25 08:48:03,487 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 32 states. [2019-11-25 08:48:04,691 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2019-11-25 08:48:04,870 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2019-11-25 08:48:05,404 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2019-11-25 08:48:05,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:05,650 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2019-11-25 08:48:05,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-25 08:48:05,658 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 30 [2019-11-25 08:48:05,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:05,658 INFO L225 Difference]: With dead ends: 57 [2019-11-25 08:48:05,658 INFO L226 Difference]: Without dead ends: 49 [2019-11-25 08:48:05,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=757, Invalid=2435, Unknown=0, NotChecked=0, Total=3192 [2019-11-25 08:48:05,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-25 08:48:05,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2019-11-25 08:48:05,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-25 08:48:05,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-11-25 08:48:05,664 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 30 [2019-11-25 08:48:05,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:05,665 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-11-25 08:48:05,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-25 08:48:05,665 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-11-25 08:48:05,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-25 08:48:05,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:05,665 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:05,870 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:48:05,870 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:05,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:05,870 INFO L82 PathProgramCache]: Analyzing trace with hash -271149831, now seen corresponding path program 3 times [2019-11-25 08:48:05,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:05,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682409416] [2019-11-25 08:48:05,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:05,949 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:48:05,949 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:48:06,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:48:06 BoogieIcfgContainer [2019-11-25 08:48:06,002 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:48:06,003 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:48:06,003 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:48:06,003 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:48:06,003 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:51" (3/4) ... [2019-11-25 08:48:06,005 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-25 08:48:06,074 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bfa38fdd-6a22-443d-ba91-43880cffa6b9/bin/uautomizer/witness.graphml [2019-11-25 08:48:06,074 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:48:06,075 INFO L168 Benchmark]: Toolchain (without parser) took 16130.56 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 284.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -200.1 MB). Peak memory consumption was 84.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:48:06,075 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:48:06,076 INFO L168 Benchmark]: CACSL2BoogieTranslator took 542.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -166.5 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:48:06,076 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.90 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:48:06,076 INFO L168 Benchmark]: Boogie Preprocessor took 38.99 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:48:06,076 INFO L168 Benchmark]: RCFGBuilder took 482.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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:48:06,077 INFO L168 Benchmark]: TraceAbstraction took 14931.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 156.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -71.0 MB). Peak memory consumption was 85.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:48:06,077 INFO L168 Benchmark]: Witness Printer took 71.43 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:48:06,079 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 542.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -166.5 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.90 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.99 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 482.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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14931.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 156.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -71.0 MB). Peak memory consumption was 85.8 MB. Max. memory is 11.5 GB. * Witness Printer took 71.43 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L522] mlist *head; VAL [head={0:0}] [L543] int i; [L544] mlist *mylist, *temp; [L531] l = (mlist*)malloc(sizeof(mlist)) [L532] l->key = k VAL [head={0:0}] [L533] COND TRUE head==((void *)0) [L534] l->next = ((void *)0) VAL [head={0:0}] [L539] head = l [L540] return 0; VAL [head={-4:0}] [L531] l = (mlist*)malloc(sizeof(mlist)) [L532] l->key = k VAL [head={-4:0}] [L533] COND FALSE !(head==((void *)0)) [L536] l->key = k [L537] l->next = head VAL [head={-4:0}] [L539] head = l [L540] return 0; VAL [head={-3:0}] [L531] l = (mlist*)malloc(sizeof(mlist)) [L532] l->key = k VAL [head={-3:0}] [L533] COND FALSE !(head==((void *)0)) [L536] l->key = k [L537] l->next = head VAL [head={-3:0}] [L539] head = l [L540] return 0; VAL [head={-2:0}] [L531] l = (mlist*)malloc(sizeof(mlist)) [L532] l->key = k VAL [head={-2:0}] [L533] COND FALSE !(head==((void *)0)) [L536] l->key = k [L537] l->next = head VAL [head={-2:0}] [L539] head = l [L540] return 0; VAL [head={-1:0}] [L524] l = head VAL [head={-1:0}] [L525] l!=((void *)0) && l->key!=k [L525] EXPR l->key [L525] l!=((void *)0) && l->key!=k VAL [head={-1:0}] [L525] COND TRUE l!=((void *)0) && l->key!=k [L526] EXPR l->next [L526] l = l->next [L525] l!=((void *)0) && l->key!=k [L525] EXPR l->key [L525] l!=((void *)0) && l->key!=k VAL [head={-1:0}] [L525] COND TRUE l!=((void *)0) && l->key!=k [L526] EXPR l->next [L526] l = l->next [L525] l!=((void *)0) && l->key!=k [L525] EXPR l->key [L525] l!=((void *)0) && l->key!=k VAL [head={-1:0}] [L525] COND TRUE l!=((void *)0) && l->key!=k [L526] EXPR l->next [L526] l = l->next [L525] l!=((void *)0) && l->key!=k [L525] EXPR l->key [L525] l!=((void *)0) && l->key!=k VAL [head={-1:0}] [L525] COND FALSE !(l!=((void *)0) && l->key!=k) [L528] return l; VAL [head={-1:0}] [L549] temp = search_list(head,2) [L550] temp->key [L3] COND TRUE !(cond) VAL [head={-1:0}] [L4] __VERIFIER_error() VAL [head={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 1 error locations. Result: UNSAFE, OverallTime: 14.8s, OverallIterations: 9, TraceHistogramMax: 4, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 80 SDtfs, 916 SDslu, 295 SDs, 0 SdLazy, 1533 SolverSat, 566 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 115 SyntacticMatches, 11 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=8, 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, 8 MinimizatonAttempts, 45 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 355 NumberOfCodeBlocks, 355 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 312 ConstructedInterpolants, 12 QuantifiedInterpolants, 112892 SizeOfPredicates, 106 NumberOfNonLiveVariables, 1061 ConjunctsInSsa, 268 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 12/84 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...