./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2c7de5fb661efaece6ac30dedf2d78ac089ace75 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2c7de5fb661efaece6ac30dedf2d78ac089ace75 ..................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:34:35,225 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:34:35,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:34:35,236 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:34:35,237 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:34:35,238 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:34:35,239 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:34:35,241 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:34:35,243 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:34:35,243 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:34:35,244 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:34:35,245 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:34:35,246 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:34:35,247 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:34:35,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:34:35,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:34:35,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:34:35,250 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:34:35,252 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:34:35,254 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:34:35,255 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:34:35,256 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:34:35,257 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:34:35,258 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:34:35,260 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:34:35,261 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:34:35,261 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:34:35,262 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:34:35,262 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:34:35,263 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:34:35,263 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:34:35,264 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:34:35,265 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:34:35,265 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:34:35,266 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:34:35,266 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:34:35,267 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:34:35,267 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:34:35,268 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:34:35,268 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:34:35,269 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:34:35,270 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-16 00:34:35,282 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:34:35,283 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:34:35,284 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:34:35,284 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:34:35,284 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:34:35,285 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:34:35,285 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:34:35,285 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:34:35,285 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:34:35,286 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:34:35,286 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:34:35,286 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-16 00:34:35,286 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-16 00:34:35,287 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-16 00:34:35,287 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:34:35,287 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:34:35,287 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:34:35,288 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:34:35,288 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:34:35,288 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:34:35,288 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:34:35,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:34:35,289 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:34:35,289 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:34:35,289 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:34:35,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:34:35,290 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2c7de5fb661efaece6ac30dedf2d78ac089ace75 [2019-11-16 00:34:35,316 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:34:35,326 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:34:35,329 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:34:35,330 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:34:35,330 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:34:35,331 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2019-11-16 00:34:35,382 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/data/2b1c84b4c/3410d5165f784da68e1029ac62f8fefd/FLAGfddc4eddf [2019-11-16 00:34:35,889 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:34:35,891 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2019-11-16 00:34:35,908 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/data/2b1c84b4c/3410d5165f784da68e1029ac62f8fefd/FLAGfddc4eddf [2019-11-16 00:34:36,399 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/data/2b1c84b4c/3410d5165f784da68e1029ac62f8fefd [2019-11-16 00:34:36,401 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:34:36,402 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-16 00:34:36,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:34:36,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:34:36,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:34:36,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:34:36" (1/1) ... [2019-11-16 00:34:36,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c611b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:36, skipping insertion in model container [2019-11-16 00:34:36,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:34:36" (1/1) ... [2019-11-16 00:34:36,417 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:34:36,460 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:34:36,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:34:36,833 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:34:36,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:34:36,943 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:34:36,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:36 WrapperNode [2019-11-16 00:34:36,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:34:36,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:34:36,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:34:36,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:34:36,956 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:36" (1/1) ... [2019-11-16 00:34:36,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:36" (1/1) ... [2019-11-16 00:34:36,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:36" (1/1) ... [2019-11-16 00:34:36,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:36" (1/1) ... [2019-11-16 00:34:36,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:36" (1/1) ... [2019-11-16 00:34:36,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:36" (1/1) ... [2019-11-16 00:34:37,000 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:36" (1/1) ... [2019-11-16 00:34:37,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:34:37,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:34:37,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:34:37,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:34:37,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:34:37,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-16 00:34:37,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:34:37,069 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-16 00:34:37,069 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-16 00:34:37,070 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-16 00:34:37,070 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-16 00:34:37,071 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2019-11-16 00:34:37,071 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2019-11-16 00:34:37,071 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_prepend [2019-11-16 00:34:37,071 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-16 00:34:37,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-16 00:34:37,072 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-16 00:34:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-16 00:34:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-16 00:34:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-16 00:34:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-16 00:34:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-16 00:34:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-16 00:34:37,076 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-16 00:34:37,076 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-16 00:34:37,076 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-16 00:34:37,076 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-16 00:34:37,076 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-16 00:34:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-16 00:34:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-16 00:34:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-16 00:34:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-16 00:34:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-16 00:34:37,079 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-16 00:34:37,079 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-16 00:34:37,079 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-16 00:34:37,079 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-16 00:34:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-16 00:34:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-16 00:34:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-16 00:34:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-16 00:34:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-16 00:34:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-16 00:34:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-16 00:34:37,081 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-16 00:34:37,081 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-16 00:34:37,081 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-16 00:34:37,081 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-16 00:34:37,081 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-16 00:34:37,081 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-16 00:34:37,082 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-16 00:34:37,083 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-16 00:34:37,083 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-16 00:34:37,083 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-16 00:34:37,083 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-16 00:34:37,083 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-16 00:34:37,083 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-16 00:34:37,083 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-16 00:34:37,084 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-16 00:34:37,084 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-16 00:34:37,084 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-16 00:34:37,084 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-16 00:34:37,084 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-16 00:34:37,084 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-16 00:34:37,084 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-16 00:34:37,085 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-16 00:34:37,085 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-16 00:34:37,085 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-16 00:34:37,085 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-16 00:34:37,085 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-16 00:34:37,086 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-16 00:34:37,086 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-16 00:34:37,086 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-16 00:34:37,086 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-16 00:34:37,086 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-16 00:34:37,087 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-16 00:34:37,087 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-16 00:34:37,087 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-16 00:34:37,087 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-16 00:34:37,088 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-16 00:34:37,088 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-16 00:34:37,089 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-16 00:34:37,090 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-16 00:34:37,090 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-16 00:34:37,090 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-16 00:34:37,090 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-16 00:34:37,090 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-16 00:34:37,090 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-16 00:34:37,090 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-16 00:34:37,091 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-16 00:34:37,091 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-16 00:34:37,091 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-16 00:34:37,091 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-16 00:34:37,091 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-16 00:34:37,091 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-16 00:34:37,091 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-16 00:34:37,091 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-16 00:34:37,092 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-16 00:34:37,092 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-16 00:34:37,092 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-16 00:34:37,092 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-16 00:34:37,092 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-16 00:34:37,092 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-16 00:34:37,092 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-16 00:34:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-16 00:34:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-16 00:34:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-16 00:34:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-16 00:34:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-16 00:34:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-16 00:34:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-16 00:34:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-16 00:34:37,094 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-16 00:34:37,094 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-16 00:34:37,094 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-16 00:34:37,094 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-16 00:34:37,094 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-16 00:34:37,094 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-16 00:34:37,094 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-16 00:34:37,095 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-16 00:34:37,095 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-16 00:34:37,095 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-16 00:34:37,096 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-16 00:34:37,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:34:37,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:34:37,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:34:37,096 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2019-11-16 00:34:37,096 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2019-11-16 00:34:37,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:34:37,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:34:37,097 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_prepend [2019-11-16 00:34:37,097 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-16 00:34:37,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:34:37,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-16 00:34:37,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:34:37,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-16 00:34:37,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:34:37,518 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-16 00:34:37,843 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:34:37,843 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-16 00:34:37,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:34:37 BoogieIcfgContainer [2019-11-16 00:34:37,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:34:37,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:34:37,846 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:34:37,849 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:34:37,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:34:36" (1/3) ... [2019-11-16 00:34:37,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403e9e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:34:37, skipping insertion in model container [2019-11-16 00:34:37,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:36" (2/3) ... [2019-11-16 00:34:37,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403e9e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:34:37, skipping insertion in model container [2019-11-16 00:34:37,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:34:37" (3/3) ... [2019-11-16 00:34:37,853 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.i [2019-11-16 00:34:37,862 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:34:37,869 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2019-11-16 00:34:37,878 INFO L249 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2019-11-16 00:34:37,898 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:34:37,898 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-16 00:34:37,898 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:34:37,898 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:34:37,898 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:34:37,898 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:34:37,898 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:34:37,899 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:34:37,924 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-11-16 00:34:37,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:34:37,934 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:34:37,935 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:34:37,936 INFO L410 AbstractCegarLoop]: === Iteration 1 === [sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:34:37,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:34:37,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1474046873, now seen corresponding path program 1 times [2019-11-16 00:34:37,949 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:34:37,949 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220803246] [2019-11-16 00:34:37,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:37,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:37,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:34:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:38,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:34:38,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220803246] [2019-11-16 00:34:38,171 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:34:38,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:34:38,171 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543691252] [2019-11-16 00:34:38,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:34:38,175 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:34:38,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:34:38,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:34:38,191 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-11-16 00:34:38,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:34:38,622 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2019-11-16 00:34:38,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:34:38,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-16 00:34:38,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:34:38,643 INFO L225 Difference]: With dead ends: 160 [2019-11-16 00:34:38,643 INFO L226 Difference]: Without dead ends: 153 [2019-11-16 00:34:38,645 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:34:38,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-16 00:34:38,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 134. [2019-11-16 00:34:38,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-16 00:34:38,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 141 transitions. [2019-11-16 00:34:38,717 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 141 transitions. Word has length 12 [2019-11-16 00:34:38,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:34:38,717 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 141 transitions. [2019-11-16 00:34:38,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:34:38,718 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 141 transitions. [2019-11-16 00:34:38,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:34:38,718 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:34:38,718 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:34:38,719 INFO L410 AbstractCegarLoop]: === Iteration 2 === [sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:34:38,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:34:38,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1474046872, now seen corresponding path program 1 times [2019-11-16 00:34:38,719 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:34:38,719 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242197123] [2019-11-16 00:34:38,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:38,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:38,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:34:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:38,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:34:38,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242197123] [2019-11-16 00:34:38,835 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:34:38,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:34:38,836 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716979031] [2019-11-16 00:34:38,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:34:38,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:34:38,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:34:38,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:34:38,838 INFO L87 Difference]: Start difference. First operand 134 states and 141 transitions. Second operand 4 states. [2019-11-16 00:34:39,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:34:39,173 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2019-11-16 00:34:39,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:34:39,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-16 00:34:39,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:34:39,175 INFO L225 Difference]: With dead ends: 151 [2019-11-16 00:34:39,176 INFO L226 Difference]: Without dead ends: 151 [2019-11-16 00:34:39,176 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:34:39,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-16 00:34:39,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 132. [2019-11-16 00:34:39,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-16 00:34:39,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2019-11-16 00:34:39,191 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 12 [2019-11-16 00:34:39,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:34:39,192 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2019-11-16 00:34:39,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:34:39,192 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2019-11-16 00:34:39,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-16 00:34:39,193 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:34:39,193 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:34:39,194 INFO L410 AbstractCegarLoop]: === Iteration 3 === [sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:34:39,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:34:39,194 INFO L82 PathProgramCache]: Analyzing trace with hash 889247132, now seen corresponding path program 1 times [2019-11-16 00:34:39,194 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:34:39,194 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095583199] [2019-11-16 00:34:39,195 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:39,195 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:39,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:34:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:39,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:34:39,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095583199] [2019-11-16 00:34:39,394 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:34:39,395 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:34:39,395 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800338541] [2019-11-16 00:34:39,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:34:39,395 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:34:39,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:34:39,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:34:39,396 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand 8 states. [2019-11-16 00:34:40,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:34:40,046 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2019-11-16 00:34:40,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:34:40,046 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-16 00:34:40,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:34:40,048 INFO L225 Difference]: With dead ends: 155 [2019-11-16 00:34:40,049 INFO L226 Difference]: Without dead ends: 155 [2019-11-16 00:34:40,049 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:34:40,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-16 00:34:40,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 134. [2019-11-16 00:34:40,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-16 00:34:40,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2019-11-16 00:34:40,066 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 19 [2019-11-16 00:34:40,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:34:40,066 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2019-11-16 00:34:40,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:34:40,066 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2019-11-16 00:34:40,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-16 00:34:40,067 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:34:40,067 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:34:40,068 INFO L410 AbstractCegarLoop]: === Iteration 4 === [sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:34:40,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:34:40,068 INFO L82 PathProgramCache]: Analyzing trace with hash 889247133, now seen corresponding path program 1 times [2019-11-16 00:34:40,068 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:34:40,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684499458] [2019-11-16 00:34:40,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:40,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:40,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:34:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:40,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:34:40,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684499458] [2019-11-16 00:34:40,230 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:34:40,231 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:34:40,231 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750233787] [2019-11-16 00:34:40,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:34:40,231 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:34:40,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:34:40,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:34:40,232 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand 7 states. [2019-11-16 00:34:40,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:34:40,665 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2019-11-16 00:34:40,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:34:40,665 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-16 00:34:40,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:34:40,667 INFO L225 Difference]: With dead ends: 152 [2019-11-16 00:34:40,667 INFO L226 Difference]: Without dead ends: 152 [2019-11-16 00:34:40,667 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:34:40,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-16 00:34:40,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 133. [2019-11-16 00:34:40,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-16 00:34:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2019-11-16 00:34:40,677 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 19 [2019-11-16 00:34:40,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:34:40,677 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2019-11-16 00:34:40,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:34:40,677 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2019-11-16 00:34:40,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-16 00:34:40,678 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:34:40,678 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:34:40,679 INFO L410 AbstractCegarLoop]: === Iteration 5 === [sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:34:40,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:34:40,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1411017804, now seen corresponding path program 1 times [2019-11-16 00:34:40,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:34:40,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901277698] [2019-11-16 00:34:40,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:40,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:40,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:34:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:40,785 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:34:40,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901277698] [2019-11-16 00:34:40,785 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:34:40,785 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:34:40,785 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976167084] [2019-11-16 00:34:40,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:34:40,786 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:34:40,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:34:40,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:34:40,787 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand 8 states. [2019-11-16 00:34:41,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:34:41,264 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions. [2019-11-16 00:34:41,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:34:41,264 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-11-16 00:34:41,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:34:41,265 INFO L225 Difference]: With dead ends: 152 [2019-11-16 00:34:41,265 INFO L226 Difference]: Without dead ends: 152 [2019-11-16 00:34:41,266 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:34:41,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-16 00:34:41,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 132. [2019-11-16 00:34:41,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-16 00:34:41,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2019-11-16 00:34:41,273 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 28 [2019-11-16 00:34:41,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:34:41,273 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2019-11-16 00:34:41,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:34:41,274 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2019-11-16 00:34:41,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-16 00:34:41,274 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:34:41,275 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:34:41,275 INFO L410 AbstractCegarLoop]: === Iteration 6 === [sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:34:41,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:34:41,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1411017803, now seen corresponding path program 1 times [2019-11-16 00:34:41,275 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:34:41,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871849695] [2019-11-16 00:34:41,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:41,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:41,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:34:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:41,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:41,445 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:34:41,445 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871849695] [2019-11-16 00:34:41,445 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:34:41,446 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:34:41,446 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388404178] [2019-11-16 00:34:41,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:34:41,446 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:34:41,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:34:41,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:34:41,447 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand 8 states. [2019-11-16 00:34:42,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:34:42,002 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2019-11-16 00:34:42,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:34:42,003 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-11-16 00:34:42,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:34:42,004 INFO L225 Difference]: With dead ends: 151 [2019-11-16 00:34:42,004 INFO L226 Difference]: Without dead ends: 151 [2019-11-16 00:34:42,005 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:34:42,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-16 00:34:42,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 131. [2019-11-16 00:34:42,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-16 00:34:42,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 138 transitions. [2019-11-16 00:34:42,011 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 138 transitions. Word has length 28 [2019-11-16 00:34:42,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:34:42,011 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 138 transitions. [2019-11-16 00:34:42,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:34:42,012 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 138 transitions. [2019-11-16 00:34:42,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-16 00:34:42,017 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:34:42,017 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:34:42,018 INFO L410 AbstractCegarLoop]: === Iteration 7 === [sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:34:42,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:34:42,018 INFO L82 PathProgramCache]: Analyzing trace with hash -786360054, now seen corresponding path program 1 times [2019-11-16 00:34:42,018 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:34:42,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241585518] [2019-11-16 00:34:42,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:42,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:42,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:34:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:34:42,229 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241585518] [2019-11-16 00:34:42,229 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671382904] [2019-11-16 00:34:42,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:42,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-16 00:34:42,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:34:42,544 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:34:42,556 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:42,557 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 23 [2019-11-16 00:34:42,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:42,575 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-16 00:34:42,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:34:42,576 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-16 00:34:42,584 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:34:42,585 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:34:42,585 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-11-16 00:34:42,585 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364827591] [2019-11-16 00:34:42,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-16 00:34:42,586 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:34:42,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:34:42,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:34:42,586 INFO L87 Difference]: Start difference. First operand 131 states and 138 transitions. Second operand 12 states. [2019-11-16 00:34:43,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:34:43,589 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2019-11-16 00:34:43,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:34:43,589 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-11-16 00:34:43,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:34:43,591 INFO L225 Difference]: With dead ends: 151 [2019-11-16 00:34:43,591 INFO L226 Difference]: Without dead ends: 151 [2019-11-16 00:34:43,592 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:34:43,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-16 00:34:43,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 130. [2019-11-16 00:34:43,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-16 00:34:43,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 137 transitions. [2019-11-16 00:34:43,598 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 137 transitions. Word has length 31 [2019-11-16 00:34:43,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:34:43,599 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 137 transitions. [2019-11-16 00:34:43,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-16 00:34:43,599 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2019-11-16 00:34:43,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-16 00:34:43,610 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:34:43,610 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:34:43,846 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:43,846 INFO L410 AbstractCegarLoop]: === Iteration 8 === [sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:34:43,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:34:43,847 INFO L82 PathProgramCache]: Analyzing trace with hash -786360053, now seen corresponding path program 1 times [2019-11-16 00:34:43,847 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:34:43,847 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295106649] [2019-11-16 00:34:43,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:43,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:43,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:34:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:44,038 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:34:44,039 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295106649] [2019-11-16 00:34:44,039 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236195041] [2019-11-16 00:34:44,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:44,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-16 00:34:44,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:34:44,203 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:34:44,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:44,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:44,206 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:34:44,206 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-16 00:34:44,400 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:44,401 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 33 [2019-11-16 00:34:44,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:44,426 INFO L567 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2019-11-16 00:34:44,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:34:44,426 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:17 [2019-11-16 00:34:44,444 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:34:44,444 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:34:44,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-16 00:34:44,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691844014] [2019-11-16 00:34:44,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-16 00:34:44,445 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:34:44,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:34:44,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:34:44,446 INFO L87 Difference]: Start difference. First operand 130 states and 137 transitions. Second operand 16 states. [2019-11-16 00:34:45,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:34:45,455 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2019-11-16 00:34:45,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:34:45,455 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2019-11-16 00:34:45,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:34:45,456 INFO L225 Difference]: With dead ends: 150 [2019-11-16 00:34:45,457 INFO L226 Difference]: Without dead ends: 150 [2019-11-16 00:34:45,457 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:34:45,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-16 00:34:45,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 129. [2019-11-16 00:34:45,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-16 00:34:45,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 136 transitions. [2019-11-16 00:34:45,463 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 136 transitions. Word has length 31 [2019-11-16 00:34:45,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:34:45,463 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 136 transitions. [2019-11-16 00:34:45,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-16 00:34:45,463 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 136 transitions. [2019-11-16 00:34:45,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:34:45,465 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:34:45,465 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:34:45,669 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:45,669 INFO L410 AbstractCegarLoop]: === Iteration 9 === [sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:34:45,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:34:45,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1603382588, now seen corresponding path program 1 times [2019-11-16 00:34:45,669 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:34:45,670 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117136188] [2019-11-16 00:34:45,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:45,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:45,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:34:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:46,327 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 21 [2019-11-16 00:34:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:46,553 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:34:46,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117136188] [2019-11-16 00:34:46,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595798761] [2019-11-16 00:34:46,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:46,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-16 00:34:46,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:34:46,721 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:34:46,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:46,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:46,726 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:34:46,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-16 00:34:46,741 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2019-11-16 00:34:46,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:46,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:46,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:34:46,747 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-16 00:34:46,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:34:46,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:34:46,904 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-16 00:34:46,905 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-16 00:34:46,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:46,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:46,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:34:46,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:27 [2019-11-16 00:34:47,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:34:47,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:34:47,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:47,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:47,075 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:34:47,075 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-16 00:34:47,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:34:47,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:34:47,109 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:47,109 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 [2019-11-16 00:34:47,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:47,142 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-11-16 00:34:47,143 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:34:47,143 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:26 [2019-11-16 00:34:47,198 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-16 00:34:47,201 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:34:47,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 21 [2019-11-16 00:34:47,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134020144] [2019-11-16 00:34:47,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-16 00:34:47,204 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:34:47,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-16 00:34:47,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:34:47,205 INFO L87 Difference]: Start difference. First operand 129 states and 136 transitions. Second operand 22 states. [2019-11-16 00:34:48,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:34:48,510 INFO L93 Difference]: Finished difference Result 244 states and 262 transitions. [2019-11-16 00:34:48,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:34:48,510 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2019-11-16 00:34:48,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:34:48,512 INFO L225 Difference]: With dead ends: 244 [2019-11-16 00:34:48,512 INFO L226 Difference]: Without dead ends: 244 [2019-11-16 00:34:48,513 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=196, Invalid=734, Unknown=0, NotChecked=0, Total=930 [2019-11-16 00:34:48,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-11-16 00:34:48,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 155. [2019-11-16 00:34:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-16 00:34:48,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 184 transitions. [2019-11-16 00:34:48,520 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 184 transitions. Word has length 47 [2019-11-16 00:34:48,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:34:48,521 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 184 transitions. [2019-11-16 00:34:48,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-16 00:34:48,521 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 184 transitions. [2019-11-16 00:34:48,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:34:48,534 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:34:48,535 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:34:48,738 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:48,739 INFO L410 AbstractCegarLoop]: === Iteration 10 === [sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:34:48,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:34:48,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1603382587, now seen corresponding path program 1 times [2019-11-16 00:34:48,740 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:34:48,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855870644] [2019-11-16 00:34:48,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:48,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:48,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:34:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:49,221 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-16 00:34:49,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855870644] [2019-11-16 00:34:49,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591167090] [2019-11-16 00:34:49,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:49,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-16 00:34:49,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:34:49,384 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:34:49,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:49,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:49,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:34:49,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-16 00:34:49,414 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2019-11-16 00:34:49,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:49,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:49,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:34:49,420 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-16 00:34:49,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:34:49,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:34:49,521 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-16 00:34:49,522 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-16 00:34:49,522 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:49,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:49,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:34:49,533 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:30 [2019-11-16 00:34:49,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:34:49,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:34:49,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:49,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:49,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:34:49,627 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-16 00:34:49,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:34:49,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:34:49,651 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:49,651 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 [2019-11-16 00:34:49,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:49,673 INFO L567 ElimStorePlain]: treesize reduction 14, result has 67.4 percent of original size [2019-11-16 00:34:49,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:34:49,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:29 [2019-11-16 00:34:49,724 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-16 00:34:49,724 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:34:49,725 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-11-16 00:34:49,725 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271295070] [2019-11-16 00:34:49,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-16 00:34:49,726 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:34:49,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-16 00:34:49,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:34:49,726 INFO L87 Difference]: Start difference. First operand 155 states and 184 transitions. Second operand 18 states. [2019-11-16 00:34:50,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:34:50,877 INFO L93 Difference]: Finished difference Result 253 states and 271 transitions. [2019-11-16 00:34:50,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:34:50,880 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2019-11-16 00:34:50,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:34:50,882 INFO L225 Difference]: With dead ends: 253 [2019-11-16 00:34:50,882 INFO L226 Difference]: Without dead ends: 253 [2019-11-16 00:34:50,882 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2019-11-16 00:34:50,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-11-16 00:34:50,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 168. [2019-11-16 00:34:50,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-16 00:34:50,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 199 transitions. [2019-11-16 00:34:50,892 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 199 transitions. Word has length 47 [2019-11-16 00:34:50,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:34:50,893 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 199 transitions. [2019-11-16 00:34:50,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-16 00:34:50,894 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 199 transitions. [2019-11-16 00:34:50,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-16 00:34:50,895 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:34:50,895 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:34:51,106 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:51,107 INFO L410 AbstractCegarLoop]: === Iteration 11 === [sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:34:51,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:34:51,107 INFO L82 PathProgramCache]: Analyzing trace with hash -2039250174, now seen corresponding path program 1 times [2019-11-16 00:34:51,107 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:34:51,107 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575865294] [2019-11-16 00:34:51,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:51,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:51,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:34:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:51,235 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-16 00:34:51,236 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575865294] [2019-11-16 00:34:51,236 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:34:51,236 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:34:51,236 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484235865] [2019-11-16 00:34:51,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:34:51,237 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:34:51,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:34:51,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:34:51,237 INFO L87 Difference]: Start difference. First operand 168 states and 199 transitions. Second operand 8 states. [2019-11-16 00:34:51,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:34:51,672 INFO L93 Difference]: Finished difference Result 185 states and 215 transitions. [2019-11-16 00:34:51,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:34:51,673 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-11-16 00:34:51,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:34:51,674 INFO L225 Difference]: With dead ends: 185 [2019-11-16 00:34:51,674 INFO L226 Difference]: Without dead ends: 185 [2019-11-16 00:34:51,675 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:34:51,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-16 00:34:51,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 166. [2019-11-16 00:34:51,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-16 00:34:51,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 195 transitions. [2019-11-16 00:34:51,683 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 195 transitions. Word has length 50 [2019-11-16 00:34:51,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:34:51,683 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 195 transitions. [2019-11-16 00:34:51,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:34:51,684 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 195 transitions. [2019-11-16 00:34:51,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-16 00:34:51,685 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:34:51,685 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:34:51,686 INFO L410 AbstractCegarLoop]: === Iteration 12 === [sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:34:51,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:34:51,686 INFO L82 PathProgramCache]: Analyzing trace with hash -2039250173, now seen corresponding path program 1 times [2019-11-16 00:34:51,686 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:34:51,686 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827594893] [2019-11-16 00:34:51,687 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:51,687 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:51,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:34:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:51,828 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-16 00:34:51,828 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827594893] [2019-11-16 00:34:51,829 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:34:51,829 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:34:51,829 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954289866] [2019-11-16 00:34:51,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:34:51,831 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:34:51,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:34:51,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:34:51,832 INFO L87 Difference]: Start difference. First operand 166 states and 195 transitions. Second operand 8 states. [2019-11-16 00:34:52,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:34:52,192 INFO L93 Difference]: Finished difference Result 183 states and 211 transitions. [2019-11-16 00:34:52,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:34:52,193 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-11-16 00:34:52,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:34:52,194 INFO L225 Difference]: With dead ends: 183 [2019-11-16 00:34:52,194 INFO L226 Difference]: Without dead ends: 183 [2019-11-16 00:34:52,195 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:34:52,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-16 00:34:52,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 164. [2019-11-16 00:34:52,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-16 00:34:52,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 191 transitions. [2019-11-16 00:34:52,200 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 191 transitions. Word has length 50 [2019-11-16 00:34:52,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:34:52,201 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 191 transitions. [2019-11-16 00:34:52,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:34:52,201 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 191 transitions. [2019-11-16 00:34:52,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:34:52,204 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:34:52,205 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:34:52,205 INFO L410 AbstractCegarLoop]: === Iteration 13 === [sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:34:52,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:34:52,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1208000458, now seen corresponding path program 1 times [2019-11-16 00:34:52,206 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:34:52,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129900255] [2019-11-16 00:34:52,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:52,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:52,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:34:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:52,833 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-16 00:34:52,833 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129900255] [2019-11-16 00:34:52,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859143597] [2019-11-16 00:34:52,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:52,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-16 00:34:53,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:34:53,156 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 3 [2019-11-16 00:34:53,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:53,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:53,171 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_BEFORE_CALL_2| vanished before elimination [2019-11-16 00:34:53,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:34:53,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2019-11-16 00:35:01,077 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:35:01,078 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 44 [2019-11-16 00:35:01,078 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:35:01,102 INFO L567 ElimStorePlain]: treesize reduction 26, result has 63.4 percent of original size [2019-11-16 00:35:01,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:35:01,113 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-16 00:35:01,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 20 [2019-11-16 00:35:01,114 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:35:01,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:35:01,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:35:01,122 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:30 [2019-11-16 00:35:03,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:35:03,177 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-11-16 00:35:03,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:35:03,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:35:03,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:35:03,183 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:11 [2019-11-16 00:35:03,195 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:35:03,195 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:35:03,196 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 30 [2019-11-16 00:35:03,196 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984894811] [2019-11-16 00:35:03,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-16 00:35:03,196 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:03,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-16 00:35:03,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=842, Unknown=6, NotChecked=0, Total=930 [2019-11-16 00:35:03,197 INFO L87 Difference]: Start difference. First operand 164 states and 191 transitions. Second operand 31 states. [2019-11-16 00:35:12,750 WARN L191 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-11-16 00:35:34,229 WARN L191 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2019-11-16 00:35:38,098 WARN L191 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-11-16 00:35:50,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:50,347 INFO L93 Difference]: Finished difference Result 189 states and 216 transitions. [2019-11-16 00:35:50,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-16 00:35:50,349 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 51 [2019-11-16 00:35:50,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:50,350 INFO L225 Difference]: With dead ends: 189 [2019-11-16 00:35:50,350 INFO L226 Difference]: Without dead ends: 189 [2019-11-16 00:35:50,351 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 28.9s TimeCoverageRelationStatistics Valid=213, Invalid=1934, Unknown=15, NotChecked=0, Total=2162 [2019-11-16 00:35:50,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-16 00:35:50,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 164. [2019-11-16 00:35:50,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-16 00:35:50,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 191 transitions. [2019-11-16 00:35:50,364 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 191 transitions. Word has length 51 [2019-11-16 00:35:50,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:50,364 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 191 transitions. [2019-11-16 00:35:50,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-16 00:35:50,365 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 191 transitions. [2019-11-16 00:35:50,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:35:50,365 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:50,366 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:35:50,576 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:35:50,577 INFO L410 AbstractCegarLoop]: === Iteration 14 === [sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:35:50,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:50,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1208000459, now seen corresponding path program 1 times [2019-11-16 00:35:50,578 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:50,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183112817] [2019-11-16 00:35:50,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:50,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:50,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:35:51,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183112817] [2019-11-16 00:35:51,231 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151193670] [2019-11-16 00:35:51,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:35:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:51,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 80 conjunts are in the unsatisfiable core [2019-11-16 00:35:51,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:35:51,405 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:35:51,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:35:51,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:35:51,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:35:51,410 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-16 00:35:51,614 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 3 [2019-11-16 00:35:51,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:35:51,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:35:51,623 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_BEFORE_CALL_5| vanished before elimination [2019-11-16 00:35:51,625 INFO L375 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 7 treesize of output 3 [2019-11-16 00:35:51,626 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:35:51,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:35:51,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:35:51,634 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:10 [2019-11-16 00:36:03,690 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:03,690 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 44 [2019-11-16 00:36:03,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:03,730 INFO L567 ElimStorePlain]: treesize reduction 26, result has 74.0 percent of original size [2019-11-16 00:36:03,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:36:03,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:36:03,739 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2019-11-16 00:36:03,739 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:03,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:03,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:36:03,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:36:03,760 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2019-11-16 00:36:03,760 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:03,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:03,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:36:03,772 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:75, output treesize:44 [2019-11-16 00:36:03,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:36:03,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-11-16 00:36:03,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:03,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:03,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:36:03,884 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:36:03,885 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:03,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:03,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:36:03,894 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:55, output treesize:14 [2019-11-16 00:36:03,925 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:36:03,926 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:36:03,926 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 31 [2019-11-16 00:36:03,926 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244639050] [2019-11-16 00:36:03,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-16 00:36:03,927 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:03,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-16 00:36:03,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=899, Unknown=4, NotChecked=0, Total=992 [2019-11-16 00:36:03,928 INFO L87 Difference]: Start difference. First operand 164 states and 191 transitions. Second operand 32 states. [2019-11-16 00:36:14,348 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-11-16 00:36:31,135 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-11-16 00:36:35,553 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-11-16 00:36:37,698 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-11-16 00:36:38,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:38,853 INFO L93 Difference]: Finished difference Result 208 states and 236 transitions. [2019-11-16 00:36:38,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-16 00:36:38,853 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 51 [2019-11-16 00:36:38,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:36:38,854 INFO L225 Difference]: With dead ends: 208 [2019-11-16 00:36:38,854 INFO L226 Difference]: Without dead ends: 208 [2019-11-16 00:36:38,855 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 33.7s TimeCoverageRelationStatistics Valid=200, Invalid=1772, Unknown=8, NotChecked=0, Total=1980 [2019-11-16 00:36:38,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-11-16 00:36:38,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 180. [2019-11-16 00:36:38,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-16 00:36:38,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 210 transitions. [2019-11-16 00:36:38,862 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 210 transitions. Word has length 51 [2019-11-16 00:36:38,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:36:38,862 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 210 transitions. [2019-11-16 00:36:38,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-16 00:36:38,862 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 210 transitions. [2019-11-16 00:36:38,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-16 00:36:38,863 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:36:38,863 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:39,066 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:36:39,067 INFO L410 AbstractCegarLoop]: === Iteration 15 === [sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:36:39,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:39,067 INFO L82 PathProgramCache]: Analyzing trace with hash 569277333, now seen corresponding path program 1 times [2019-11-16 00:36:39,067 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:39,067 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587383540] [2019-11-16 00:36:39,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:39,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:39,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:39,639 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:36:39,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587383540] [2019-11-16 00:36:39,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614583739] [2019-11-16 00:36:39,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:36:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:39,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-16 00:36:39,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:40,070 INFO L375 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-11-16 00:36:40,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:40,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:40,077 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:36:40,077 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-11-16 00:36:40,138 INFO L341 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-16 00:36:40,138 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 26 [2019-11-16 00:36:40,139 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:40,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:40,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:36:40,147 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-11-16 00:36:40,239 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:40,240 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 32 [2019-11-16 00:36:40,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:40,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:40,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:36:40,244 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:5 [2019-11-16 00:36:40,248 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-16 00:36:40,248 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:36:40,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [23] total 32 [2019-11-16 00:36:40,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10571449] [2019-11-16 00:36:40,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-16 00:36:40,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:40,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:36:40,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056 [2019-11-16 00:36:40,249 INFO L87 Difference]: Start difference. First operand 180 states and 210 transitions. Second operand 14 states. [2019-11-16 00:36:40,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:40,934 INFO L93 Difference]: Finished difference Result 220 states and 256 transitions. [2019-11-16 00:36:40,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:36:40,935 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-11-16 00:36:40,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:36:40,936 INFO L225 Difference]: With dead ends: 220 [2019-11-16 00:36:40,936 INFO L226 Difference]: Without dead ends: 220 [2019-11-16 00:36:40,937 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=126, Invalid=1434, Unknown=0, NotChecked=0, Total=1560 [2019-11-16 00:36:40,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-11-16 00:36:40,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 188. [2019-11-16 00:36:40,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-16 00:36:40,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 220 transitions. [2019-11-16 00:36:40,943 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 220 transitions. Word has length 55 [2019-11-16 00:36:40,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:36:40,944 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 220 transitions. [2019-11-16 00:36:40,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-16 00:36:40,944 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 220 transitions. [2019-11-16 00:36:40,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-16 00:36:40,945 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:36:40,945 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:41,149 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:36:41,149 INFO L410 AbstractCegarLoop]: === Iteration 16 === [sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:36:41,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:41,150 INFO L82 PathProgramCache]: Analyzing trace with hash 569277334, now seen corresponding path program 1 times [2019-11-16 00:36:41,150 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:41,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25211284] [2019-11-16 00:36:41,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:41,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:41,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:41,711 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:36:41,714 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25211284] [2019-11-16 00:36:41,714 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542064269] [2019-11-16 00:36:41,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:36:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:41,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-16 00:36:41,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:42,044 INFO L375 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-11-16 00:36:42,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:42,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:42,058 INFO L375 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-11-16 00:36:42,058 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:42,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:42,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:36:42,065 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2019-11-16 00:36:42,112 INFO L341 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2019-11-16 00:36:42,113 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 59 [2019-11-16 00:36:42,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:42,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:42,141 INFO L341 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2019-11-16 00:36:42,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 51 [2019-11-16 00:36:42,142 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:42,151 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:42,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:36:42,152 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:68 [2019-11-16 00:36:42,261 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:42,261 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 57 [2019-11-16 00:36:42,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:42,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:42,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:36:42,281 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 20 [2019-11-16 00:36:42,281 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:42,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:42,293 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:36:42,293 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:11 [2019-11-16 00:36:42,372 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-16 00:36:42,372 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:36:42,373 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [21] total 33 [2019-11-16 00:36:42,373 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472321873] [2019-11-16 00:36:42,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-16 00:36:42,374 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:42,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:36:42,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=973, Unknown=0, NotChecked=0, Total=1056 [2019-11-16 00:36:42,375 INFO L87 Difference]: Start difference. First operand 188 states and 220 transitions. Second operand 14 states. [2019-11-16 00:36:43,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:43,026 INFO L93 Difference]: Finished difference Result 219 states and 253 transitions. [2019-11-16 00:36:43,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:36:43,027 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-11-16 00:36:43,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:36:43,028 INFO L225 Difference]: With dead ends: 219 [2019-11-16 00:36:43,028 INFO L226 Difference]: Without dead ends: 219 [2019-11-16 00:36:43,029 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=119, Invalid=1363, Unknown=0, NotChecked=0, Total=1482 [2019-11-16 00:36:43,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-11-16 00:36:43,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 192. [2019-11-16 00:36:43,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-16 00:36:43,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 222 transitions. [2019-11-16 00:36:43,035 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 222 transitions. Word has length 55 [2019-11-16 00:36:43,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:36:43,036 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 222 transitions. [2019-11-16 00:36:43,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-16 00:36:43,036 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 222 transitions. [2019-11-16 00:36:43,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-16 00:36:43,036 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:36:43,037 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:43,237 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:36:43,237 INFO L410 AbstractCegarLoop]: === Iteration 17 === [sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:36:43,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:43,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1809303360, now seen corresponding path program 1 times [2019-11-16 00:36:43,238 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:43,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260971836] [2019-11-16 00:36:43,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:43,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:43,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:44,293 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-16 00:36:44,304 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:36:44,304 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260971836] [2019-11-16 00:36:44,304 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220599924] [2019-11-16 00:36:44,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/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-11-16 00:36:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:44,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 126 conjunts are in the unsatisfiable core [2019-11-16 00:36:44,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:44,884 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:44,884 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-16 00:36:44,885 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:44,917 INFO L567 ElimStorePlain]: treesize reduction 14, result has 70.2 percent of original size [2019-11-16 00:36:44,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:36:44,918 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:33 [2019-11-16 00:36:45,066 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:36:45,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:45,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:45,084 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:36:45,084 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:45,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:45,098 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:36:45,098 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2019-11-16 00:36:45,256 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 47 [2019-11-16 00:36:45,257 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:45,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:45,286 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:36:45,295 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:45,295 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 58 [2019-11-16 00:36:45,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:36:45,298 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:45,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:45,314 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:36:45,314 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:73 [2019-11-16 00:36:45,852 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2019-11-16 00:36:45,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:45,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:45,893 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:45,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 112 [2019-11-16 00:36:45,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:36:45,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:36:45,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:36:45,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:36:45,898 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:36:45,934 INFO L567 ElimStorePlain]: treesize reduction 40, result has 60.0 percent of original size [2019-11-16 00:36:45,938 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:36:45,938 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:36:45,948 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:45,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-11-16 00:36:45,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:36:45,950 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:45,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:45,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:36:45,984 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:173, output treesize:10 [2019-11-16 00:36:50,398 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:50,398 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 149 [2019-11-16 00:36:50,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:50,499 INFO L567 ElimStorePlain]: treesize reduction 76, result has 76.1 percent of original size [2019-11-16 00:36:50,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:36:50,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:36:50,581 INFO L341 Elim1Store]: treesize reduction 33, result has 72.0 percent of original size [2019-11-16 00:36:50,582 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 190 treesize of output 202 [2019-11-16 00:36:50,583 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:50,677 INFO L567 ElimStorePlain]: treesize reduction 225, result has 50.2 percent of original size [2019-11-16 00:36:50,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:36:50,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:36:50,686 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:36:50,807 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-11-16 00:36:50,807 INFO L341 Elim1Store]: treesize reduction 78, result has 63.7 percent of original size [2019-11-16 00:36:50,807 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 193 treesize of output 234 [2019-11-16 00:36:50,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:36:50,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:36:50,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:36:50,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:36:50,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:36:50,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:36:50,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:36:50,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:36:50,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:36:50,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:36:50,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:36:50,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:36:50,818 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:36:50,913 INFO L567 ElimStorePlain]: treesize reduction 198, result has 45.8 percent of original size [2019-11-16 00:36:50,914 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:36:50,914 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:224, output treesize:212 [2019-11-16 00:36:51,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:36:51,516 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:51,516 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 196 treesize of output 193 [2019-11-16 00:36:51,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:51,602 INFO L567 ElimStorePlain]: treesize reduction 92, result has 58.7 percent of original size [2019-11-16 00:36:51,603 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-16 00:36:51,603 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:251, output treesize:131 [2019-11-16 00:36:51,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:36:51,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:36:51,864 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:36:51,868 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:36:51,906 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:51,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 96 treesize of output 86 [2019-11-16 00:36:51,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:36:51,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:36:51,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:36:51,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:36:51,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:36:51,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:36:51,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:36:51,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:36:51,912 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:36:51,995 INFO L567 ElimStorePlain]: treesize reduction 28, result has 63.6 percent of original size [2019-11-16 00:36:51,996 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:36:51,996 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:118, output treesize:28 [2019-11-16 00:36:52,225 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:36:52,225 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:36:52,225 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33] total 61 [2019-11-16 00:36:52,225 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047461320] [2019-11-16 00:36:52,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-11-16 00:36:52,226 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:52,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-11-16 00:36:52,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=3561, Unknown=2, NotChecked=0, Total=3782 [2019-11-16 00:36:52,228 INFO L87 Difference]: Start difference. First operand 192 states and 222 transitions. Second operand 62 states. [2019-11-16 00:36:52,518 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-16 00:37:02,962 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 51 DAG size of output: 37 [2019-11-16 00:37:05,113 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-11-16 00:37:05,908 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-11-16 00:37:06,192 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-11-16 00:37:06,948 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-11-16 00:37:09,445 WARN L191 SmtUtils]: Spent 2.15 s on a formula simplification that was a NOOP. DAG size: 112 [2019-11-16 00:37:09,739 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2019-11-16 00:37:09,989 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-11-16 00:37:16,474 WARN L191 SmtUtils]: Spent 6.35 s on a formula simplification. DAG size of input: 141 DAG size of output: 130 [2019-11-16 00:37:16,933 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 115 [2019-11-16 00:37:17,437 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 109 [2019-11-16 00:37:19,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:19,211 INFO L93 Difference]: Finished difference Result 217 states and 244 transitions. [2019-11-16 00:37:19,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-16 00:37:19,212 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 56 [2019-11-16 00:37:19,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:19,213 INFO L225 Difference]: With dead ends: 217 [2019-11-16 00:37:19,213 INFO L226 Difference]: Without dead ends: 217 [2019-11-16 00:37:19,216 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1720 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=484, Invalid=6484, Unknown=4, NotChecked=0, Total=6972 [2019-11-16 00:37:19,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-11-16 00:37:19,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 189. [2019-11-16 00:37:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-11-16 00:37:19,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 219 transitions. [2019-11-16 00:37:19,222 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 219 transitions. Word has length 56 [2019-11-16 00:37:19,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:19,222 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 219 transitions. [2019-11-16 00:37:19,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-11-16 00:37:19,223 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 219 transitions. [2019-11-16 00:37:19,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-16 00:37:19,223 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:19,224 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:19,427 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:37:19,427 INFO L410 AbstractCegarLoop]: === Iteration 18 === [sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:37:19,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:19,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1809303361, now seen corresponding path program 1 times [2019-11-16 00:37:19,428 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:19,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75882557] [2019-11-16 00:37:19,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:19,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:19,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:19,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:21,427 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-16 00:37:21,443 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:37:21,444 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75882557] [2019-11-16 00:37:21,444 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189886561] [2019-11-16 00:37:21,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:37:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:21,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 137 conjunts are in the unsatisfiable core [2019-11-16 00:37:21,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:37:21,666 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:37:21,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:21,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:21,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:37:21,669 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-16 00:37:22,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:37:22,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-16 00:37:22,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:22,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:22,228 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:22,228 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:37:22,229 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:22,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:22,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:37:22,249 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:32 [2019-11-16 00:37:22,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:37:22,381 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:22,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:22,397 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:37:22,397 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:22,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:22,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:37:22,410 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-11-16 00:37:22,563 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:22,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 62 [2019-11-16 00:37:22,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:22,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:22,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:22,583 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2019-11-16 00:37:22,583 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:22,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:22,598 INFO L496 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-11-16 00:37:22,599 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:63 [2019-11-16 00:37:23,256 INFO L392 ElimStorePlain]: Different costs {0=[|v_#valid_BEFORE_CALL_23|], 1=[|v_#length_BEFORE_CALL_18|]} [2019-11-16 00:37:23,260 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 3 [2019-11-16 00:37:23,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:23,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:23,290 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2019-11-16 00:37:23,291 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:23,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:23,316 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:37:23,331 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:23,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 72 [2019-11-16 00:37:23,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:23,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:23,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:23,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:23,334 INFO L496 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:37:23,389 INFO L567 ElimStorePlain]: treesize reduction 20, result has 75.0 percent of original size [2019-11-16 00:37:23,401 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:23,401 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2019-11-16 00:37:23,401 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:23,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:23,412 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:37:23,412 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:146, output treesize:13 [2019-11-16 00:37:29,819 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_BEFORE_CALL_24|], 3=[|v_old(#length)_AFTER_CALL_38|]} [2019-11-16 00:37:29,829 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:29,829 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-16 00:37:29,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:29,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:29,892 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:29,892 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 88 [2019-11-16 00:37:29,893 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:29,975 INFO L567 ElimStorePlain]: treesize reduction 50, result has 78.9 percent of original size [2019-11-16 00:37:29,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:37:29,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:37:29,985 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:37:30,107 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-11-16 00:37:30,107 INFO L341 Elim1Store]: treesize reduction 78, result has 63.7 percent of original size [2019-11-16 00:37:30,108 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 138 treesize of output 200 [2019-11-16 00:37:30,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:30,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:30,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:30,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:30,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:30,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:30,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:30,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:30,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:30,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:30,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:30,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:30,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:30,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:30,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:30,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:30,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:30,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:30,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:30,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:30,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:30,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:30,122 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:37:30,320 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-11-16 00:37:30,321 INFO L567 ElimStorePlain]: treesize reduction 121, result has 56.3 percent of original size [2019-11-16 00:37:30,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:37:30,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:37:30,395 INFO L341 Elim1Store]: treesize reduction 33, result has 67.6 percent of original size [2019-11-16 00:37:30,396 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 120 [2019-11-16 00:37:30,397 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:30,561 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-11-16 00:37:30,562 INFO L567 ElimStorePlain]: treesize reduction 47, result has 76.3 percent of original size [2019-11-16 00:37:30,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:30,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:30,565 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-16 00:37:30,565 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:194, output treesize:220 [2019-11-16 00:37:30,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:30,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:30,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:30,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:31,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:31,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:31,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:31,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:31,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:31,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:31,728 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-11-16 00:37:32,216 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-16 00:37:32,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:32,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:32,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:32,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:33,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:33,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:37:33,113 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:37:33,166 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:33,166 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 204 treesize of output 162 [2019-11-16 00:37:33,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:33,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:33,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:33,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:33,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:33,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:33,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:33,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:33,176 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:37:33,208 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:33,208 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 116 [2019-11-16 00:37:33,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:33,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:33,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:33,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:33,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:33,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:33,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:33,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:33,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:33,214 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:37:33,397 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 69 [2019-11-16 00:37:33,397 INFO L567 ElimStorePlain]: treesize reduction 76, result has 68.3 percent of original size [2019-11-16 00:37:33,598 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:37:33,599 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-11-16 00:37:33,602 INFO L168 Benchmark]: Toolchain (without parser) took 177200.18 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 306.7 MB). Free memory was 940.7 MB in the beginning and 982.7 MB in the end (delta: -42.0 MB). Peak memory consumption was 264.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:37:33,603 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:37:33,603 INFO L168 Benchmark]: CACSL2BoogieTranslator took 540.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:37:33,603 INFO L168 Benchmark]: Boogie Preprocessor took 63.16 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-11-16 00:37:33,603 INFO L168 Benchmark]: RCFGBuilder took 837.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 76.3 MB). Peak memory consumption was 76.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:37:33,604 INFO L168 Benchmark]: TraceAbstraction took 175755.86 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 174.6 MB). Free memory was 1.0 GB in the beginning and 982.7 MB in the end (delta: 42.1 MB). Peak memory consumption was 216.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:37:33,605 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 540.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 837.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 76.3 MB). Peak memory consumption was 76.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 175755.86 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 174.6 MB). Free memory was 1.0 GB in the beginning and 982.7 MB in the end (delta: 42.1 MB). Peak memory consumption was 216.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-16 00:37:35,715 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:37:35,717 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:37:35,732 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:37:35,732 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:37:35,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:37:35,735 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:37:35,744 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:37:35,748 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:37:35,752 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:37:35,753 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:37:35,755 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:37:35,756 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:37:35,758 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:37:35,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:37:35,760 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:37:35,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:37:35,762 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:37:35,765 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:37:35,768 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:37:35,771 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:37:35,773 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:37:35,775 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:37:35,778 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:37:35,781 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:37:35,781 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:37:35,781 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:37:35,783 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:37:35,783 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:37:35,785 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:37:35,786 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:37:35,786 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:37:35,787 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:37:35,787 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:37:35,789 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:37:35,789 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:37:35,790 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:37:35,790 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:37:35,790 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:37:35,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:37:35,793 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:37:35,794 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-16 00:37:35,819 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:37:35,829 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:37:35,830 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:37:35,830 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:37:35,831 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:37:35,831 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:37:35,831 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:37:35,831 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:37:35,832 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:37:35,832 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:37:35,832 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:37:35,832 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-16 00:37:35,832 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-16 00:37:35,833 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-16 00:37:35,833 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:37:35,833 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-16 00:37:35,833 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-16 00:37:35,834 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:37:35,834 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:37:35,834 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:37:35,835 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:37:35,835 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:37:35,835 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:37:35,835 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:37:35,836 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:37:35,836 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:37:35,836 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-16 00:37:35,836 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-16 00:37:35,836 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:37:35,837 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_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2c7de5fb661efaece6ac30dedf2d78ac089ace75 [2019-11-16 00:37:35,864 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:37:35,873 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:37:35,876 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:37:35,878 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:37:35,878 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:37:35,879 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2019-11-16 00:37:35,929 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/data/0cf6e858e/28bec86d2e7947cba667887d562acc4c/FLAG27987a948 [2019-11-16 00:37:36,443 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:37:36,443 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2019-11-16 00:37:36,455 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/data/0cf6e858e/28bec86d2e7947cba667887d562acc4c/FLAG27987a948 [2019-11-16 00:37:36,946 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/data/0cf6e858e/28bec86d2e7947cba667887d562acc4c [2019-11-16 00:37:36,951 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:37:36,952 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-16 00:37:36,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:37:36,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:37:36,962 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:37:36,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:37:36" (1/1) ... [2019-11-16 00:37:36,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3030703f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:36, skipping insertion in model container [2019-11-16 00:37:36,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:37:36" (1/1) ... [2019-11-16 00:37:36,972 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:37:37,023 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:37:37,397 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:37:37,408 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:37:37,456 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:37:37,526 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:37:37,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:37 WrapperNode [2019-11-16 00:37:37,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:37:37,527 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:37:37,527 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:37:37,527 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:37:37,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:37" (1/1) ... [2019-11-16 00:37:37,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:37" (1/1) ... [2019-11-16 00:37:37,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:37" (1/1) ... [2019-11-16 00:37:37,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:37" (1/1) ... [2019-11-16 00:37:37,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:37" (1/1) ... [2019-11-16 00:37:37,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:37" (1/1) ... [2019-11-16 00:37:37,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:37" (1/1) ... [2019-11-16 00:37:37,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:37:37,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:37:37,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:37:37,601 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:37:37,601 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:37:37,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-16 00:37:37,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:37:37,653 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-16 00:37:37,653 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-16 00:37:37,654 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-16 00:37:37,654 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-16 00:37:37,654 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2019-11-16 00:37:37,654 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2019-11-16 00:37:37,654 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_prepend [2019-11-16 00:37:37,654 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-16 00:37:37,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-16 00:37:37,655 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-16 00:37:37,655 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-16 00:37:37,655 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-16 00:37:37,655 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-16 00:37:37,655 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-16 00:37:37,656 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-16 00:37:37,656 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-16 00:37:37,656 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-16 00:37:37,656 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-16 00:37:37,656 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-16 00:37:37,656 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-16 00:37:37,656 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-16 00:37:37,657 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-16 00:37:37,657 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-16 00:37:37,657 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-16 00:37:37,657 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-16 00:37:37,657 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-16 00:37:37,657 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-16 00:37:37,658 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-16 00:37:37,658 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-16 00:37:37,658 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-16 00:37:37,658 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-16 00:37:37,658 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-16 00:37:37,658 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-16 00:37:37,659 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-16 00:37:37,659 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-16 00:37:37,659 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-16 00:37:37,659 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-16 00:37:37,659 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-16 00:37:37,659 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-16 00:37:37,659 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-16 00:37:37,659 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-16 00:37:37,659 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-16 00:37:37,659 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-16 00:37:37,660 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-16 00:37:37,660 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-16 00:37:37,660 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-16 00:37:37,660 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-16 00:37:37,660 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-16 00:37:37,660 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-16 00:37:37,661 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-16 00:37:37,661 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-16 00:37:37,661 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-16 00:37:37,661 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-16 00:37:37,661 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-16 00:37:37,661 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-16 00:37:37,661 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-16 00:37:37,661 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-16 00:37:37,661 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-16 00:37:37,662 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-16 00:37:37,662 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-16 00:37:37,662 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-16 00:37:37,662 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-16 00:37:37,662 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-16 00:37:37,662 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-16 00:37:37,662 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-16 00:37:37,662 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-16 00:37:37,663 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-16 00:37:37,663 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-16 00:37:37,663 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-16 00:37:37,663 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-16 00:37:37,663 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-16 00:37:37,664 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-16 00:37:37,664 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-16 00:37:37,664 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-16 00:37:37,664 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-16 00:37:37,664 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-16 00:37:37,665 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-16 00:37:37,665 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-16 00:37:37,665 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-16 00:37:37,665 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-16 00:37:37,665 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-16 00:37:37,665 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-16 00:37:37,665 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-16 00:37:37,666 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-16 00:37:37,666 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-16 00:37:37,666 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-16 00:37:37,666 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-16 00:37:37,666 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-16 00:37:37,666 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-16 00:37:37,666 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-16 00:37:37,666 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-16 00:37:37,666 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-16 00:37:37,666 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-16 00:37:37,667 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-16 00:37:37,667 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-16 00:37:37,667 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-16 00:37:37,667 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-16 00:37:37,667 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-16 00:37:37,667 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-16 00:37:37,667 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-16 00:37:37,667 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-16 00:37:37,667 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-16 00:37:37,668 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-16 00:37:37,668 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-16 00:37:37,668 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-16 00:37:37,668 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-16 00:37:37,668 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-16 00:37:37,668 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-16 00:37:37,668 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-16 00:37:37,668 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-16 00:37:37,668 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-16 00:37:37,669 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-16 00:37:37,669 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-16 00:37:37,669 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-16 00:37:37,669 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-16 00:37:37,669 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-16 00:37:37,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:37:37,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:37:37,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-16 00:37:37,670 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2019-11-16 00:37:37,670 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2019-11-16 00:37:37,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:37:37,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:37:37,671 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_prepend [2019-11-16 00:37:37,671 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-16 00:37:37,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:37:37,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-16 00:37:37,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-16 00:37:37,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-16 00:37:37,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:37:38,015 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-16 00:37:38,645 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:37:38,645 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-16 00:37:38,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:37:38 BoogieIcfgContainer [2019-11-16 00:37:38,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:37:38,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:37:38,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:37:38,651 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:37:38,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:37:36" (1/3) ... [2019-11-16 00:37:38,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51a9b338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:37:38, skipping insertion in model container [2019-11-16 00:37:38,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:37" (2/3) ... [2019-11-16 00:37:38,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51a9b338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:37:38, skipping insertion in model container [2019-11-16 00:37:38,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:37:38" (3/3) ... [2019-11-16 00:37:38,655 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.i [2019-11-16 00:37:38,664 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:37:38,671 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2019-11-16 00:37:38,690 INFO L249 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2019-11-16 00:37:38,705 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:37:38,705 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-16 00:37:38,705 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:37:38,705 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:37:38,705 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:37:38,705 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:37:38,706 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:37:38,706 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:37:38,723 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-11-16 00:37:38,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:37:38,733 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:38,734 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:38,736 INFO L410 AbstractCegarLoop]: === Iteration 1 === [sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:37:38,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:38,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1474046873, now seen corresponding path program 1 times [2019-11-16 00:37:38,752 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:37:38,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [580051018] [2019-11-16 00:37:38,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b00e1c2a-d0f4-4d0e-8acf-654b8a81a86d/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:37:38,983 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:37:38,984 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort C_DOUBLE not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableFunctionSymbol.defineOrDeclare(DeclarableFunctionSymbol.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferSymbols(SmtFunctionsAndAxioms.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleTraceCheck.createExternalManagedScript(IpTcStrategyModuleTraceCheck.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-16 00:37:38,989 INFO L168 Benchmark]: Toolchain (without parser) took 2036.48 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 945.6 MB in the beginning and 1.0 GB in the end (delta: -64.1 MB). Peak memory consumption was 54.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:37:38,990 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:37:38,990 INFO L168 Benchmark]: CACSL2BoogieTranslator took 568.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -147.3 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:37:38,991 INFO L168 Benchmark]: Boogie Preprocessor took 72.82 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-11-16 00:37:38,992 INFO L168 Benchmark]: RCFGBuilder took 1046.51 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: 71.0 MB). Peak memory consumption was 71.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:37:38,992 INFO L168 Benchmark]: TraceAbstraction took 339.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:37:38,995 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 568.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -147.3 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 72.82 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 1046.51 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: 71.0 MB). Peak memory consumption was 71.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 339.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Sort C_DOUBLE not declared: de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...