./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-properties/simple-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/simple-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 17ff5ae56efea2deac29e7fa779d53a24810a7c7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/simple-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 17ff5ae56efea2deac29e7fa779d53a24810a7c7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 12:58:12,312 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:58:12,313 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:58:12,320 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:58:12,321 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:58:12,321 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:58:12,322 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:58:12,323 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:58:12,325 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:58:12,325 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:58:12,326 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:58:12,327 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:58:12,327 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:58:12,328 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:58:12,328 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:58:12,329 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:58:12,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:58:12,330 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:58:12,332 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:58:12,333 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:58:12,334 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:58:12,335 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:58:12,335 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:58:12,336 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:58:12,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:58:12,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:58:12,338 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:58:12,338 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:58:12,339 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:58:12,339 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:58:12,339 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:58:12,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:58:12,341 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:58:12,341 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:58:12,342 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:58:12,342 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:58:12,343 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:58:12,343 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:58:12,343 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:58:12,344 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:58:12,344 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:58:12,345 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 12:58:12,358 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:58:12,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:58:12,359 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 12:58:12,359 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 12:58:12,360 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 12:58:12,360 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 12:58:12,360 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 12:58:12,360 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 12:58:12,360 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 12:58:12,360 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 12:58:12,361 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 12:58:12,361 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 12:58:12,361 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 12:58:12,361 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 12:58:12,361 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 12:58:12,362 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:58:12,362 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:58:12,362 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:58:12,363 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:58:12,363 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 12:58:12,363 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:58:12,363 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:58:12,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:58:12,363 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 12:58:12,364 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 12:58:12,364 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 12:58:12,364 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:58:12,364 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:58:12,364 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:58:12,364 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:58:12,365 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:58:12,365 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:58:12,365 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:58:12,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:58:12,365 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:58:12,365 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:58:12,366 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 12:58:12,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:58:12,366 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:58:12,366 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:58:12,366 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 17ff5ae56efea2deac29e7fa779d53a24810a7c7 [2019-12-07 12:58:12,476 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:58:12,485 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:58:12,487 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:58:12,488 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:58:12,488 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:58:12,489 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/../../sv-benchmarks/c/list-properties/simple-2.i [2019-12-07 12:58:12,525 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/data/ce1ce1616/d027b87328bc4be99167be3428a05b22/FLAG9b75cd095 [2019-12-07 12:58:12,959 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:58:12,960 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/sv-benchmarks/c/list-properties/simple-2.i [2019-12-07 12:58:12,969 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/data/ce1ce1616/d027b87328bc4be99167be3428a05b22/FLAG9b75cd095 [2019-12-07 12:58:12,981 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/data/ce1ce1616/d027b87328bc4be99167be3428a05b22 [2019-12-07 12:58:12,984 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:58:12,985 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:58:12,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:58:12,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:58:12,989 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:58:12,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:58:12" (1/1) ... [2019-12-07 12:58:12,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@733d7c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:12, skipping insertion in model container [2019-12-07 12:58:12,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:58:12" (1/1) ... [2019-12-07 12:58:12,997 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:58:13,027 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:58:13,258 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:58:13,266 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:58:13,297 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:58:13,328 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:58:13,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:13 WrapperNode [2019-12-07 12:58:13,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:58:13,328 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:58:13,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:58:13,329 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:58:13,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:13" (1/1) ... [2019-12-07 12:58:13,343 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:13" (1/1) ... [2019-12-07 12:58:13,357 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:58:13,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:58:13,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:58:13,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:58:13,363 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:13" (1/1) ... [2019-12-07 12:58:13,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:13" (1/1) ... [2019-12-07 12:58:13,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:13" (1/1) ... [2019-12-07 12:58:13,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:13" (1/1) ... [2019-12-07 12:58:13,369 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:13" (1/1) ... [2019-12-07 12:58:13,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:13" (1/1) ... [2019-12-07 12:58:13,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:13" (1/1) ... [2019-12-07 12:58:13,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:58:13,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:58:13,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:58:13,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:58:13,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:58:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 12:58:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:58:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 12:58:13,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 12:58:13,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 12:58:13,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:58:13,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:58:13,642 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:58:13,642 INFO L287 CfgBuilder]: Removed 10 assume(true) statements. [2019-12-07 12:58:13,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:58:13 BoogieIcfgContainer [2019-12-07 12:58:13,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:58:13,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:58:13,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:58:13,645 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:58:13,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:58:12" (1/3) ... [2019-12-07 12:58:13,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f9244f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:58:13, skipping insertion in model container [2019-12-07 12:58:13,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:13" (2/3) ... [2019-12-07 12:58:13,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f9244f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:58:13, skipping insertion in model container [2019-12-07 12:58:13,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:58:13" (3/3) ... [2019-12-07 12:58:13,647 INFO L109 eAbstractionObserver]: Analyzing ICFG simple-2.i [2019-12-07 12:58:13,653 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:58:13,658 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-12-07 12:58:13,665 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-12-07 12:58:13,677 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:58:13,677 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 12:58:13,677 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:58:13,677 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:58:13,677 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:58:13,677 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:58:13,677 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:58:13,677 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:58:13,687 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-12-07 12:58:13,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 12:58:13,691 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:13,692 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 12:58:13,692 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:58:13,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:13,696 INFO L82 PathProgramCache]: Analyzing trace with hash 3508933, now seen corresponding path program 1 times [2019-12-07 12:58:13,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:58:13,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162381380] [2019-12-07 12:58:13,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:13,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:13,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162381380] [2019-12-07 12:58:13,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:13,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:58:13,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735977183] [2019-12-07 12:58:13,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 12:58:13,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:58:13,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 12:58:13,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 12:58:13,796 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2019-12-07 12:58:13,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:13,806 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-12-07 12:58:13,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 12:58:13,806 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2019-12-07 12:58:13,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:13,813 INFO L225 Difference]: With dead ends: 35 [2019-12-07 12:58:13,813 INFO L226 Difference]: Without dead ends: 32 [2019-12-07 12:58:13,814 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 12:58:13,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-07 12:58:13,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-12-07 12:58:13,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 12:58:13,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-12-07 12:58:13,835 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 4 [2019-12-07 12:58:13,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:13,835 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-12-07 12:58:13,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 12:58:13,835 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-12-07 12:58:13,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 12:58:13,836 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:13,836 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 12:58:13,836 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:58:13,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:13,836 INFO L82 PathProgramCache]: Analyzing trace with hash 108752166, now seen corresponding path program 1 times [2019-12-07 12:58:13,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:58:13,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377919315] [2019-12-07 12:58:13,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:13,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:13,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377919315] [2019-12-07 12:58:13,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:13,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:58:13,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769754486] [2019-12-07 12:58:13,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:58:13,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:58:13,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:58:13,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:58:13,873 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 4 states. [2019-12-07 12:58:13,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:13,939 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-12-07 12:58:13,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:58:13,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-12-07 12:58:13,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:13,941 INFO L225 Difference]: With dead ends: 39 [2019-12-07 12:58:13,941 INFO L226 Difference]: Without dead ends: 39 [2019-12-07 12:58:13,941 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:58:13,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-12-07 12:58:13,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2019-12-07 12:58:13,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 12:58:13,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-12-07 12:58:13,946 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 5 [2019-12-07 12:58:13,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:13,946 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-12-07 12:58:13,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:58:13,947 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2019-12-07 12:58:13,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 12:58:13,947 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:13,947 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 12:58:13,947 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:58:13,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:13,948 INFO L82 PathProgramCache]: Analyzing trace with hash 108752167, now seen corresponding path program 1 times [2019-12-07 12:58:13,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:58:13,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607354750] [2019-12-07 12:58:13,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:13,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:13,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607354750] [2019-12-07 12:58:13,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:13,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:58:13,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476696542] [2019-12-07 12:58:13,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:58:13,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:58:13,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:58:13,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:58:13,998 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 4 states. [2019-12-07 12:58:14,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:14,059 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-12-07 12:58:14,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:58:14,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-12-07 12:58:14,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:14,060 INFO L225 Difference]: With dead ends: 44 [2019-12-07 12:58:14,060 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 12:58:14,060 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:58:14,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 12:58:14,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2019-12-07 12:58:14,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-07 12:58:14,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-12-07 12:58:14,063 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 5 [2019-12-07 12:58:14,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:14,064 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-12-07 12:58:14,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:58:14,064 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-12-07 12:58:14,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 12:58:14,064 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:14,064 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:14,064 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:58:14,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:14,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1430495752, now seen corresponding path program 1 times [2019-12-07 12:58:14,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:58:14,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118638292] [2019-12-07 12:58:14,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:14,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:14,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118638292] [2019-12-07 12:58:14,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:14,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:58:14,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128992923] [2019-12-07 12:58:14,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:58:14,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:58:14,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:58:14,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:58:14,095 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 4 states. [2019-12-07 12:58:14,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:14,133 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-12-07 12:58:14,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:58:14,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 12:58:14,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:14,134 INFO L225 Difference]: With dead ends: 42 [2019-12-07 12:58:14,134 INFO L226 Difference]: Without dead ends: 42 [2019-12-07 12:58:14,134 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:58:14,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-07 12:58:14,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-12-07 12:58:14,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-07 12:58:14,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-12-07 12:58:14,137 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 8 [2019-12-07 12:58:14,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:14,137 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-12-07 12:58:14,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:58:14,137 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-12-07 12:58:14,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 12:58:14,138 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:14,138 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:14,138 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:58:14,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:14,138 INFO L82 PathProgramCache]: Analyzing trace with hash 315822104, now seen corresponding path program 1 times [2019-12-07 12:58:14,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:58:14,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059133010] [2019-12-07 12:58:14,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:14,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059133010] [2019-12-07 12:58:14,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:14,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:58:14,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955471818] [2019-12-07 12:58:14,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:58:14,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:58:14,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:58:14,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:58:14,235 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 7 states. [2019-12-07 12:58:14,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:14,352 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2019-12-07 12:58:14,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:58:14,353 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-07 12:58:14,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:14,353 INFO L225 Difference]: With dead ends: 46 [2019-12-07 12:58:14,353 INFO L226 Difference]: Without dead ends: 46 [2019-12-07 12:58:14,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:58:14,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-12-07 12:58:14,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-12-07 12:58:14,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-07 12:58:14,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-12-07 12:58:14,357 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 10 [2019-12-07 12:58:14,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:14,357 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-12-07 12:58:14,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:58:14,357 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-12-07 12:58:14,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:58:14,358 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:14,358 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:14,358 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:58:14,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:14,358 INFO L82 PathProgramCache]: Analyzing trace with hash -953360382, now seen corresponding path program 1 times [2019-12-07 12:58:14,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:58:14,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161584778] [2019-12-07 12:58:14,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:14,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:14,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161584778] [2019-12-07 12:58:14,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:14,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:58:14,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728010294] [2019-12-07 12:58:14,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:58:14,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:58:14,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:58:14,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:58:14,391 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 5 states. [2019-12-07 12:58:14,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:14,469 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2019-12-07 12:58:14,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:58:14,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 12:58:14,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:14,470 INFO L225 Difference]: With dead ends: 53 [2019-12-07 12:58:14,470 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 12:58:14,470 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:58:14,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 12:58:14,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2019-12-07 12:58:14,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 12:58:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-12-07 12:58:14,473 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 11 [2019-12-07 12:58:14,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:14,473 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-12-07 12:58:14,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:58:14,474 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-12-07 12:58:14,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:58:14,474 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:14,474 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:14,474 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:58:14,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:14,475 INFO L82 PathProgramCache]: Analyzing trace with hash -953360381, now seen corresponding path program 1 times [2019-12-07 12:58:14,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:58:14,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892043787] [2019-12-07 12:58:14,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:14,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:14,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892043787] [2019-12-07 12:58:14,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:14,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:58:14,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014864086] [2019-12-07 12:58:14,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:58:14,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:58:14,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:58:14,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:58:14,517 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 5 states. [2019-12-07 12:58:14,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:14,603 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-12-07 12:58:14,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:58:14,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 12:58:14,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:14,604 INFO L225 Difference]: With dead ends: 48 [2019-12-07 12:58:14,604 INFO L226 Difference]: Without dead ends: 48 [2019-12-07 12:58:14,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:58:14,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-07 12:58:14,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2019-12-07 12:58:14,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 12:58:14,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-12-07 12:58:14,607 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 11 [2019-12-07 12:58:14,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:14,608 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-12-07 12:58:14,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:58:14,608 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-12-07 12:58:14,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 12:58:14,608 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:14,608 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:14,608 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:58:14,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:14,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1437463188, now seen corresponding path program 1 times [2019-12-07 12:58:14,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:58:14,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395196765] [2019-12-07 12:58:14,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:14,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:14,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395196765] [2019-12-07 12:58:14,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128122702] [2019-12-07 12:58:14,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:58:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:14,740 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 12:58:14,744 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:58:14,816 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-12-07 12:58:14,816 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:14,825 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:14,828 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-12-07 12:58:14,828 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:14,835 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:14,836 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:58:14,836 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:28 [2019-12-07 12:58:14,894 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:58:14,895 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 12:58:14,895 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:14,905 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:14,908 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:58:14,917 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:14,918 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 10 [2019-12-07 12:58:14,918 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:14,927 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:14,929 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:58:14,929 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:49, output treesize:7 [2019-12-07 12:58:14,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:14,930 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:58:14,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:58:14,979 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 35 treesize of output 29 [2019-12-07 12:58:14,979 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 12:58:14,994 INFO L614 ElimStorePlain]: treesize reduction 28, result has 40.4 percent of original size [2019-12-07 12:58:14,994 INFO L502 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2019-12-07 12:58:14,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:58:14,996 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-07 12:58:14,996 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:24 [2019-12-07 12:58:15,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:58:15,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:15,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2080926345] [2019-12-07 12:58:15,068 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-12-07 12:58:15,068 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:58:15,072 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:58:15,076 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:58:15,077 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:58:15,151 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:58:15,287 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:58:15,739 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-12-07 12:58:15,894 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-12-07 12:58:16,112 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2019-12-07 12:58:16,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:58:16,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7, 7] total 23 [2019-12-07 12:58:16,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157614347] [2019-12-07 12:58:16,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:58:16,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:58:16,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:58:16,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2019-12-07 12:58:16,159 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 9 states. [2019-12-07 12:58:16,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:16,227 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-12-07 12:58:16,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 12:58:16,228 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-12-07 12:58:16,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:16,228 INFO L225 Difference]: With dead ends: 40 [2019-12-07 12:58:16,228 INFO L226 Difference]: Without dead ends: 40 [2019-12-07 12:58:16,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2019-12-07 12:58:16,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-12-07 12:58:16,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2019-12-07 12:58:16,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 12:58:16,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-12-07 12:58:16,231 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 12 [2019-12-07 12:58:16,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:16,231 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-12-07 12:58:16,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:58:16,231 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-12-07 12:58:16,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 12:58:16,231 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:16,231 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:16,432 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:58:16,432 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:58:16,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:16,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1437462083, now seen corresponding path program 1 times [2019-12-07 12:58:16,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:58:16,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553402403] [2019-12-07 12:58:16,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:58:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:58:16,471 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 12:58:16,471 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:58:16,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:58:16 BoogieIcfgContainer [2019-12-07 12:58:16,487 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:58:16,488 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:58:16,488 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:58:16,488 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:58:16,488 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:58:13" (3/4) ... [2019-12-07 12:58:16,490 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 12:58:16,490 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:58:16,491 INFO L168 Benchmark]: Toolchain (without parser) took 3506.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -155.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:58:16,492 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:58:16,492 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -137.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:58:16,492 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:58:16,493 INFO L168 Benchmark]: Boogie Preprocessor took 17.76 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:58:16,493 INFO L168 Benchmark]: RCFGBuilder took 267.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:58:16,493 INFO L168 Benchmark]: TraceAbstraction took 2844.19 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 45.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -61.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:58:16,493 INFO L168 Benchmark]: Witness Printer took 2.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:58:16,495 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 342.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -137.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.76 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 267.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2844.19 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 45.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -61.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 2.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 520]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 520. Possible FailurePath: [L521] List a = (List) malloc(sizeof(struct node)); [L522] COND FALSE !(a == 0) [L523] List t; [L524] List p = a; [L525] COND FALSE !(__VERIFIER_nondet_int()) [L532] p->h = 1 [L533] p->n = 0 [L534] p = a [L535] COND TRUE p!=0 [L536] EXPR p->h [L536] COND FALSE !(p->h != 1) [L539] EXPR p->n [L539] p = p->n [L535] COND FALSE !(p!=0) [L541] return 0; - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 35 locations, 16 error locations. Result: UNSAFE, OverallTime: 2.7s, OverallIterations: 9, TraceHistogramMax: 2, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 163 SDtfs, 264 SDslu, 137 SDs, 0 SdLazy, 374 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=5, 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, 48 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 80 ConstructedInterpolants, 4 QuantifiedInterpolants, 8707 SizeOfPredicates, 10 NumberOfNonLiveVariables, 66 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 7/10 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 219, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 10, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 17, TOOLS_POST_TIME[ms]: 104, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME[ms]: 0, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME[ms]: 0, TOOLS_QUANTIFIERELIM_APPLICATIONS: 17, TOOLS_QUANTIFIERELIM_TIME[ms]: 99, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 41, FLUID_QUERY_TIME[ms]: 3, FLUID_QUERIES: 32, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 2, DOMAIN_JOIN_TIME[ms]: 57, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME[ms]: 0, DOMAIN_ISSUBSETEQ_APPLICATIONS: 1, DOMAIN_ISSUBSETEQ_TIME[ms]: 2, DOMAIN_ISBOTTOM_APPLICATIONS: 10, DOMAIN_ISBOTTOM_TIME[ms]: 14, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 6, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 5, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 1, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME[ms]: 0, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 2, PATH_EXPR_TIME[ms]: 3, REGEX_TO_DAG_TIME[ms]: 3, DAG_COMPRESSION_TIME[ms]: 10, DAG_COMPRESSION_PROCESSED_NODES: 124, DAG_COMPRESSION_RETAINED_NODES: 34, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 12:58:17,906 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:58:17,908 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:58:17,917 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:58:17,917 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:58:17,918 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:58:17,919 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:58:17,921 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:58:17,922 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:58:17,923 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:58:17,924 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:58:17,925 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:58:17,925 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:58:17,926 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:58:17,927 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:58:17,928 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:58:17,929 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:58:17,930 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:58:17,931 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:58:17,933 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:58:17,935 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:58:17,936 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:58:17,937 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:58:17,938 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:58:17,940 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:58:17,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:58:17,941 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:58:17,942 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:58:17,942 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:58:17,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:58:17,943 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:58:17,943 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:58:17,944 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:58:17,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:58:17,945 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:58:17,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:58:17,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:58:17,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:58:17,946 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:58:17,947 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:58:17,948 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:58:17,949 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 12:58:17,961 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:58:17,962 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:58:17,962 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 12:58:17,962 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 12:58:17,963 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 12:58:17,963 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 12:58:17,963 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 12:58:17,963 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 12:58:17,963 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 12:58:17,963 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:58:17,964 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:58:17,964 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:58:17,964 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:58:17,964 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 12:58:17,964 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:58:17,965 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:58:17,965 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:58:17,965 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 12:58:17,965 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 12:58:17,965 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 12:58:17,965 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:58:17,965 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:58:17,966 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 12:58:17,966 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 12:58:17,966 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:58:17,966 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:58:17,966 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:58:17,966 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:58:17,966 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:58:17,966 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:58:17,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:58:17,967 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:58:17,967 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:58:17,967 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 12:58:17,967 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 12:58:17,967 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:58:17,968 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:58:17,968 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 17ff5ae56efea2deac29e7fa779d53a24810a7c7 [2019-12-07 12:58:18,136 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:58:18,144 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:58:18,146 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:58:18,147 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:58:18,147 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:58:18,148 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/../../sv-benchmarks/c/list-properties/simple-2.i [2019-12-07 12:58:18,186 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/data/40bddfcef/70532e28f6c84ff7b7814237187b6687/FLAGf3bdedfb8 [2019-12-07 12:58:18,544 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:58:18,544 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/sv-benchmarks/c/list-properties/simple-2.i [2019-12-07 12:58:18,553 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/data/40bddfcef/70532e28f6c84ff7b7814237187b6687/FLAGf3bdedfb8 [2019-12-07 12:58:18,957 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/data/40bddfcef/70532e28f6c84ff7b7814237187b6687 [2019-12-07 12:58:18,962 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:58:18,964 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:58:18,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:58:18,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:58:18,971 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:58:18,973 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:58:18" (1/1) ... [2019-12-07 12:58:18,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@576048d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:18, skipping insertion in model container [2019-12-07 12:58:18,977 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:58:18" (1/1) ... [2019-12-07 12:58:18,985 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:58:19,009 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:58:19,178 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:58:19,221 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:58:19,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:58:19,283 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:58:19,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:19 WrapperNode [2019-12-07 12:58:19,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:58:19,284 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:58:19,284 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:58:19,284 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:58:19,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:19" (1/1) ... [2019-12-07 12:58:19,301 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:19" (1/1) ... [2019-12-07 12:58:19,314 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:58:19,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:58:19,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:58:19,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:58:19,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:19" (1/1) ... [2019-12-07 12:58:19,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:19" (1/1) ... [2019-12-07 12:58:19,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:19" (1/1) ... [2019-12-07 12:58:19,323 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:19" (1/1) ... [2019-12-07 12:58:19,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:19" (1/1) ... [2019-12-07 12:58:19,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:19" (1/1) ... [2019-12-07 12:58:19,333 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:19" (1/1) ... [2019-12-07 12:58:19,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:58:19,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:58:19,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:58:19,335 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:58:19,335 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:58:19,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 12:58:19,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 12:58:19,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 12:58:19,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 12:58:19,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 12:58:19,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:58:19,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:58:19,605 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:58:19,605 INFO L287 CfgBuilder]: Removed 10 assume(true) statements. [2019-12-07 12:58:19,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:58:19 BoogieIcfgContainer [2019-12-07 12:58:19,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:58:19,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:58:19,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:58:19,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:58:19,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:58:18" (1/3) ... [2019-12-07 12:58:19,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ff37a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:58:19, skipping insertion in model container [2019-12-07 12:58:19,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:19" (2/3) ... [2019-12-07 12:58:19,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ff37a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:58:19, skipping insertion in model container [2019-12-07 12:58:19,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:58:19" (3/3) ... [2019-12-07 12:58:19,611 INFO L109 eAbstractionObserver]: Analyzing ICFG simple-2.i [2019-12-07 12:58:19,618 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:58:19,622 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-12-07 12:58:19,629 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-12-07 12:58:19,641 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:58:19,641 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 12:58:19,642 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:58:19,642 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:58:19,642 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:58:19,642 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:58:19,642 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:58:19,642 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:58:19,651 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-12-07 12:58:19,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 12:58:19,656 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:19,656 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 12:58:19,657 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:58:19,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:19,660 INFO L82 PathProgramCache]: Analyzing trace with hash 889599230, now seen corresponding path program 1 times [2019-12-07 12:58:19,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:58:19,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122261525] [2019-12-07 12:58:19,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 12:58:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:19,719 INFO L264 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:58:19,723 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:58:19,770 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 12:58:19,770 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:19,776 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:19,776 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:58:19,776 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 12:58:19,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:19,793 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:58:19,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:19,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122261525] [2019-12-07 12:58:19,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:19,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 12:58:19,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876384331] [2019-12-07 12:58:19,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:58:19,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:58:19,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:58:19,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:58:19,818 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 4 states. [2019-12-07 12:58:19,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:19,946 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-12-07 12:58:19,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:58:19,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 12:58:19,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:19,953 INFO L225 Difference]: With dead ends: 51 [2019-12-07 12:58:19,953 INFO L226 Difference]: Without dead ends: 45 [2019-12-07 12:58:19,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:58:19,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-12-07 12:58:19,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-12-07 12:58:19,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-07 12:58:19,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-12-07 12:58:19,976 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 6 [2019-12-07 12:58:19,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:19,976 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-12-07 12:58:19,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:58:19,977 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-12-07 12:58:19,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 12:58:19,977 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:19,977 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 12:58:20,177 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 12:58:20,178 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:58:20,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:20,179 INFO L82 PathProgramCache]: Analyzing trace with hash 889599231, now seen corresponding path program 1 times [2019-12-07 12:58:20,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:58:20,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756174465] [2019-12-07 12:58:20,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 12:58:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:20,229 INFO L264 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 12:58:20,230 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:58:20,238 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 12:58:20,238 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:20,245 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:20,246 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:58:20,246 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 12:58:20,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:20,264 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:58:20,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:20,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756174465] [2019-12-07 12:58:20,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:20,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 12:58:20,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125150492] [2019-12-07 12:58:20,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:58:20,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:58:20,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:58:20,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:58:20,340 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 6 states. [2019-12-07 12:58:20,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:20,608 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2019-12-07 12:58:20,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:58:20,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-12-07 12:58:20,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:20,610 INFO L225 Difference]: With dead ends: 54 [2019-12-07 12:58:20,610 INFO L226 Difference]: Without dead ends: 54 [2019-12-07 12:58:20,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:58:20,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-12-07 12:58:20,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2019-12-07 12:58:20,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-07 12:58:20,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-12-07 12:58:20,616 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 6 [2019-12-07 12:58:20,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:20,616 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-12-07 12:58:20,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:58:20,617 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-12-07 12:58:20,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:58:20,617 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:20,618 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:20,818 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 12:58:20,819 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:58:20,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:20,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1828101368, now seen corresponding path program 1 times [2019-12-07 12:58:20,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:58:20,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183435211] [2019-12-07 12:58:20,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 12:58:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:20,879 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:58:20,880 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:58:20,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:20,889 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:58:20,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:20,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183435211] [2019-12-07 12:58:20,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:20,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 12:58:20,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096770871] [2019-12-07 12:58:20,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:58:20,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:58:20,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:58:20,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:58:20,893 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 4 states. [2019-12-07 12:58:20,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:20,998 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2019-12-07 12:58:20,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:58:20,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 12:58:20,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:20,999 INFO L225 Difference]: With dead ends: 51 [2019-12-07 12:58:20,999 INFO L226 Difference]: Without dead ends: 51 [2019-12-07 12:58:21,000 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:58:21,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-07 12:58:21,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2019-12-07 12:58:21,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-07 12:58:21,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2019-12-07 12:58:21,004 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 11 [2019-12-07 12:58:21,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:21,004 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2019-12-07 12:58:21,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:58:21,004 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2019-12-07 12:58:21,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 12:58:21,004 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:21,005 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:21,205 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 12:58:21,206 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:58:21,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:21,206 INFO L82 PathProgramCache]: Analyzing trace with hash 836608451, now seen corresponding path program 1 times [2019-12-07 12:58:21,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:58:21,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255980272] [2019-12-07 12:58:21,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 12:58:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:21,283 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 12:58:21,284 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:58:21,302 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 11 treesize of output 7 [2019-12-07 12:58:21,302 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:21,309 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:21,309 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:58:21,309 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-12-07 12:58:21,336 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-12-07 12:58:21,336 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2019-12-07 12:58:21,336 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:21,339 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:21,339 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:58:21,339 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:7 [2019-12-07 12:58:21,356 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-12-07 12:58:21,356 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:21,358 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:21,358 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:58:21,359 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2019-12-07 12:58:21,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:21,366 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:58:21,376 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:58:21,380 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:21,380 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:58:21,381 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2019-12-07 12:58:21,412 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 79 treesize of output 75 [2019-12-07 12:58:21,413 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:21,461 INFO L614 ElimStorePlain]: treesize reduction 34, result has 39.3 percent of original size [2019-12-07 12:58:21,461 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 12:58:21,462 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-12-07 12:58:21,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:21,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255980272] [2019-12-07 12:58:21,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:21,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2019-12-07 12:58:21,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309246324] [2019-12-07 12:58:21,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:58:21,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:58:21,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:58:21,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:58:21,464 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 8 states. [2019-12-07 12:58:21,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:21,747 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-12-07 12:58:21,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 12:58:21,747 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-12-07 12:58:21,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:21,748 INFO L225 Difference]: With dead ends: 82 [2019-12-07 12:58:21,748 INFO L226 Difference]: Without dead ends: 82 [2019-12-07 12:58:21,749 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:58:21,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-12-07 12:58:21,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 50. [2019-12-07 12:58:21,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 12:58:21,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-12-07 12:58:21,754 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 12 [2019-12-07 12:58:21,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:21,755 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-12-07 12:58:21,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:58:21,755 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-12-07 12:58:21,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:58:21,756 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:21,756 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:21,956 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 12:58:21,957 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:58:21,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:21,958 INFO L82 PathProgramCache]: Analyzing trace with hash 903973711, now seen corresponding path program 1 times [2019-12-07 12:58:21,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:58:21,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [676526236] [2019-12-07 12:58:21,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 12:58:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:22,020 INFO L264 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 12:58:22,021 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:58:22,025 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 12:58:22,025 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:22,027 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:22,027 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:58:22,027 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 12:58:22,035 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-12-07 12:58:22,036 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:22,044 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:22,045 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:58:22,045 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:13 [2019-12-07 12:58:22,060 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-12-07 12:58:22,060 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:22,062 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:22,062 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:58:22,063 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:5 [2019-12-07 12:58:22,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:22,080 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:58:22,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:22,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [676526236] [2019-12-07 12:58:22,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:22,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 12:58:22,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227557990] [2019-12-07 12:58:22,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:58:22,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:58:22,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:58:22,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:58:22,095 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 6 states. [2019-12-07 12:58:22,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:22,411 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2019-12-07 12:58:22,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:58:22,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-12-07 12:58:22,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:22,413 INFO L225 Difference]: With dead ends: 62 [2019-12-07 12:58:22,413 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 12:58:22,414 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:58:22,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 12:58:22,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2019-12-07 12:58:22,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 12:58:22,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2019-12-07 12:58:22,419 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 13 [2019-12-07 12:58:22,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:22,419 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2019-12-07 12:58:22,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:58:22,420 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2019-12-07 12:58:22,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:58:22,420 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:22,420 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:22,621 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 12:58:22,621 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:58:22,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:22,622 INFO L82 PathProgramCache]: Analyzing trace with hash 903973712, now seen corresponding path program 1 times [2019-12-07 12:58:22,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:58:22,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33587418] [2019-12-07 12:58:22,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 12:58:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:22,684 INFO L264 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 12:58:22,685 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:58:22,690 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 12:58:22,691 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:22,695 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:22,695 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:58:22,695 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 12:58:22,707 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-12-07 12:58:22,707 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:22,721 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:22,725 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-12-07 12:58:22,725 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:22,734 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:22,735 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:58:22,735 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2019-12-07 12:58:22,755 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 21 treesize of output 9 [2019-12-07 12:58:22,756 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:22,765 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:22,767 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 19 treesize of output 7 [2019-12-07 12:58:22,768 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:22,772 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:22,772 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:58:22,772 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:9 [2019-12-07 12:58:22,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:22,795 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:58:23,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:23,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33587418] [2019-12-07 12:58:23,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:23,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-12-07 12:58:23,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854436842] [2019-12-07 12:58:23,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:58:23,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:58:23,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:58:23,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:58:23,002 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 10 states. [2019-12-07 12:58:23,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:23,714 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-12-07 12:58:23,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:58:23,715 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-12-07 12:58:23,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:23,716 INFO L225 Difference]: With dead ends: 58 [2019-12-07 12:58:23,716 INFO L226 Difference]: Without dead ends: 58 [2019-12-07 12:58:23,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-12-07 12:58:23,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-12-07 12:58:23,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 38. [2019-12-07 12:58:23,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 12:58:23,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2019-12-07 12:58:23,718 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 13 [2019-12-07 12:58:23,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:23,719 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2019-12-07 12:58:23,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:58:23,719 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2019-12-07 12:58:23,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 12:58:23,719 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:23,719 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:23,920 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 12:58:23,920 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:58:23,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:23,921 INFO L82 PathProgramCache]: Analyzing trace with hash -288017401, now seen corresponding path program 1 times [2019-12-07 12:58:23,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:58:23,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2060106476] [2019-12-07 12:58:23,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 12:58:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:23,977 INFO L264 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 12:58:23,978 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:58:23,993 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-12-07 12:58:23,993 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:24,001 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:24,004 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-12-07 12:58:24,004 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:24,010 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:24,011 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:58:24,011 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2019-12-07 12:58:24,040 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 19 treesize of output 7 [2019-12-07 12:58:24,041 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:24,048 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:24,051 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 19 treesize of output 7 [2019-12-07 12:58:24,051 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:24,055 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:24,055 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:58:24,055 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2019-12-07 12:58:24,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:24,083 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:58:24,095 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 35 treesize of output 29 [2019-12-07 12:58:24,095 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 12:58:24,106 INFO L614 ElimStorePlain]: treesize reduction 19, result has 36.7 percent of original size [2019-12-07 12:58:24,106 INFO L502 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2019-12-07 12:58:24,106 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 12:58:24,106 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:11 [2019-12-07 12:58:24,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:24,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2060106476] [2019-12-07 12:58:24,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1952932571] [2019-12-07 12:58:24,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:58:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:24,171 INFO L264 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 12:58:24,172 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:58:24,201 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-12-07 12:58:24,201 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:24,210 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:24,212 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-12-07 12:58:24,213 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:24,219 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:24,219 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:58:24,219 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-12-07 12:58:24,265 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-12-07 12:58:24,266 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:24,272 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:24,274 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-12-07 12:58:24,274 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:24,278 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:24,278 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:58:24,278 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-12-07 12:58:24,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:24,280 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:58:24,292 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 35 treesize of output 29 [2019-12-07 12:58:24,293 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 12:58:24,304 INFO L614 ElimStorePlain]: treesize reduction 19, result has 36.7 percent of original size [2019-12-07 12:58:24,304 INFO L502 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2019-12-07 12:58:24,305 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 12:58:24,305 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:11 [2019-12-07 12:58:24,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:24,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895369422] [2019-12-07 12:58:24,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:58:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:24,370 INFO L264 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 12:58:24,371 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:58:24,377 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-12-07 12:58:24,377 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:24,385 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:24,388 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-12-07 12:58:24,388 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:24,394 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:24,395 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:58:24,395 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-12-07 12:58:24,401 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-12-07 12:58:24,402 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:24,407 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:24,409 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-12-07 12:58:24,409 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:24,412 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:24,413 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:58:24,413 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-12-07 12:58:24,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:24,414 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:58:24,425 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 35 treesize of output 29 [2019-12-07 12:58:24,426 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 12:58:24,440 INFO L614 ElimStorePlain]: treesize reduction 19, result has 36.7 percent of original size [2019-12-07 12:58:24,440 INFO L502 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2019-12-07 12:58:24,440 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 12:58:24,441 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:11 [2019-12-07 12:58:24,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:24,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 12:58:24,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 7, 8, 7] total 11 [2019-12-07 12:58:24,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194716005] [2019-12-07 12:58:24,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 12:58:24,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:58:24,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 12:58:24,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:58:24,445 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 11 states. [2019-12-07 12:58:24,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:24,805 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2019-12-07 12:58:24,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 12:58:24,805 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2019-12-07 12:58:24,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:24,806 INFO L225 Difference]: With dead ends: 53 [2019-12-07 12:58:24,806 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 12:58:24,806 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-12-07 12:58:24,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 12:58:24,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2019-12-07 12:58:24,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 12:58:24,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-12-07 12:58:24,809 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 15 [2019-12-07 12:58:24,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:24,809 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-12-07 12:58:24,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 12:58:24,809 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-12-07 12:58:24,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:58:24,809 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:24,809 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:25,410 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk,8 mathsat -unsat_core_generation=3,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:58:25,410 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:58:25,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:25,411 INFO L82 PathProgramCache]: Analyzing trace with hash -338606125, now seen corresponding path program 1 times [2019-12-07 12:58:25,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:58:25,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419020386] [2019-12-07 12:58:25,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53cbfbbd-b18a-44b5-aba8-f401735bff70/bin/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-12-07 12:58:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:58:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:58:25,494 INFO L174 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2019-12-07 12:58:25,494 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:58:25,694 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 12:58:25,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:58:25 BoogieIcfgContainer [2019-12-07 12:58:25,718 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:58:25,718 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:58:25,718 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:58:25,718 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:58:25,719 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:58:19" (3/4) ... [2019-12-07 12:58:25,721 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 12:58:25,721 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:58:25,722 INFO L168 Benchmark]: Toolchain (without parser) took 6759.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.0 MB). Free memory was 945.7 MB in the beginning and 1.0 GB in the end (delta: -88.5 MB). Peak memory consumption was 106.5 MB. Max. memory is 11.5 GB. [2019-12-07 12:58:25,722 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:58:25,722 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -157.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:58:25,722 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:58:25,723 INFO L168 Benchmark]: Boogie Preprocessor took 20.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:58:25,723 INFO L168 Benchmark]: RCFGBuilder took 271.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:58:25,723 INFO L168 Benchmark]: TraceAbstraction took 6111.75 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.2 MB). Peak memory consumption was 109.6 MB. Max. memory is 11.5 GB. [2019-12-07 12:58:25,723 INFO L168 Benchmark]: Witness Printer took 2.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:58:25,725 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 318.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -157.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 271.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6111.75 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.2 MB). Peak memory consumption was 109.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 520]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 520. Possible FailurePath: [L521] List a = (List) malloc(sizeof(struct node)); [L522] COND FALSE !(a == 0) [L523] List t; [L524] List p = a; [L525] COND FALSE !(__VERIFIER_nondet_int()) [L532] p->h = 1 [L533] p->n = 0 [L534] p = a [L535] COND TRUE p!=0 [L536] EXPR p->h [L536] COND FALSE !(p->h != 1) [L539] EXPR p->n [L539] p = p->n [L535] COND FALSE !(p!=0) [L541] return 0; - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 16 error locations. Result: UNSAFE, OverallTime: 6.0s, OverallIterations: 8, TraceHistogramMax: 2, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 158 SDtfs, 432 SDslu, 372 SDs, 0 SdLazy, 640 SolverSat, 91 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 155 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=4, 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, 7 MinimizatonAttempts, 97 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 122 NumberOfCodeBlocks, 122 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 194 ConstructedInterpolants, 1 QuantifiedInterpolants, 17798 SizeOfPredicates, 76 NumberOfNonLiveVariables, 391 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 18 InterpolantComputations, 12 PerfectInterpolantSequences, 10/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...