./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/lockfree-3.3.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_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/lockfree-3.3.i -s /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/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 9f2a2a3db64819077b17ec0cac240c138be80e0f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/lockfree-3.3.i -s /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/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 9f2a2a3db64819077b17ec0cac240c138be80e0f .................................................................................................................................................................................................................................................................................................................................................................. 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-15 22:01:41,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:01:41,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:01:41,972 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:01:41,972 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:01:41,973 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:01:41,975 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:01:41,977 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:01:41,979 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:01:41,979 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:01:41,980 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:01:41,982 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:01:41,982 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:01:41,983 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:01:41,984 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:01:41,985 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:01:41,986 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:01:41,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:01:41,988 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:01:41,990 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:01:41,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:01:41,993 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:01:41,994 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:01:41,994 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:01:41,997 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:01:41,997 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:01:41,997 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:01:41,998 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:01:41,999 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:01:42,000 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:01:42,000 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:01:42,001 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:01:42,001 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:01:42,002 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:01:42,003 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:01:42,003 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:01:42,004 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:01:42,004 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:01:42,004 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:01:42,005 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:01:42,006 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:01:42,007 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 22:01:42,019 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:01:42,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:01:42,021 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:01:42,021 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:01:42,021 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:01:42,022 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:01:42,022 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:01:42,022 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:01:42,022 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:01:42,023 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:01:42,023 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:01:42,023 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 22:01:42,023 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 22:01:42,026 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 22:01:42,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:01:42,026 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:01:42,027 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:01:42,027 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:01:42,027 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:01:42,027 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:01:42,028 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:01:42,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:01:42,028 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:01:42,028 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:01:42,029 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:01:42,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:01:42,029 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_43a5540f-5626-4235-82d7-180b39dab7fe/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 -> 9f2a2a3db64819077b17ec0cac240c138be80e0f [2019-11-15 22:01:42,089 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:01:42,099 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:01:42,111 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:01:42,112 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:01:42,113 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:01:42,113 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/../../sv-benchmarks/c/memsafety/lockfree-3.3.i [2019-11-15 22:01:42,172 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/data/802dbb52f/861667471a2245d8b378242d700d0495/FLAG6ad5d6878 [2019-11-15 22:01:42,687 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:01:42,690 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/sv-benchmarks/c/memsafety/lockfree-3.3.i [2019-11-15 22:01:42,709 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/data/802dbb52f/861667471a2245d8b378242d700d0495/FLAG6ad5d6878 [2019-11-15 22:01:43,182 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/data/802dbb52f/861667471a2245d8b378242d700d0495 [2019-11-15 22:01:43,185 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:01:43,187 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 22:01:43,188 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:01:43,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:01:43,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:01:43,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:01:43" (1/1) ... [2019-11-15 22:01:43,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28445939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:01:43, skipping insertion in model container [2019-11-15 22:01:43,195 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:01:43" (1/1) ... [2019-11-15 22:01:43,202 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:01:43,253 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:01:43,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:01:43,668 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:01:43,734 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:01:43,798 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:01:43,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:01:43 WrapperNode [2019-11-15 22:01:43,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:01:43,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:01:43,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:01:43,801 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:01:43,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:01:43" (1/1) ... [2019-11-15 22:01:43,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:01:43" (1/1) ... [2019-11-15 22:01:43,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:01:43" (1/1) ... [2019-11-15 22:01:43,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:01:43" (1/1) ... [2019-11-15 22:01:43,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:01:43" (1/1) ... [2019-11-15 22:01:43,846 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:01:43" (1/1) ... [2019-11-15 22:01:43,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:01:43" (1/1) ... [2019-11-15 22:01:43,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:01:43,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:01:43,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:01:43,858 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:01:43,858 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:01:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/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-15 22:01:43,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 22:01:43,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:01:43,924 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 22:01:43,924 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 22:01:43,924 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-15 22:01:43,924 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-15 22:01:43,925 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-15 22:01:43,925 INFO L138 BoogieDeclarations]: Found implementation of procedure push [2019-11-15 22:01:43,925 INFO L138 BoogieDeclarations]: Found implementation of procedure pop [2019-11-15 22:01:43,925 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 22:01:43,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 22:01:43,926 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 22:01:43,926 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 22:01:43,926 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 22:01:43,926 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 22:01:43,927 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 22:01:43,927 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 22:01:43,927 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 22:01:43,927 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 22:01:43,927 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 22:01:43,927 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 22:01:43,928 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 22:01:43,928 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 22:01:43,928 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 22:01:43,928 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 22:01:43,928 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 22:01:43,929 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 22:01:43,929 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 22:01:43,929 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 22:01:43,929 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-15 22:01:43,929 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-15 22:01:43,929 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-15 22:01:43,930 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 22:01:43,930 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 22:01:43,930 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 22:01:43,930 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 22:01:43,930 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 22:01:43,931 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 22:01:43,931 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 22:01:43,931 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 22:01:43,931 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 22:01:43,931 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 22:01:43,931 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 22:01:43,932 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 22:01:43,932 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 22:01:43,932 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 22:01:43,932 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 22:01:43,932 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 22:01:43,932 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 22:01:43,933 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 22:01:43,933 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 22:01:43,933 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 22:01:43,933 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 22:01:43,933 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 22:01:43,933 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 22:01:43,934 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 22:01:43,934 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 22:01:43,934 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 22:01:43,934 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 22:01:43,934 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 22:01:43,935 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 22:01:43,935 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 22:01:43,935 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 22:01:43,935 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 22:01:43,935 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 22:01:43,935 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 22:01:43,936 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 22:01:43,936 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 22:01:43,936 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 22:01:43,936 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 22:01:43,936 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 22:01:43,936 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 22:01:43,937 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 22:01:43,937 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 22:01:43,937 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 22:01:43,937 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 22:01:43,937 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 22:01:43,938 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 22:01:43,938 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 22:01:43,938 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 22:01:43,938 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 22:01:43,938 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 22:01:43,938 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 22:01:43,939 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 22:01:43,939 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 22:01:43,939 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 22:01:43,939 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 22:01:43,939 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 22:01:43,939 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 22:01:43,940 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 22:01:43,940 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 22:01:43,940 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 22:01:43,940 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 22:01:43,940 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 22:01:43,940 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 22:01:43,941 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 22:01:43,941 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 22:01:43,941 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 22:01:43,941 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 22:01:43,941 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 22:01:43,941 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 22:01:43,942 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 22:01:43,942 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 22:01:43,942 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 22:01:43,942 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 22:01:43,942 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 22:01:43,942 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 22:01:43,943 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 22:01:43,943 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 22:01:43,943 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 22:01:43,943 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 22:01:43,943 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 22:01:43,943 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 22:01:43,944 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 22:01:43,944 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 22:01:43,944 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 22:01:43,944 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 22:01:43,944 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 22:01:43,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 22:01:43,945 INFO L130 BoogieDeclarations]: Found specification of procedure push [2019-11-15 22:01:43,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:01:43,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:01:43,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:01:43,945 INFO L130 BoogieDeclarations]: Found specification of procedure pop [2019-11-15 22:01:43,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:01:43,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:01:43,946 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 22:01:43,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:01:43,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 22:01:43,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:01:44,452 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:01:44,452 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-15 22:01:44,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:01:44 BoogieIcfgContainer [2019-11-15 22:01:44,453 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:01:44,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:01:44,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:01:44,457 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:01:44,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:01:43" (1/3) ... [2019-11-15 22:01:44,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73159361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:01:44, skipping insertion in model container [2019-11-15 22:01:44,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:01:43" (2/3) ... [2019-11-15 22:01:44,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73159361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:01:44, skipping insertion in model container [2019-11-15 22:01:44,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:01:44" (3/3) ... [2019-11-15 22:01:44,459 INFO L109 eAbstractionObserver]: Analyzing ICFG lockfree-3.3.i [2019-11-15 22:01:44,468 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:01:44,475 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-15 22:01:44,485 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-15 22:01:44,508 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:01:44,509 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 22:01:44,509 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:01:44,509 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:01:44,509 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:01:44,510 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:01:44,510 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:01:44,510 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:01:44,524 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2019-11-15 22:01:44,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-15 22:01:44,531 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:01:44,532 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:01:44,533 INFO L410 AbstractCegarLoop]: === Iteration 1 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:01:44,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:01:44,537 INFO L82 PathProgramCache]: Analyzing trace with hash 406886108, now seen corresponding path program 1 times [2019-11-15 22:01:44,542 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:01:44,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110452664] [2019-11-15 22:01:44,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:44,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:44,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:01:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:44,790 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-15 22:01:44,793 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110452664] [2019-11-15 22:01:44,794 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:01:44,795 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:01:44,795 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011971378] [2019-11-15 22:01:44,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:01:44,799 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:01:44,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:01:44,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:01:44,814 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2019-11-15 22:01:45,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:01:45,076 INFO L93 Difference]: Finished difference Result 92 states and 115 transitions. [2019-11-15 22:01:45,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:01:45,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-15 22:01:45,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:01:45,088 INFO L225 Difference]: With dead ends: 92 [2019-11-15 22:01:45,089 INFO L226 Difference]: Without dead ends: 89 [2019-11-15 22:01:45,098 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:01:45,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-15 22:01:45,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2019-11-15 22:01:45,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-15 22:01:45,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2019-11-15 22:01:45,150 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 8 [2019-11-15 22:01:45,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:01:45,151 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2019-11-15 22:01:45,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:01:45,151 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2019-11-15 22:01:45,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 22:01:45,152 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:01:45,152 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:01:45,152 INFO L410 AbstractCegarLoop]: === Iteration 2 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:01:45,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:01:45,153 INFO L82 PathProgramCache]: Analyzing trace with hash 155309773, now seen corresponding path program 1 times [2019-11-15 22:01:45,153 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:01:45,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111573131] [2019-11-15 22:01:45,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:45,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:45,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:01:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:45,316 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-15 22:01:45,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111573131] [2019-11-15 22:01:45,317 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:01:45,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:01:45,317 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001966659] [2019-11-15 22:01:45,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:01:45,319 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:01:45,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:01:45,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:01:45,320 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand 4 states. [2019-11-15 22:01:45,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:01:45,640 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2019-11-15 22:01:45,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:01:45,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-15 22:01:45,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:01:45,644 INFO L225 Difference]: With dead ends: 91 [2019-11-15 22:01:45,644 INFO L226 Difference]: Without dead ends: 91 [2019-11-15 22:01:45,645 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:01:45,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-15 22:01:45,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 72. [2019-11-15 22:01:45,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-15 22:01:45,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2019-11-15 22:01:45,653 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 10 [2019-11-15 22:01:45,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:01:45,655 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2019-11-15 22:01:45,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:01:45,655 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2019-11-15 22:01:45,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 22:01:45,657 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:01:45,657 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:01:45,657 INFO L410 AbstractCegarLoop]: === Iteration 3 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:01:45,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:01:45,658 INFO L82 PathProgramCache]: Analyzing trace with hash 155369355, now seen corresponding path program 1 times [2019-11-15 22:01:45,658 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:01:45,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764359979] [2019-11-15 22:01:45,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:45,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:45,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:01:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:45,844 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-15 22:01:45,844 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764359979] [2019-11-15 22:01:45,845 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:01:45,845 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:01:45,845 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160973033] [2019-11-15 22:01:45,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:01:45,846 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:01:45,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:01:45,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:01:45,846 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. Second operand 4 states. [2019-11-15 22:01:46,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:01:46,166 INFO L93 Difference]: Finished difference Result 135 states and 176 transitions. [2019-11-15 22:01:46,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:01:46,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-15 22:01:46,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:01:46,169 INFO L225 Difference]: With dead ends: 135 [2019-11-15 22:01:46,169 INFO L226 Difference]: Without dead ends: 135 [2019-11-15 22:01:46,169 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:01:46,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-15 22:01:46,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 108. [2019-11-15 22:01:46,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-15 22:01:46,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2019-11-15 22:01:46,182 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 10 [2019-11-15 22:01:46,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:01:46,183 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2019-11-15 22:01:46,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:01:46,183 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2019-11-15 22:01:46,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 22:01:46,184 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:01:46,184 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:01:46,184 INFO L410 AbstractCegarLoop]: === Iteration 4 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:01:46,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:01:46,185 INFO L82 PathProgramCache]: Analyzing trace with hash 521481310, now seen corresponding path program 1 times [2019-11-15 22:01:46,185 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:01:46,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190900962] [2019-11-15 22:01:46,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:46,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:46,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:01:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:46,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:46,304 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-15 22:01:46,304 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190900962] [2019-11-15 22:01:46,304 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:01:46,304 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:01:46,304 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737504083] [2019-11-15 22:01:46,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:01:46,305 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:01:46,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:01:46,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:01:46,306 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand 4 states. [2019-11-15 22:01:46,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:01:46,528 INFO L93 Difference]: Finished difference Result 149 states and 214 transitions. [2019-11-15 22:01:46,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:01:46,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-15 22:01:46,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:01:46,531 INFO L225 Difference]: With dead ends: 149 [2019-11-15 22:01:46,532 INFO L226 Difference]: Without dead ends: 144 [2019-11-15 22:01:46,532 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:01:46,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-15 22:01:46,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 126. [2019-11-15 22:01:46,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-15 22:01:46,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 183 transitions. [2019-11-15 22:01:46,547 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 183 transitions. Word has length 11 [2019-11-15 22:01:46,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:01:46,548 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 183 transitions. [2019-11-15 22:01:46,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:01:46,548 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 183 transitions. [2019-11-15 22:01:46,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 22:01:46,549 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:01:46,549 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:01:46,549 INFO L410 AbstractCegarLoop]: === Iteration 5 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:01:46,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:01:46,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1196811089, now seen corresponding path program 1 times [2019-11-15 22:01:46,550 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:01:46,550 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842947754] [2019-11-15 22:01:46,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:46,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:46,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:01:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:46,673 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-15 22:01:46,673 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842947754] [2019-11-15 22:01:46,674 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:01:46,674 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:01:46,674 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795790150] [2019-11-15 22:01:46,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:01:46,675 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:01:46,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:01:46,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:01:46,675 INFO L87 Difference]: Start difference. First operand 126 states and 183 transitions. Second operand 4 states. [2019-11-15 22:01:47,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:01:47,053 INFO L93 Difference]: Finished difference Result 220 states and 325 transitions. [2019-11-15 22:01:47,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:01:47,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-15 22:01:47,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:01:47,061 INFO L225 Difference]: With dead ends: 220 [2019-11-15 22:01:47,061 INFO L226 Difference]: Without dead ends: 220 [2019-11-15 22:01:47,061 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:01:47,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-11-15 22:01:47,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 193. [2019-11-15 22:01:47,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-15 22:01:47,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 298 transitions. [2019-11-15 22:01:47,089 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 298 transitions. Word has length 13 [2019-11-15 22:01:47,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:01:47,089 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 298 transitions. [2019-11-15 22:01:47,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:01:47,089 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 298 transitions. [2019-11-15 22:01:47,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 22:01:47,090 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:01:47,090 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:01:47,090 INFO L410 AbstractCegarLoop]: === Iteration 6 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:01:47,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:01:47,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1196811090, now seen corresponding path program 1 times [2019-11-15 22:01:47,090 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:01:47,090 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847340067] [2019-11-15 22:01:47,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:47,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:47,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:01:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:47,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-15 22:01:47,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847340067] [2019-11-15 22:01:47,169 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:01:47,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:01:47,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450586790] [2019-11-15 22:01:47,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:01:47,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:01:47,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:01:47,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:01:47,171 INFO L87 Difference]: Start difference. First operand 193 states and 298 transitions. Second operand 4 states. [2019-11-15 22:01:47,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:01:47,527 INFO L93 Difference]: Finished difference Result 271 states and 408 transitions. [2019-11-15 22:01:47,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:01:47,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-15 22:01:47,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:01:47,530 INFO L225 Difference]: With dead ends: 271 [2019-11-15 22:01:47,530 INFO L226 Difference]: Without dead ends: 271 [2019-11-15 22:01:47,531 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:01:47,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-15 22:01:47,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 247. [2019-11-15 22:01:47,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-11-15 22:01:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 382 transitions. [2019-11-15 22:01:47,568 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 382 transitions. Word has length 13 [2019-11-15 22:01:47,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:01:47,569 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 382 transitions. [2019-11-15 22:01:47,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:01:47,569 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 382 transitions. [2019-11-15 22:01:47,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 22:01:47,572 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:01:47,573 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:01:47,573 INFO L410 AbstractCegarLoop]: === Iteration 7 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:01:47,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:01:47,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1553554911, now seen corresponding path program 1 times [2019-11-15 22:01:47,574 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:01:47,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814576848] [2019-11-15 22:01:47,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:47,581 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:47,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:01:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:47,681 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-15 22:01:47,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814576848] [2019-11-15 22:01:47,682 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:01:47,683 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:01:47,683 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005985995] [2019-11-15 22:01:47,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:01:47,684 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:01:47,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:01:47,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:01:47,684 INFO L87 Difference]: Start difference. First operand 247 states and 382 transitions. Second operand 6 states. [2019-11-15 22:01:48,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:01:48,033 INFO L93 Difference]: Finished difference Result 473 states and 709 transitions. [2019-11-15 22:01:48,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:01:48,034 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-15 22:01:48,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:01:48,043 INFO L225 Difference]: With dead ends: 473 [2019-11-15 22:01:48,043 INFO L226 Difference]: Without dead ends: 473 [2019-11-15 22:01:48,043 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:01:48,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-11-15 22:01:48,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 439. [2019-11-15 22:01:48,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-11-15 22:01:48,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 675 transitions. [2019-11-15 22:01:48,085 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 675 transitions. Word has length 14 [2019-11-15 22:01:48,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:01:48,086 INFO L462 AbstractCegarLoop]: Abstraction has 439 states and 675 transitions. [2019-11-15 22:01:48,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:01:48,086 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 675 transitions. [2019-11-15 22:01:48,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 22:01:48,087 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:01:48,087 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:01:48,088 INFO L410 AbstractCegarLoop]: === Iteration 8 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:01:48,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:01:48,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1849836300, now seen corresponding path program 1 times [2019-11-15 22:01:48,088 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:01:48,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552634977] [2019-11-15 22:01:48,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:48,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:48,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:01:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:48,197 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-15 22:01:48,197 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552634977] [2019-11-15 22:01:48,198 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:01:48,198 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:01:48,198 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845184417] [2019-11-15 22:01:48,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:01:48,199 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:01:48,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:01:48,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:01:48,199 INFO L87 Difference]: Start difference. First operand 439 states and 675 transitions. Second operand 6 states. [2019-11-15 22:01:48,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:01:48,491 INFO L93 Difference]: Finished difference Result 825 states and 1195 transitions. [2019-11-15 22:01:48,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:01:48,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-15 22:01:48,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:01:48,497 INFO L225 Difference]: With dead ends: 825 [2019-11-15 22:01:48,497 INFO L226 Difference]: Without dead ends: 825 [2019-11-15 22:01:48,498 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:01:48,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2019-11-15 22:01:48,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 787. [2019-11-15 22:01:48,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2019-11-15 22:01:48,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1155 transitions. [2019-11-15 22:01:48,532 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1155 transitions. Word has length 15 [2019-11-15 22:01:48,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:01:48,533 INFO L462 AbstractCegarLoop]: Abstraction has 787 states and 1155 transitions. [2019-11-15 22:01:48,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:01:48,533 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1155 transitions. [2019-11-15 22:01:48,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 22:01:48,534 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:01:48,534 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:01:48,535 INFO L410 AbstractCegarLoop]: === Iteration 9 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:01:48,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:01:48,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1460861468, now seen corresponding path program 1 times [2019-11-15 22:01:48,535 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:01:48,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994875480] [2019-11-15 22:01:48,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:48,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:48,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:01:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:48,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:01:48,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994875480] [2019-11-15 22:01:48,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634403622] [2019-11-15 22:01:48,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/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-15 22:01:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:48,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:01:48,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:01:48,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:49,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:49,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:01:49,020 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:01:49,020 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-11-15 22:01:49,021 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797165291] [2019-11-15 22:01:49,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:01:49,021 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:01:49,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:01:49,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:01:49,022 INFO L87 Difference]: Start difference. First operand 787 states and 1155 transitions. Second operand 5 states. [2019-11-15 22:01:49,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:01:49,128 INFO L93 Difference]: Finished difference Result 1183 states and 1782 transitions. [2019-11-15 22:01:49,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:01:49,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-15 22:01:49,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:01:49,136 INFO L225 Difference]: With dead ends: 1183 [2019-11-15 22:01:49,137 INFO L226 Difference]: Without dead ends: 1183 [2019-11-15 22:01:49,138 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:01:49,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-11-15 22:01:49,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1165. [2019-11-15 22:01:49,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2019-11-15 22:01:49,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1774 transitions. [2019-11-15 22:01:49,201 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1774 transitions. Word has length 22 [2019-11-15 22:01:49,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:01:49,201 INFO L462 AbstractCegarLoop]: Abstraction has 1165 states and 1774 transitions. [2019-11-15 22:01:49,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:01:49,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1774 transitions. [2019-11-15 22:01:49,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 22:01:49,206 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:01:49,206 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:01:49,417 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:01:49,417 INFO L410 AbstractCegarLoop]: === Iteration 10 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:01:49,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:01:49,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1432975042, now seen corresponding path program 1 times [2019-11-15 22:01:49,418 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:01:49,418 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518499700] [2019-11-15 22:01:49,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:49,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:49,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:01:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:49,623 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:01:49,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518499700] [2019-11-15 22:01:49,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828947272] [2019-11-15 22:01:49,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/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-15 22:01:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:49,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 22:01:49,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:01:49,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:49,816 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:01:49,818 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:01:49,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 8 [2019-11-15 22:01:49,819 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957096922] [2019-11-15 22:01:49,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:01:49,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:01:49,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:01:49,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:01:49,820 INFO L87 Difference]: Start difference. First operand 1165 states and 1774 transitions. Second operand 8 states. [2019-11-15 22:01:50,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:01:50,507 INFO L93 Difference]: Finished difference Result 1911 states and 2806 transitions. [2019-11-15 22:01:50,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 22:01:50,508 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-11-15 22:01:50,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:01:50,519 INFO L225 Difference]: With dead ends: 1911 [2019-11-15 22:01:50,519 INFO L226 Difference]: Without dead ends: 1911 [2019-11-15 22:01:50,520 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:01:50,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2019-11-15 22:01:50,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1795. [2019-11-15 22:01:50,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1795 states. [2019-11-15 22:01:50,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2664 transitions. [2019-11-15 22:01:50,597 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2664 transitions. Word has length 24 [2019-11-15 22:01:50,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:01:50,599 INFO L462 AbstractCegarLoop]: Abstraction has 1795 states and 2664 transitions. [2019-11-15 22:01:50,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:01:50,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2664 transitions. [2019-11-15 22:01:50,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 22:01:50,602 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:01:50,602 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:01:50,805 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:01:50,811 INFO L410 AbstractCegarLoop]: === Iteration 11 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:01:50,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:01:50,812 INFO L82 PathProgramCache]: Analyzing trace with hash -2052097881, now seen corresponding path program 1 times [2019-11-15 22:01:50,812 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:01:50,812 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912573723] [2019-11-15 22:01:50,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:50,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:50,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:01:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:50,992 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:01:50,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912573723] [2019-11-15 22:01:50,993 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:01:50,993 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:01:50,993 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650037232] [2019-11-15 22:01:50,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:01:50,993 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:01:50,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:01:50,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:01:50,994 INFO L87 Difference]: Start difference. First operand 1795 states and 2664 transitions. Second operand 8 states. [2019-11-15 22:01:51,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:01:51,797 INFO L93 Difference]: Finished difference Result 718 states and 935 transitions. [2019-11-15 22:01:51,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 22:01:51,797 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-15 22:01:51,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:01:51,801 INFO L225 Difference]: With dead ends: 718 [2019-11-15 22:01:51,801 INFO L226 Difference]: Without dead ends: 622 [2019-11-15 22:01:51,802 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:01:51,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-11-15 22:01:51,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 516. [2019-11-15 22:01:51,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-11-15 22:01:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 696 transitions. [2019-11-15 22:01:51,834 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 696 transitions. Word has length 29 [2019-11-15 22:01:51,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:01:51,834 INFO L462 AbstractCegarLoop]: Abstraction has 516 states and 696 transitions. [2019-11-15 22:01:51,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:01:51,834 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 696 transitions. [2019-11-15 22:01:51,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 22:01:51,836 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:01:51,836 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:01:51,837 INFO L410 AbstractCegarLoop]: === Iteration 12 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:01:51,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:01:51,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1040852765, now seen corresponding path program 1 times [2019-11-15 22:01:51,837 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:01:51,838 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571331962] [2019-11-15 22:01:51,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:51,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:51,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:01:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:51,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:52,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:01:52,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571331962] [2019-11-15 22:01:52,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048422513] [2019-11-15 22:01:52,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/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-15 22:01:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:52,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 22:01:52,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:01:52,295 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:01:52,296 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:01:52,296 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2019-11-15 22:01:52,297 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630397170] [2019-11-15 22:01:52,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 22:01:52,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:01:52,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 22:01:52,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:01:52,298 INFO L87 Difference]: Start difference. First operand 516 states and 696 transitions. Second operand 11 states. [2019-11-15 22:01:53,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:01:53,476 INFO L93 Difference]: Finished difference Result 1007 states and 1342 transitions. [2019-11-15 22:01:53,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 22:01:53,476 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2019-11-15 22:01:53,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:01:53,482 INFO L225 Difference]: With dead ends: 1007 [2019-11-15 22:01:53,482 INFO L226 Difference]: Without dead ends: 1007 [2019-11-15 22:01:53,483 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2019-11-15 22:01:53,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2019-11-15 22:01:53,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 540. [2019-11-15 22:01:53,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-11-15 22:01:53,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 714 transitions. [2019-11-15 22:01:53,511 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 714 transitions. Word has length 29 [2019-11-15 22:01:53,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:01:53,511 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 714 transitions. [2019-11-15 22:01:53,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 22:01:53,512 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 714 transitions. [2019-11-15 22:01:53,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 22:01:53,514 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:01:53,514 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:01:53,718 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:01:53,718 INFO L410 AbstractCegarLoop]: === Iteration 13 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:01:53,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:01:53,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1093253170, now seen corresponding path program 1 times [2019-11-15 22:01:53,719 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:01:53,719 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665137286] [2019-11-15 22:01:53,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:53,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:53,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:01:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:53,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:53,948 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:01:53,948 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665137286] [2019-11-15 22:01:53,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819265216] [2019-11-15 22:01:53,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/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-15 22:01:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:54,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-15 22:01:54,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:01:54,166 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-15 22:01:54,166 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:01:54,167 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2019-11-15 22:01:54,167 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209837487] [2019-11-15 22:01:54,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:01:54,167 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:01:54,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:01:54,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:01:54,168 INFO L87 Difference]: Start difference. First operand 540 states and 714 transitions. Second operand 4 states. [2019-11-15 22:01:54,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:01:54,224 INFO L93 Difference]: Finished difference Result 691 states and 909 transitions. [2019-11-15 22:01:54,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:01:54,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-15 22:01:54,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:01:54,228 INFO L225 Difference]: With dead ends: 691 [2019-11-15 22:01:54,229 INFO L226 Difference]: Without dead ends: 691 [2019-11-15 22:01:54,229 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:01:54,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-11-15 22:01:54,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 658. [2019-11-15 22:01:54,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-11-15 22:01:54,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 876 transitions. [2019-11-15 22:01:54,250 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 876 transitions. Word has length 35 [2019-11-15 22:01:54,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:01:54,250 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 876 transitions. [2019-11-15 22:01:54,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:01:54,250 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 876 transitions. [2019-11-15 22:01:54,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 22:01:54,252 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:01:54,252 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:01:54,464 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:01:54,465 INFO L410 AbstractCegarLoop]: === Iteration 14 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:01:54,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:01:54,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1953100812, now seen corresponding path program 1 times [2019-11-15 22:01:54,465 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:01:54,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039173226] [2019-11-15 22:01:54,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:54,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:54,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:01:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:54,736 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:01:54,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039173226] [2019-11-15 22:01:54,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759461399] [2019-11-15 22:01:54,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/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-15 22:01:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:54,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 22:01:54,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:01:54,969 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:01:54,970 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:01:54,970 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 15 [2019-11-15 22:01:54,970 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127957734] [2019-11-15 22:01:54,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 22:01:54,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:01:54,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 22:01:54,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:01:54,971 INFO L87 Difference]: Start difference. First operand 658 states and 876 transitions. Second operand 15 states. [2019-11-15 22:01:55,163 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-11-15 22:01:56,117 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-11-15 22:01:56,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:01:56,775 INFO L93 Difference]: Finished difference Result 2459 states and 3422 transitions. [2019-11-15 22:01:56,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-15 22:01:56,775 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2019-11-15 22:01:56,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:01:56,789 INFO L225 Difference]: With dead ends: 2459 [2019-11-15 22:01:56,789 INFO L226 Difference]: Without dead ends: 2459 [2019-11-15 22:01:56,790 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=243, Invalid=879, Unknown=0, NotChecked=0, Total=1122 [2019-11-15 22:01:56,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2459 states. [2019-11-15 22:01:56,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2459 to 2089. [2019-11-15 22:01:56,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2089 states. [2019-11-15 22:01:56,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2835 transitions. [2019-11-15 22:01:56,867 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2835 transitions. Word has length 35 [2019-11-15 22:01:56,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:01:56,867 INFO L462 AbstractCegarLoop]: Abstraction has 2089 states and 2835 transitions. [2019-11-15 22:01:56,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 22:01:56,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2835 transitions. [2019-11-15 22:01:56,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 22:01:56,869 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:01:56,870 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 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-15 22:01:57,073 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:01:57,073 INFO L410 AbstractCegarLoop]: === Iteration 15 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:01:57,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:01:57,074 INFO L82 PathProgramCache]: Analyzing trace with hash 714165325, now seen corresponding path program 1 times [2019-11-15 22:01:57,074 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:01:57,074 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372827542] [2019-11-15 22:01:57,074 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:57,074 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:57,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:01:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:57,299 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:01:57,299 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372827542] [2019-11-15 22:01:57,299 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212349094] [2019-11-15 22:01:57,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/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-15 22:01:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:57,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 22:01:57,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:01:57,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:57,508 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:01:57,509 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:01:57,509 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2019-11-15 22:01:57,509 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506650955] [2019-11-15 22:01:57,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 22:01:57,509 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:01:57,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 22:01:57,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:01:57,510 INFO L87 Difference]: Start difference. First operand 2089 states and 2835 transitions. Second operand 13 states. [2019-11-15 22:01:58,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:01:58,405 INFO L93 Difference]: Finished difference Result 2911 states and 4152 transitions. [2019-11-15 22:01:58,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 22:01:58,405 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2019-11-15 22:01:58,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:01:58,424 INFO L225 Difference]: With dead ends: 2911 [2019-11-15 22:01:58,424 INFO L226 Difference]: Without dead ends: 2911 [2019-11-15 22:01:58,426 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2019-11-15 22:01:58,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2019-11-15 22:01:58,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 2600. [2019-11-15 22:01:58,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2600 states. [2019-11-15 22:01:58,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2600 states to 2600 states and 3563 transitions. [2019-11-15 22:01:58,508 INFO L78 Accepts]: Start accepts. Automaton has 2600 states and 3563 transitions. Word has length 36 [2019-11-15 22:01:58,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:01:58,508 INFO L462 AbstractCegarLoop]: Abstraction has 2600 states and 3563 transitions. [2019-11-15 22:01:58,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 22:01:58,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2600 states and 3563 transitions. [2019-11-15 22:01:58,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 22:01:58,511 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:01:58,511 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:01:58,715 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:01:58,715 INFO L410 AbstractCegarLoop]: === Iteration 16 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:01:58,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:01:58,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1332527599, now seen corresponding path program 1 times [2019-11-15 22:01:58,716 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:01:58,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433714841] [2019-11-15 22:01:58,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:58,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:58,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:01:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:58,939 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:01:58,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433714841] [2019-11-15 22:01:58,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057229768] [2019-11-15 22:01:58,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/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-15 22:01:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:59,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 22:01:59,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:01:59,200 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:01:59,201 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:01:59,201 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2019-11-15 22:01:59,201 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979308078] [2019-11-15 22:01:59,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 22:01:59,202 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:01:59,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 22:01:59,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:01:59,202 INFO L87 Difference]: Start difference. First operand 2600 states and 3563 transitions. Second operand 13 states. [2019-11-15 22:02:00,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:02:00,451 INFO L93 Difference]: Finished difference Result 3941 states and 6103 transitions. [2019-11-15 22:02:00,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 22:02:00,458 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2019-11-15 22:02:00,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:02:00,486 INFO L225 Difference]: With dead ends: 3941 [2019-11-15 22:02:00,486 INFO L226 Difference]: Without dead ends: 3929 [2019-11-15 22:02:00,487 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2019-11-15 22:02:00,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3929 states. [2019-11-15 22:02:00,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3929 to 2963. [2019-11-15 22:02:00,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2963 states. [2019-11-15 22:02:00,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2963 states to 2963 states and 4090 transitions. [2019-11-15 22:02:00,620 INFO L78 Accepts]: Start accepts. Automaton has 2963 states and 4090 transitions. Word has length 38 [2019-11-15 22:02:00,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:02:00,621 INFO L462 AbstractCegarLoop]: Abstraction has 2963 states and 4090 transitions. [2019-11-15 22:02:00,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 22:02:00,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2963 states and 4090 transitions. [2019-11-15 22:02:00,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 22:02:00,622 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:02:00,623 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:02:00,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:00,828 INFO L410 AbstractCegarLoop]: === Iteration 17 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:02:00,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:02:00,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1409232652, now seen corresponding path program 1 times [2019-11-15 22:02:00,828 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:02:00,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846364763] [2019-11-15 22:02:00,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:00,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:00,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:02:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:00,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:01,016 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 22:02:01,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846364763] [2019-11-15 22:02:01,017 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556834591] [2019-11-15 22:02:01,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/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-15 22:02:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:01,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 22:02:01,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:02:01,192 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 22:02:01,193 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:02:01,193 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2019-11-15 22:02:01,193 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647377308] [2019-11-15 22:02:01,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:02:01,193 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:02:01,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:02:01,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:02:01,194 INFO L87 Difference]: Start difference. First operand 2963 states and 4090 transitions. Second operand 6 states. [2019-11-15 22:02:01,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:02:01,342 INFO L93 Difference]: Finished difference Result 2148 states and 2867 transitions. [2019-11-15 22:02:01,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:02:01,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-11-15 22:02:01,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:02:01,353 INFO L225 Difference]: With dead ends: 2148 [2019-11-15 22:02:01,353 INFO L226 Difference]: Without dead ends: 1925 [2019-11-15 22:02:01,353 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:02:01,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2019-11-15 22:02:01,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1706. [2019-11-15 22:02:01,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2019-11-15 22:02:01,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2339 transitions. [2019-11-15 22:02:01,435 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2339 transitions. Word has length 43 [2019-11-15 22:02:01,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:02:01,435 INFO L462 AbstractCegarLoop]: Abstraction has 1706 states and 2339 transitions. [2019-11-15 22:02:01,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:02:01,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2339 transitions. [2019-11-15 22:02:01,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 22:02:01,436 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:02:01,437 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:02:01,640 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:01,641 INFO L410 AbstractCegarLoop]: === Iteration 18 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:02:01,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:02:01,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1483957744, now seen corresponding path program 1 times [2019-11-15 22:02:01,642 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:02:01,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954574845] [2019-11-15 22:02:01,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:01,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:01,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:02:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:01,857 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 22:02:01,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954574845] [2019-11-15 22:02:01,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303339541] [2019-11-15 22:02:01,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/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-15 22:02:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:02,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:02:02,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:02:02,051 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 22:02:02,052 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:02:02,052 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2019-11-15 22:02:02,052 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234223896] [2019-11-15 22:02:02,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 22:02:02,052 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:02:02,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 22:02:02,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:02:02,053 INFO L87 Difference]: Start difference. First operand 1706 states and 2339 transitions. Second operand 12 states. [2019-11-15 22:02:02,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:02:02,720 INFO L93 Difference]: Finished difference Result 2232 states and 3176 transitions. [2019-11-15 22:02:02,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 22:02:02,724 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2019-11-15 22:02:02,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:02:02,736 INFO L225 Difference]: With dead ends: 2232 [2019-11-15 22:02:02,736 INFO L226 Difference]: Without dead ends: 2232 [2019-11-15 22:02:02,736 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2019-11-15 22:02:02,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states. [2019-11-15 22:02:02,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 1706. [2019-11-15 22:02:02,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2019-11-15 22:02:02,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2339 transitions. [2019-11-15 22:02:02,796 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2339 transitions. Word has length 47 [2019-11-15 22:02:02,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:02:02,796 INFO L462 AbstractCegarLoop]: Abstraction has 1706 states and 2339 transitions. [2019-11-15 22:02:02,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 22:02:02,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2339 transitions. [2019-11-15 22:02:02,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 22:02:02,798 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:02:02,798 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:02:03,006 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:03,006 INFO L410 AbstractCegarLoop]: === Iteration 19 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:02:03,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:02:03,007 INFO L82 PathProgramCache]: Analyzing trace with hash 94583026, now seen corresponding path program 1 times [2019-11-15 22:02:03,007 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:02:03,007 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620563839] [2019-11-15 22:02:03,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:03,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:03,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:02:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:03,260 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 11 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 22:02:03,260 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620563839] [2019-11-15 22:02:03,260 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291153492] [2019-11-15 22:02:03,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/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-15 22:02:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:03,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 22:02:03,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:02:03,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:03,457 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:02:03,457 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:02:03,457 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2019-11-15 22:02:03,457 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237483442] [2019-11-15 22:02:03,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 22:02:03,458 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:02:03,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 22:02:03,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:02:03,459 INFO L87 Difference]: Start difference. First operand 1706 states and 2339 transitions. Second operand 16 states. [2019-11-15 22:02:04,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:02:04,886 INFO L93 Difference]: Finished difference Result 3365 states and 4826 transitions. [2019-11-15 22:02:04,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-15 22:02:04,886 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 47 [2019-11-15 22:02:04,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:02:04,901 INFO L225 Difference]: With dead ends: 3365 [2019-11-15 22:02:04,902 INFO L226 Difference]: Without dead ends: 3259 [2019-11-15 22:02:04,903 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=350, Invalid=1372, Unknown=0, NotChecked=0, Total=1722 [2019-11-15 22:02:04,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3259 states. [2019-11-15 22:02:04,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3259 to 2344. [2019-11-15 22:02:04,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2344 states. [2019-11-15 22:02:04,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 3215 transitions. [2019-11-15 22:02:04,974 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 3215 transitions. Word has length 47 [2019-11-15 22:02:04,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:02:04,975 INFO L462 AbstractCegarLoop]: Abstraction has 2344 states and 3215 transitions. [2019-11-15 22:02:04,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 22:02:04,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 3215 transitions. [2019-11-15 22:02:04,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 22:02:04,976 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:02:04,976 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:02:05,180 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:05,182 INFO L410 AbstractCegarLoop]: === Iteration 20 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:02:05,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:02:05,182 INFO L82 PathProgramCache]: Analyzing trace with hash -171717777, now seen corresponding path program 1 times [2019-11-15 22:02:05,182 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:02:05,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619578409] [2019-11-15 22:02:05,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:05,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:05,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:02:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:05,363 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 41 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-15 22:02:05,364 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619578409] [2019-11-15 22:02:05,364 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228061994] [2019-11-15 22:02:05,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:05,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:02:05,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:02:05,598 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-15 22:02:05,599 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:02:05,599 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2019-11-15 22:02:05,599 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338275499] [2019-11-15 22:02:05,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 22:02:05,600 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:02:05,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 22:02:05,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:02:05,600 INFO L87 Difference]: Start difference. First operand 2344 states and 3215 transitions. Second operand 12 states. [2019-11-15 22:02:06,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:02:06,165 INFO L93 Difference]: Finished difference Result 3277 states and 4750 transitions. [2019-11-15 22:02:06,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 22:02:06,170 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2019-11-15 22:02:06,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:02:06,189 INFO L225 Difference]: With dead ends: 3277 [2019-11-15 22:02:06,190 INFO L226 Difference]: Without dead ends: 3277 [2019-11-15 22:02:06,190 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2019-11-15 22:02:06,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3277 states. [2019-11-15 22:02:06,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3277 to 2344. [2019-11-15 22:02:06,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2344 states. [2019-11-15 22:02:06,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 3215 transitions. [2019-11-15 22:02:06,259 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 3215 transitions. Word has length 58 [2019-11-15 22:02:06,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:02:06,259 INFO L462 AbstractCegarLoop]: Abstraction has 2344 states and 3215 transitions. [2019-11-15 22:02:06,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 22:02:06,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 3215 transitions. [2019-11-15 22:02:06,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 22:02:06,261 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:02:06,261 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:02:06,474 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:06,474 INFO L410 AbstractCegarLoop]: === Iteration 21 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:02:06,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:02:06,474 INFO L82 PathProgramCache]: Analyzing trace with hash 197511793, now seen corresponding path program 1 times [2019-11-15 22:02:06,474 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:02:06,474 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475267766] [2019-11-15 22:02:06,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:06,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:06,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:02:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:06,763 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 43 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-15 22:02:06,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475267766] [2019-11-15 22:02:06,764 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705456330] [2019-11-15 22:02:06,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:06,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:02:06,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:02:06,988 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 58 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 22:02:06,988 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:02:06,988 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 15 [2019-11-15 22:02:06,988 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523258693] [2019-11-15 22:02:06,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 22:02:06,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:02:06,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 22:02:06,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:02:06,990 INFO L87 Difference]: Start difference. First operand 2344 states and 3215 transitions. Second operand 15 states. [2019-11-15 22:02:07,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:02:07,996 INFO L93 Difference]: Finished difference Result 4006 states and 5763 transitions. [2019-11-15 22:02:07,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 22:02:07,997 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2019-11-15 22:02:07,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:02:08,014 INFO L225 Difference]: With dead ends: 4006 [2019-11-15 22:02:08,020 INFO L226 Difference]: Without dead ends: 3900 [2019-11-15 22:02:08,021 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=1055, Unknown=0, NotChecked=0, Total=1332 [2019-11-15 22:02:08,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3900 states. [2019-11-15 22:02:08,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3900 to 3045. [2019-11-15 22:02:08,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3045 states. [2019-11-15 22:02:08,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3045 states to 3045 states and 4217 transitions. [2019-11-15 22:02:08,096 INFO L78 Accepts]: Start accepts. Automaton has 3045 states and 4217 transitions. Word has length 60 [2019-11-15 22:02:08,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:02:08,096 INFO L462 AbstractCegarLoop]: Abstraction has 3045 states and 4217 transitions. [2019-11-15 22:02:08,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 22:02:08,096 INFO L276 IsEmpty]: Start isEmpty. Operand 3045 states and 4217 transitions. [2019-11-15 22:02:08,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 22:02:08,099 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:02:08,099 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:02:08,303 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:08,303 INFO L410 AbstractCegarLoop]: === Iteration 22 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:02:08,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:02:08,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1936947262, now seen corresponding path program 1 times [2019-11-15 22:02:08,304 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:02:08,304 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250141691] [2019-11-15 22:02:08,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:08,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:08,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:02:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:08,587 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:02:08,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250141691] [2019-11-15 22:02:08,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920867177] [2019-11-15 22:02:08,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:08,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 22:02:08,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:02:08,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:08,819 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 56 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 22:02:08,819 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:02:08,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 18 [2019-11-15 22:02:08,819 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870811998] [2019-11-15 22:02:08,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 22:02:08,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:02:08,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 22:02:08,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-11-15 22:02:08,821 INFO L87 Difference]: Start difference. First operand 3045 states and 4217 transitions. Second operand 18 states. [2019-11-15 22:02:10,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:02:10,459 INFO L93 Difference]: Finished difference Result 5713 states and 8183 transitions. [2019-11-15 22:02:10,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-11-15 22:02:10,461 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 64 [2019-11-15 22:02:10,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:02:10,478 INFO L225 Difference]: With dead ends: 5713 [2019-11-15 22:02:10,478 INFO L226 Difference]: Without dead ends: 5607 [2019-11-15 22:02:10,479 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=545, Invalid=2211, Unknown=0, NotChecked=0, Total=2756 [2019-11-15 22:02:10,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5607 states. [2019-11-15 22:02:10,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5607 to 3641. [2019-11-15 22:02:10,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3641 states. [2019-11-15 22:02:10,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3641 states and 5051 transitions. [2019-11-15 22:02:10,582 INFO L78 Accepts]: Start accepts. Automaton has 3641 states and 5051 transitions. Word has length 64 [2019-11-15 22:02:10,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:02:10,583 INFO L462 AbstractCegarLoop]: Abstraction has 3641 states and 5051 transitions. [2019-11-15 22:02:10,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 22:02:10,583 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 5051 transitions. [2019-11-15 22:02:10,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-15 22:02:10,585 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:02:10,585 INFO L380 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:02:10,797 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:10,797 INFO L410 AbstractCegarLoop]: === Iteration 23 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:02:10,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:02:10,797 INFO L82 PathProgramCache]: Analyzing trace with hash 503876434, now seen corresponding path program 1 times [2019-11-15 22:02:10,797 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:02:10,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015222756] [2019-11-15 22:02:10,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:10,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:10,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:02:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:11,029 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 59 proven. 6 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-15 22:02:11,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015222756] [2019-11-15 22:02:11,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483263952] [2019-11-15 22:02:11,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:11,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:02:11,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:02:11,363 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 63 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-15 22:02:11,368 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:02:11,368 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2019-11-15 22:02:11,368 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389113210] [2019-11-15 22:02:11,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 22:02:11,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:02:11,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 22:02:11,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:02:11,371 INFO L87 Difference]: Start difference. First operand 3641 states and 5051 transitions. Second operand 12 states. [2019-11-15 22:02:12,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:02:12,333 INFO L93 Difference]: Finished difference Result 4980 states and 7197 transitions. [2019-11-15 22:02:12,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 22:02:12,334 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2019-11-15 22:02:12,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:02:12,349 INFO L225 Difference]: With dead ends: 4980 [2019-11-15 22:02:12,349 INFO L226 Difference]: Without dead ends: 4980 [2019-11-15 22:02:12,350 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2019-11-15 22:02:12,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4980 states. [2019-11-15 22:02:12,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4980 to 3641. [2019-11-15 22:02:12,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3641 states. [2019-11-15 22:02:12,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3641 states and 5051 transitions. [2019-11-15 22:02:12,436 INFO L78 Accepts]: Start accepts. Automaton has 3641 states and 5051 transitions. Word has length 71 [2019-11-15 22:02:12,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:02:12,436 INFO L462 AbstractCegarLoop]: Abstraction has 3641 states and 5051 transitions. [2019-11-15 22:02:12,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 22:02:12,436 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 5051 transitions. [2019-11-15 22:02:12,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 22:02:12,445 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:02:12,445 INFO L380 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:02:12,649 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:12,649 INFO L410 AbstractCegarLoop]: === Iteration 24 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:02:12,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:02:12,649 INFO L82 PathProgramCache]: Analyzing trace with hash -15822214, now seen corresponding path program 1 times [2019-11-15 22:02:12,649 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:02:12,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105244612] [2019-11-15 22:02:12,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:12,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:12,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:02:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:12,857 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 31 proven. 50 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-15 22:02:12,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105244612] [2019-11-15 22:02:12,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633881027] [2019-11-15 22:02:12,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:13,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:02:13,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:02:13,209 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 87 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-15 22:02:13,210 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:02:13,210 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-11-15 22:02:13,211 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751286680] [2019-11-15 22:02:13,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 22:02:13,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:02:13,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 22:02:13,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-11-15 22:02:13,212 INFO L87 Difference]: Start difference. First operand 3641 states and 5051 transitions. Second operand 17 states. [2019-11-15 22:02:15,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:02:15,748 INFO L93 Difference]: Finished difference Result 7908 states and 11268 transitions. [2019-11-15 22:02:15,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-11-15 22:02:15,748 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2019-11-15 22:02:15,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:02:15,773 INFO L225 Difference]: With dead ends: 7908 [2019-11-15 22:02:15,773 INFO L226 Difference]: Without dead ends: 7908 [2019-11-15 22:02:15,774 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1151 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=676, Invalid=3484, Unknown=0, NotChecked=0, Total=4160 [2019-11-15 22:02:15,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7908 states. [2019-11-15 22:02:15,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7908 to 6998. [2019-11-15 22:02:15,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6998 states. [2019-11-15 22:02:15,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6998 states to 6998 states and 9880 transitions. [2019-11-15 22:02:15,926 INFO L78 Accepts]: Start accepts. Automaton has 6998 states and 9880 transitions. Word has length 72 [2019-11-15 22:02:15,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:02:15,927 INFO L462 AbstractCegarLoop]: Abstraction has 6998 states and 9880 transitions. [2019-11-15 22:02:15,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 22:02:15,927 INFO L276 IsEmpty]: Start isEmpty. Operand 6998 states and 9880 transitions. [2019-11-15 22:02:15,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 22:02:15,929 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:02:15,929 INFO L380 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:02:16,133 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:16,133 INFO L410 AbstractCegarLoop]: === Iteration 25 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:02:16,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:02:16,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1454542435, now seen corresponding path program 1 times [2019-11-15 22:02:16,133 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:02:16,133 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388045531] [2019-11-15 22:02:16,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:16,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:16,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:02:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:16,388 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 68 proven. 21 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-15 22:02:16,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388045531] [2019-11-15 22:02:16,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328711415] [2019-11-15 22:02:16,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:16,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 22:02:16,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:02:16,659 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 72 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-15 22:02:16,660 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:02:16,661 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 15 [2019-11-15 22:02:16,661 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12021794] [2019-11-15 22:02:16,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 22:02:16,661 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:02:16,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 22:02:16,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:02:16,662 INFO L87 Difference]: Start difference. First operand 6998 states and 9880 transitions. Second operand 15 states. [2019-11-15 22:02:17,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:02:17,663 INFO L93 Difference]: Finished difference Result 9904 states and 14398 transitions. [2019-11-15 22:02:17,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 22:02:17,663 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2019-11-15 22:02:17,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:02:17,691 INFO L225 Difference]: With dead ends: 9904 [2019-11-15 22:02:17,692 INFO L226 Difference]: Without dead ends: 9826 [2019-11-15 22:02:17,692 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=248, Invalid=874, Unknown=0, NotChecked=0, Total=1122 [2019-11-15 22:02:17,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9826 states. [2019-11-15 22:02:17,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9826 to 7386. [2019-11-15 22:02:17,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7386 states. [2019-11-15 22:02:17,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7386 states to 7386 states and 10372 transitions. [2019-11-15 22:02:17,855 INFO L78 Accepts]: Start accepts. Automaton has 7386 states and 10372 transitions. Word has length 73 [2019-11-15 22:02:17,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:02:17,856 INFO L462 AbstractCegarLoop]: Abstraction has 7386 states and 10372 transitions. [2019-11-15 22:02:17,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 22:02:17,856 INFO L276 IsEmpty]: Start isEmpty. Operand 7386 states and 10372 transitions. [2019-11-15 22:02:17,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-15 22:02:17,858 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:02:17,858 INFO L380 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:02:18,064 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:18,064 INFO L410 AbstractCegarLoop]: === Iteration 26 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:02:18,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:02:18,065 INFO L82 PathProgramCache]: Analyzing trace with hash -924062608, now seen corresponding path program 1 times [2019-11-15 22:02:18,065 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:02:18,065 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081951564] [2019-11-15 22:02:18,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:18,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:18,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:02:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:18,394 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 59 proven. 41 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-15 22:02:18,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081951564] [2019-11-15 22:02:18,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220258959] [2019-11-15 22:02:18,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:18,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 22:02:18,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:02:18,627 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 63 proven. 43 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 22:02:18,628 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:02:18,628 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 16 [2019-11-15 22:02:18,628 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529295982] [2019-11-15 22:02:18,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 22:02:18,629 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:02:18,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 22:02:18,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:02:18,629 INFO L87 Difference]: Start difference. First operand 7386 states and 10372 transitions. Second operand 16 states. [2019-11-15 22:02:19,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:02:19,863 INFO L93 Difference]: Finished difference Result 12886 states and 18823 transitions. [2019-11-15 22:02:19,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-15 22:02:19,864 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 77 [2019-11-15 22:02:19,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:02:19,896 INFO L225 Difference]: With dead ends: 12886 [2019-11-15 22:02:19,897 INFO L226 Difference]: Without dead ends: 12886 [2019-11-15 22:02:19,897 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=388, Invalid=1418, Unknown=0, NotChecked=0, Total=1806 [2019-11-15 22:02:19,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12886 states. [2019-11-15 22:02:20,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12886 to 10684. [2019-11-15 22:02:20,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10684 states. [2019-11-15 22:02:20,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10684 states to 10684 states and 15242 transitions. [2019-11-15 22:02:20,112 INFO L78 Accepts]: Start accepts. Automaton has 10684 states and 15242 transitions. Word has length 77 [2019-11-15 22:02:20,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:02:20,112 INFO L462 AbstractCegarLoop]: Abstraction has 10684 states and 15242 transitions. [2019-11-15 22:02:20,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 22:02:20,112 INFO L276 IsEmpty]: Start isEmpty. Operand 10684 states and 15242 transitions. [2019-11-15 22:02:20,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 22:02:20,116 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:02:20,116 INFO L380 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:02:20,320 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:20,320 INFO L410 AbstractCegarLoop]: === Iteration 27 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:02:20,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:02:20,321 INFO L82 PathProgramCache]: Analyzing trace with hash 318724927, now seen corresponding path program 1 times [2019-11-15 22:02:20,321 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:02:20,321 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827290626] [2019-11-15 22:02:20,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:20,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:20,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:02:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:20,586 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 18 proven. 77 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-11-15 22:02:20,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827290626] [2019-11-15 22:02:20,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909968400] [2019-11-15 22:02:20,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:20,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-15 22:02:20,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:02:20,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:20,877 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 39 proven. 66 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-15 22:02:20,878 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:02:20,878 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 17 [2019-11-15 22:02:20,878 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220593479] [2019-11-15 22:02:20,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 22:02:20,880 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:02:20,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 22:02:20,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-11-15 22:02:20,881 INFO L87 Difference]: Start difference. First operand 10684 states and 15242 transitions. Second operand 17 states. [2019-11-15 22:02:22,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:02:22,760 INFO L93 Difference]: Finished difference Result 20662 states and 30513 transitions. [2019-11-15 22:02:22,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-11-15 22:02:22,760 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 81 [2019-11-15 22:02:22,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:02:22,817 INFO L225 Difference]: With dead ends: 20662 [2019-11-15 22:02:22,817 INFO L226 Difference]: Without dead ends: 20662 [2019-11-15 22:02:22,819 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 826 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=624, Invalid=2346, Unknown=0, NotChecked=0, Total=2970 [2019-11-15 22:02:22,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20662 states. [2019-11-15 22:02:23,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20662 to 12894. [2019-11-15 22:02:23,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12894 states. [2019-11-15 22:02:23,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12894 states to 12894 states and 18541 transitions. [2019-11-15 22:02:23,190 INFO L78 Accepts]: Start accepts. Automaton has 12894 states and 18541 transitions. Word has length 81 [2019-11-15 22:02:23,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:02:23,190 INFO L462 AbstractCegarLoop]: Abstraction has 12894 states and 18541 transitions. [2019-11-15 22:02:23,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 22:02:23,190 INFO L276 IsEmpty]: Start isEmpty. Operand 12894 states and 18541 transitions. [2019-11-15 22:02:23,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-15 22:02:23,198 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:02:23,198 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1] [2019-11-15 22:02:23,402 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:23,402 INFO L410 AbstractCegarLoop]: === Iteration 28 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:02:23,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:02:23,402 INFO L82 PathProgramCache]: Analyzing trace with hash 45020656, now seen corresponding path program 1 times [2019-11-15 22:02:23,402 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:02:23,403 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415767404] [2019-11-15 22:02:23,403 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:23,403 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:23,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:02:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:23,725 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 33 proven. 64 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-15 22:02:23,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415767404] [2019-11-15 22:02:23,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664068873] [2019-11-15 22:02:23,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:23,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 22:02:23,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:02:24,201 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 81 proven. 20 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-15 22:02:24,202 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:02:24,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2019-11-15 22:02:24,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563034068] [2019-11-15 22:02:24,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 22:02:24,202 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:02:24,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 22:02:24,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2019-11-15 22:02:24,203 INFO L87 Difference]: Start difference. First operand 12894 states and 18541 transitions. Second operand 22 states. [2019-11-15 22:02:36,492 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-11-15 22:02:37,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:02:37,756 INFO L93 Difference]: Finished difference Result 26172 states and 38296 transitions. [2019-11-15 22:02:37,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2019-11-15 22:02:37,757 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 86 [2019-11-15 22:02:37,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:02:37,803 INFO L225 Difference]: With dead ends: 26172 [2019-11-15 22:02:37,804 INFO L226 Difference]: Without dead ends: 26026 [2019-11-15 22:02:37,812 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14516 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=4015, Invalid=32275, Unknown=0, NotChecked=0, Total=36290 [2019-11-15 22:02:37,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26026 states. [2019-11-15 22:02:38,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26026 to 20900. [2019-11-15 22:02:38,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20900 states. [2019-11-15 22:02:38,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20900 states to 20900 states and 30515 transitions. [2019-11-15 22:02:38,249 INFO L78 Accepts]: Start accepts. Automaton has 20900 states and 30515 transitions. Word has length 86 [2019-11-15 22:02:38,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:02:38,250 INFO L462 AbstractCegarLoop]: Abstraction has 20900 states and 30515 transitions. [2019-11-15 22:02:38,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 22:02:38,250 INFO L276 IsEmpty]: Start isEmpty. Operand 20900 states and 30515 transitions. [2019-11-15 22:02:38,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-15 22:02:38,254 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:02:38,255 INFO L380 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:02:38,458 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:38,459 INFO L410 AbstractCegarLoop]: === Iteration 29 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:02:38,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:02:38,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1231720282, now seen corresponding path program 1 times [2019-11-15 22:02:38,459 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:02:38,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431382585] [2019-11-15 22:02:38,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:38,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:38,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:02:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:38,696 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 84 proven. 20 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-15 22:02:38,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431382585] [2019-11-15 22:02:38,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308945905] [2019-11-15 22:02:38,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:38,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 22:02:38,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:02:38,971 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 119 proven. 6 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-15 22:02:38,972 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:02:38,972 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2019-11-15 22:02:38,972 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682416791] [2019-11-15 22:02:38,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 22:02:38,973 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:02:38,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 22:02:38,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:02:38,973 INFO L87 Difference]: Start difference. First operand 20900 states and 30515 transitions. Second operand 13 states. [2019-11-15 22:02:39,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:02:39,786 INFO L93 Difference]: Finished difference Result 22899 states and 33210 transitions. [2019-11-15 22:02:39,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 22:02:39,806 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2019-11-15 22:02:39,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:02:39,848 INFO L225 Difference]: With dead ends: 22899 [2019-11-15 22:02:39,848 INFO L226 Difference]: Without dead ends: 22675 [2019-11-15 22:02:39,849 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2019-11-15 22:02:39,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22675 states. [2019-11-15 22:02:40,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22675 to 22442. [2019-11-15 22:02:40,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22442 states. [2019-11-15 22:02:40,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22442 states to 22442 states and 32752 transitions. [2019-11-15 22:02:40,374 INFO L78 Accepts]: Start accepts. Automaton has 22442 states and 32752 transitions. Word has length 86 [2019-11-15 22:02:40,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:02:40,374 INFO L462 AbstractCegarLoop]: Abstraction has 22442 states and 32752 transitions. [2019-11-15 22:02:40,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 22:02:40,374 INFO L276 IsEmpty]: Start isEmpty. Operand 22442 states and 32752 transitions. [2019-11-15 22:02:40,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 22:02:40,379 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:02:40,379 INFO L380 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:02:40,581 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:40,581 INFO L410 AbstractCegarLoop]: === Iteration 30 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:02:40,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:02:40,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1891166639, now seen corresponding path program 2 times [2019-11-15 22:02:40,582 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:02:40,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171265539] [2019-11-15 22:02:40,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:40,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:40,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:02:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:40,828 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 81 proven. 32 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-15 22:02:40,828 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171265539] [2019-11-15 22:02:40,828 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858635193] [2019-11-15 22:02:40,828 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:41,012 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:02:41,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:02:41,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 22:02:41,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:02:41,124 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 133 proven. 5 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-15 22:02:41,124 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:02:41,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2019-11-15 22:02:41,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525420894] [2019-11-15 22:02:41,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 22:02:41,125 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:02:41,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 22:02:41,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:02:41,126 INFO L87 Difference]: Start difference. First operand 22442 states and 32752 transitions. Second operand 14 states. [2019-11-15 22:02:42,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:02:42,188 INFO L93 Difference]: Finished difference Result 23977 states and 34458 transitions. [2019-11-15 22:02:42,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 22:02:42,188 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 88 [2019-11-15 22:02:42,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:02:42,230 INFO L225 Difference]: With dead ends: 23977 [2019-11-15 22:02:42,231 INFO L226 Difference]: Without dead ends: 23193 [2019-11-15 22:02:42,231 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2019-11-15 22:02:42,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23193 states. [2019-11-15 22:02:42,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23193 to 23184. [2019-11-15 22:02:42,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23184 states. [2019-11-15 22:02:42,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23184 states to 23184 states and 33442 transitions. [2019-11-15 22:02:42,523 INFO L78 Accepts]: Start accepts. Automaton has 23184 states and 33442 transitions. Word has length 88 [2019-11-15 22:02:42,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:02:42,523 INFO L462 AbstractCegarLoop]: Abstraction has 23184 states and 33442 transitions. [2019-11-15 22:02:42,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 22:02:42,524 INFO L276 IsEmpty]: Start isEmpty. Operand 23184 states and 33442 transitions. [2019-11-15 22:02:42,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 22:02:42,529 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:02:42,529 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:02:42,733 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:42,733 INFO L410 AbstractCegarLoop]: === Iteration 31 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:02:42,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:02:42,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1945747458, now seen corresponding path program 1 times [2019-11-15 22:02:42,734 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:02:42,734 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777754370] [2019-11-15 22:02:42,734 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:42,734 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:42,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:02:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:43,010 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 55 proven. 47 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-15 22:02:43,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777754370] [2019-11-15 22:02:43,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203263514] [2019-11-15 22:02:43,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:43,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 22:02:43,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:02:43,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:43,260 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 66 proven. 38 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-15 22:02:43,260 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:02:43,260 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 17 [2019-11-15 22:02:43,260 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255628337] [2019-11-15 22:02:43,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 22:02:43,261 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:02:43,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 22:02:43,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-11-15 22:02:43,261 INFO L87 Difference]: Start difference. First operand 23184 states and 33442 transitions. Second operand 17 states. [2019-11-15 22:02:44,237 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-15 22:02:45,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:02:45,631 INFO L93 Difference]: Finished difference Result 23226 states and 33370 transitions. [2019-11-15 22:02:45,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-11-15 22:02:45,631 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 90 [2019-11-15 22:02:45,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:02:45,670 INFO L225 Difference]: With dead ends: 23226 [2019-11-15 22:02:45,670 INFO L226 Difference]: Without dead ends: 23088 [2019-11-15 22:02:45,671 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=580, Invalid=2282, Unknown=0, NotChecked=0, Total=2862 [2019-11-15 22:02:45,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23088 states. [2019-11-15 22:02:45,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23088 to 20330. [2019-11-15 22:02:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20330 states. [2019-11-15 22:02:45,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20330 states to 20330 states and 28981 transitions. [2019-11-15 22:02:45,924 INFO L78 Accepts]: Start accepts. Automaton has 20330 states and 28981 transitions. Word has length 90 [2019-11-15 22:02:45,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:02:45,924 INFO L462 AbstractCegarLoop]: Abstraction has 20330 states and 28981 transitions. [2019-11-15 22:02:45,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 22:02:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 20330 states and 28981 transitions. [2019-11-15 22:02:45,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 22:02:45,927 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:02:45,928 INFO L380 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:02:46,130 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:46,130 INFO L410 AbstractCegarLoop]: === Iteration 32 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:02:46,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:02:46,130 INFO L82 PathProgramCache]: Analyzing trace with hash -799994244, now seen corresponding path program 2 times [2019-11-15 22:02:46,130 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:02:46,130 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071582947] [2019-11-15 22:02:46,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:46,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:46,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:02:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:46,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:46,409 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 70 proven. 42 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-11-15 22:02:46,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071582947] [2019-11-15 22:02:46,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589487280] [2019-11-15 22:02:46,409 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:46,624 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:02:46,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:02:46,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 22:02:46,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:02:46,696 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 128 proven. 4 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-11-15 22:02:46,696 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:02:46,697 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2019-11-15 22:02:46,697 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231347795] [2019-11-15 22:02:46,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 22:02:46,697 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:02:46,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 22:02:46,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:02:46,698 INFO L87 Difference]: Start difference. First operand 20330 states and 28981 transitions. Second operand 14 states. [2019-11-15 22:02:47,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:02:47,811 INFO L93 Difference]: Finished difference Result 20675 states and 28700 transitions. [2019-11-15 22:02:47,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 22:02:47,812 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 92 [2019-11-15 22:02:47,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:02:47,856 INFO L225 Difference]: With dead ends: 20675 [2019-11-15 22:02:47,856 INFO L226 Difference]: Without dead ends: 19387 [2019-11-15 22:02:47,858 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2019-11-15 22:02:47,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19387 states. [2019-11-15 22:02:48,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19387 to 19378. [2019-11-15 22:02:48,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19378 states. [2019-11-15 22:02:48,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19378 states to 19378 states and 27124 transitions. [2019-11-15 22:02:48,664 INFO L78 Accepts]: Start accepts. Automaton has 19378 states and 27124 transitions. Word has length 92 [2019-11-15 22:02:48,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:02:48,665 INFO L462 AbstractCegarLoop]: Abstraction has 19378 states and 27124 transitions. [2019-11-15 22:02:48,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 22:02:48,665 INFO L276 IsEmpty]: Start isEmpty. Operand 19378 states and 27124 transitions. [2019-11-15 22:02:48,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 22:02:48,670 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:02:48,670 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:02:48,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:48,875 INFO L410 AbstractCegarLoop]: === Iteration 33 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:02:48,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:02:48,875 INFO L82 PathProgramCache]: Analyzing trace with hash -190318009, now seen corresponding path program 1 times [2019-11-15 22:02:48,875 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:02:48,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106263252] [2019-11-15 22:02:48,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:48,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:48,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:02:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:49,349 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 36 proven. 80 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-11-15 22:02:49,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106263252] [2019-11-15 22:02:49,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110692221] [2019-11-15 22:02:49,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:49,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 79 conjunts are in the unsatisfiable core [2019-11-15 22:02:49,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:02:50,016 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 46 proven. 75 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-15 22:02:50,016 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:02:50,017 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2019-11-15 22:02:50,017 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475227357] [2019-11-15 22:02:50,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-15 22:02:50,017 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:02:50,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-15 22:02:50,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2019-11-15 22:02:50,018 INFO L87 Difference]: Start difference. First operand 19378 states and 27124 transitions. Second operand 23 states. [2019-11-15 22:02:51,231 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-11-15 22:02:52,305 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-11-15 22:02:52,455 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-11-15 22:02:53,229 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-11-15 22:02:53,372 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-11-15 22:02:54,118 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-11-15 22:02:55,266 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-11-15 22:02:56,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:02:56,123 INFO L93 Difference]: Finished difference Result 24250 states and 33842 transitions. [2019-11-15 22:02:56,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-11-15 22:02:56,123 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 95 [2019-11-15 22:02:56,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:02:56,179 INFO L225 Difference]: With dead ends: 24250 [2019-11-15 22:02:56,179 INFO L226 Difference]: Without dead ends: 24250 [2019-11-15 22:02:56,180 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 118 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1029, Invalid=4373, Unknown=0, NotChecked=0, Total=5402 [2019-11-15 22:02:56,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24250 states. [2019-11-15 22:02:56,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24250 to 22895. [2019-11-15 22:02:56,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22895 states. [2019-11-15 22:02:56,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22895 states to 22895 states and 31929 transitions. [2019-11-15 22:02:56,566 INFO L78 Accepts]: Start accepts. Automaton has 22895 states and 31929 transitions. Word has length 95 [2019-11-15 22:02:56,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:02:56,566 INFO L462 AbstractCegarLoop]: Abstraction has 22895 states and 31929 transitions. [2019-11-15 22:02:56,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-15 22:02:56,567 INFO L276 IsEmpty]: Start isEmpty. Operand 22895 states and 31929 transitions. [2019-11-15 22:02:56,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 22:02:56,571 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:02:56,571 INFO L380 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:02:56,775 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:56,777 INFO L410 AbstractCegarLoop]: === Iteration 34 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:02:56,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:02:56,777 INFO L82 PathProgramCache]: Analyzing trace with hash -802797619, now seen corresponding path program 2 times [2019-11-15 22:02:56,778 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:02:56,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531633964] [2019-11-15 22:02:56,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:56,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:56,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:02:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:57,048 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 46 proven. 55 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-11-15 22:02:57,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531633964] [2019-11-15 22:02:57,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492345864] [2019-11-15 22:02:57,049 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:57,284 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:02:57,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:02:57,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 22:02:57,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:02:57,351 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 107 proven. 3 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-11-15 22:02:57,351 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:02:57,351 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2019-11-15 22:02:57,351 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199596332] [2019-11-15 22:02:57,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 22:02:57,352 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:02:57,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 22:02:57,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:02:57,352 INFO L87 Difference]: Start difference. First operand 22895 states and 31929 transitions. Second operand 14 states. [2019-11-15 22:02:58,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:02:58,511 INFO L93 Difference]: Finished difference Result 16637 states and 22088 transitions. [2019-11-15 22:02:58,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 22:02:58,512 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-11-15 22:02:58,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:02:58,534 INFO L225 Difference]: With dead ends: 16637 [2019-11-15 22:02:58,535 INFO L226 Difference]: Without dead ends: 15373 [2019-11-15 22:02:58,535 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2019-11-15 22:02:58,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15373 states. [2019-11-15 22:02:58,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15373 to 15354. [2019-11-15 22:02:58,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15354 states. [2019-11-15 22:02:58,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15354 states to 15354 states and 20688 transitions. [2019-11-15 22:02:58,715 INFO L78 Accepts]: Start accepts. Automaton has 15354 states and 20688 transitions. Word has length 96 [2019-11-15 22:02:58,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:02:58,715 INFO L462 AbstractCegarLoop]: Abstraction has 15354 states and 20688 transitions. [2019-11-15 22:02:58,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 22:02:58,715 INFO L276 IsEmpty]: Start isEmpty. Operand 15354 states and 20688 transitions. [2019-11-15 22:02:58,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-15 22:02:58,721 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:02:58,722 INFO L380 BasicCegarLoop]: trace histogram [10, 9, 8, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:02:58,926 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:58,926 INFO L410 AbstractCegarLoop]: === Iteration 35 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:02:58,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:02:58,926 INFO L82 PathProgramCache]: Analyzing trace with hash 853184567, now seen corresponding path program 1 times [2019-11-15 22:02:58,927 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:02:58,927 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310260170] [2019-11-15 22:02:58,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:58,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:58,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:02:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:59,227 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 67 proven. 4 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-11-15 22:02:59,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310260170] [2019-11-15 22:02:59,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184414921] [2019-11-15 22:02:59,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:59,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:02:59,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:02:59,529 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 69 proven. 4 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2019-11-15 22:02:59,529 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:02:59,530 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 13 [2019-11-15 22:02:59,530 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128143168] [2019-11-15 22:02:59,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 22:02:59,530 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:02:59,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 22:02:59,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:02:59,531 INFO L87 Difference]: Start difference. First operand 15354 states and 20688 transitions. Second operand 13 states. [2019-11-15 22:03:00,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:03:00,828 INFO L93 Difference]: Finished difference Result 19812 states and 26983 transitions. [2019-11-15 22:03:00,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 22:03:00,829 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 118 [2019-11-15 22:03:00,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:03:00,871 INFO L225 Difference]: With dead ends: 19812 [2019-11-15 22:03:00,871 INFO L226 Difference]: Without dead ends: 19812 [2019-11-15 22:03:00,872 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2019-11-15 22:03:00,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19812 states. [2019-11-15 22:03:01,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19812 to 19332. [2019-11-15 22:03:01,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19332 states. [2019-11-15 22:03:01,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19332 states to 19332 states and 26408 transitions. [2019-11-15 22:03:01,110 INFO L78 Accepts]: Start accepts. Automaton has 19332 states and 26408 transitions. Word has length 118 [2019-11-15 22:03:01,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:03:01,111 INFO L462 AbstractCegarLoop]: Abstraction has 19332 states and 26408 transitions. [2019-11-15 22:03:01,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 22:03:01,111 INFO L276 IsEmpty]: Start isEmpty. Operand 19332 states and 26408 transitions. [2019-11-15 22:03:01,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-15 22:03:01,118 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:03:01,118 INFO L380 BasicCegarLoop]: trace histogram [11, 10, 9, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:03:01,322 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:03:01,322 INFO L410 AbstractCegarLoop]: === Iteration 36 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:03:01,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:03:01,322 INFO L82 PathProgramCache]: Analyzing trace with hash 203174600, now seen corresponding path program 1 times [2019-11-15 22:03:01,322 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:03:01,323 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973599241] [2019-11-15 22:03:01,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:03:01,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:03:01,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:03:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:03:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:03:01,433 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:03:01,434 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 22:03:01,509 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-11-15 22:03:01,537 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-11-15 22:03:01,539 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-11-15 22:03:01,544 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-11-15 22:03:01,546 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-11-15 22:03:01,551 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-11-15 22:03:01,553 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-11-15 22:03:01,560 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-11-15 22:03:01,561 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-11-15 22:03:01,563 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-11-15 22:03:01,563 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-11-15 22:03:01,572 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-11-15 22:03:01,573 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch6 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-11-15 22:03:01,574 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch6 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-11-15 22:03:01,574 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch6 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-11-15 22:03:01,576 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch6 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-11-15 22:03:01,576 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch6 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-11-15 22:03:01,577 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch6 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-11-15 22:03:01,581 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch6 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-11-15 22:03:01,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:03:01 BoogieIcfgContainer [2019-11-15 22:03:01,603 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:03:01,604 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:03:01,604 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:03:01,604 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:03:01,604 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:01:44" (3/4) ... [2019-11-15 22:03:01,607 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:03:01,607 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:03:01,610 INFO L168 Benchmark]: Toolchain (without parser) took 78422.36 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 938.0 MB in the beginning and 1.5 GB in the end (delta: -594.6 MB). Peak memory consumption was 740.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:03:01,610 INFO L168 Benchmark]: CDTParser took 0.13 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-15 22:03:01,611 INFO L168 Benchmark]: CACSL2BoogieTranslator took 612.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -206.3 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:03:01,611 INFO L168 Benchmark]: Boogie Preprocessor took 56.92 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-15 22:03:01,611 INFO L168 Benchmark]: RCFGBuilder took 596.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 59.1 MB). Peak memory consumption was 59.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:03:01,612 INFO L168 Benchmark]: TraceAbstraction took 77148.75 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -447.4 MB). Peak memory consumption was 721.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:03:01,612 INFO L168 Benchmark]: Witness Printer took 3.99 ms. Allocated memory is still 2.4 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:03:01,614 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 612.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -206.3 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.92 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 596.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 59.1 MB). Peak memory consumption was 59.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 77148.75 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -447.4 MB). Peak memory consumption was 721.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.99 ms. Allocated memory is still 2.4 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch6 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch6 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch6 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch6 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch6 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch6 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch6 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 581]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 581. Possible FailurePath: [L517] struct cell *S; [L518] int pc1 = 1; [L519] int pc4 = 1; [L520] static struct cell *t1 = ((void *)0); [L521] static struct cell *x1 = ((void *)0); [L550] struct cell* garbage; [L551] static struct cell *t4 = ((void *)0); [L552] static struct cell *x4 = ((void *)0); [L555] static int res4; VAL [\old(garbage)=22, \old(garbage)=18, \old(pc1)=13, \old(pc4)=23, \old(res4)=14, \old(S)=10, \old(S)=15, \old(t1)=21, \old(t1)=30, \old(t4)=11, \old(t4)=16, \old(x1)=24, \old(x1)=20, \old(x4)=29, \old(x4)=28, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L583] S || 1 != pc1 || __VERIFIER_nondet_int() [L583] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L583] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L584] COND TRUE __VERIFIER_nondet_int() [L585] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L524] pc1++ [L525] case 1: [L526] x1 = malloc(sizeof(*x1)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={-1:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L527] x1->data = 0 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={-1:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L528] x1->next = ((void *)0) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={-1:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L585] RET push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L583] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L583] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L584] COND TRUE __VERIFIER_nondet_int() [L585] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=-1, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L524] pc1++ [L525] case 1: [L530] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=-1, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L531] x1->data = 4 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=-1, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L585] RET push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L583] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L583] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L584] COND TRUE __VERIFIER_nondet_int() [L585] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L524] pc1++ [L525] case 1: [L530] case 2: [L533] case 3: [L534] t1 = S VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=-1, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L585] RET push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L583] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L583] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L584] COND TRUE __VERIFIER_nondet_int() [L585] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L524] pc1++ [L525] case 1: [L530] case 2: [L533] case 3: [L536] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L537] x1->next = t1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=-1, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L585] RET push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L583] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L583] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L584] COND TRUE __VERIFIER_nondet_int() [L585] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L524] pc1++ [L525] case 1: [L530] case 2: [L533] case 3: [L536] case 4: [L539] case 5: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L540] COND TRUE S == t1 [L541] S = x1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L585] RET push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L583] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={-1:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L583] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L584] COND TRUE __VERIFIER_nondet_int() [L585] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=-1, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L524] pc1++ [L525] case 1: [L530] case 2: [L533] case 3: [L536] case 4: [L539] case 5: [L545] case 6: [L546] pc1 = 1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=-1, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=-1, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc1++=6, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L585] RET push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L583] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={-1:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L583] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L584] COND FALSE !(__VERIFIER_nondet_int()) [L587] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=-1, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L556] pc4++ [L557] case 1: [L558] t4 = S VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=-1, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, pc4++=1, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L587] RET pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L583] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, res4=0, S={-1:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L583] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L584] COND FALSE !(__VERIFIER_nondet_int()) [L587] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=-1, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=-1, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L556] pc4++ [L557] case 1: [L560] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=0, \old(S)=-1, \old(t1)=0, \old(t1)=0, \old(t4)=-1, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L561] COND FALSE !(t4 == ((void *)0)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=0, \old(S)=-1, \old(t1)=0, \old(t1)=0, \old(t4)=-1, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L587] RET pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L583] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, res4=0, S={-1:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L583] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L584] COND FALSE !(__VERIFIER_nondet_int()) [L587] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=-1, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=-1, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L556] pc4++ [L557] case 1: [L560] case 2: [L564] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=-1, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=-1, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L565] EXPR t4->next VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=-1, \old(t1)=0, \old(t1)=0, \old(t4)=-1, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, t4->next={0:0}, x1={-1:0}, x4={0:0}] [L565] x4 = t4->next [L587] RET pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L583] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, res4=0, S={-1:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L583] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L584] COND FALSE !(__VERIFIER_nondet_int()) [L587] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=-1, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=-1, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L556] pc4++ [L557] case 1: [L560] case 2: [L564] case 3: [L567] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=-1, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=-1, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L568] COND TRUE S == t4 [L569] S = x4 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=-1, \old(t1)=0, \old(t1)=0, \old(t4)=-1, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={0:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L587] RET pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L583] S || 1 != pc1 || __VERIFIER_nondet_int() [L583] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L583] COND FALSE !(S || 1 != pc1 || __VERIFIER_nondet_int()) [L589] COND FALSE !(\read(*garbage)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L594] S = ((void *)0) [L595] t1 = ((void *)0) [L596] x1 = ((void *)0) [L597] t4 = ((void *)0) [L598] x4 = ((void *)0) [L599] return !!garbage; VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, \result=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 89 locations, 20 error locations. Result: UNSAFE, OverallTime: 77.0s, OverallIterations: 36, TraceHistogramMax: 11, AutomataDifference: 50.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3074 SDtfs, 10668 SDslu, 7256 SDs, 0 SdLazy, 22656 SolverSat, 4205 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3106 GetRequests, 2071 SyntacticMatches, 39 SemanticMatches, 996 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22141 ImplicationChecksByTransitivity, 32.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23184occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.2s AutomataMinimizationTime, 35 MinimizatonAttempts, 32654 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 3580 NumberOfCodeBlocks, 3580 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 3388 ConstructedInterpolants, 10 QuantifiedInterpolants, 1114686 SizeOfPredicates, 114 NumberOfNonLiveVariables, 13210 ConjunctsInSsa, 393 ConjunctsInUnsatCore, 61 InterpolantComputations, 12 PerfectInterpolantSequences, 4040/5072 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 22:03:03,784 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:03:03,785 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:03:03,796 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:03:03,796 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:03:03,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:03:03,799 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:03:03,801 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:03:03,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:03:03,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:03:03,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:03:03,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:03:03,806 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:03:03,807 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:03:03,808 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:03:03,809 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:03:03,810 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:03:03,811 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:03:03,813 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:03:03,815 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:03:03,817 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:03:03,819 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:03:03,820 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:03:03,821 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:03:03,823 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:03:03,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:03:03,824 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:03:03,825 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:03:03,825 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:03:03,826 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:03:03,827 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:03:03,827 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:03:03,828 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:03:03,829 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:03:03,830 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:03:03,830 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:03:03,831 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:03:03,831 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:03:03,831 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:03:03,832 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:03:03,833 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:03:03,833 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-15 22:03:03,847 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:03:03,848 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:03:03,849 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:03:03,849 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:03:03,849 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:03:03,850 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:03:03,850 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:03:03,850 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:03:03,850 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:03:03,851 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:03:03,851 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:03:03,851 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 22:03:03,851 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 22:03:03,851 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 22:03:03,852 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:03:03,852 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 22:03:03,852 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 22:03:03,852 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:03:03,853 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:03:03,853 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:03:03,853 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:03:03,853 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:03:03,853 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:03:03,854 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:03:03,854 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:03:03,854 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:03:03,854 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 22:03:03,855 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 22:03:03,855 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 22:03:03,855 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_43a5540f-5626-4235-82d7-180b39dab7fe/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 -> 9f2a2a3db64819077b17ec0cac240c138be80e0f [2019-11-15 22:03:03,888 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:03:03,897 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:03:03,902 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:03:03,904 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:03:03,911 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:03:03,911 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/../../sv-benchmarks/c/memsafety/lockfree-3.3.i [2019-11-15 22:03:03,976 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/data/f959f3edf/3367201c362a4251968514bf55be0439/FLAG84777c235 [2019-11-15 22:03:04,426 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:03:04,428 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/sv-benchmarks/c/memsafety/lockfree-3.3.i [2019-11-15 22:03:04,446 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/data/f959f3edf/3367201c362a4251968514bf55be0439/FLAG84777c235 [2019-11-15 22:03:04,720 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/bin/uautomizer/data/f959f3edf/3367201c362a4251968514bf55be0439 [2019-11-15 22:03:04,722 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:03:04,723 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 22:03:04,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:03:04,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:03:04,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:03:04,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:03:04" (1/1) ... [2019-11-15 22:03:04,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@247cad69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:03:04, skipping insertion in model container [2019-11-15 22:03:04,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:03:04" (1/1) ... [2019-11-15 22:03:04,737 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:03:04,787 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:03:05,182 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:03:05,194 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:03:05,248 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:03:05,307 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:03:05,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:03:05 WrapperNode [2019-11-15 22:03:05,308 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:03:05,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:03:05,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:03:05,309 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:03:05,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:03:05" (1/1) ... [2019-11-15 22:03:05,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:03:05" (1/1) ... [2019-11-15 22:03:05,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:03:05" (1/1) ... [2019-11-15 22:03:05,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:03:05" (1/1) ... [2019-11-15 22:03:05,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:03:05" (1/1) ... [2019-11-15 22:03:05,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:03:05" (1/1) ... [2019-11-15 22:03:05,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:03:05" (1/1) ... [2019-11-15 22:03:05,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:03:05,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:03:05,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:03:05,384 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:03:05,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:03:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/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-15 22:03:05,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 22:03:05,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:03:05,436 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 22:03:05,436 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 22:03:05,436 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-15 22:03:05,436 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-15 22:03:05,437 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-15 22:03:05,437 INFO L138 BoogieDeclarations]: Found implementation of procedure push [2019-11-15 22:03:05,437 INFO L138 BoogieDeclarations]: Found implementation of procedure pop [2019-11-15 22:03:05,437 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 22:03:05,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 22:03:05,438 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 22:03:05,438 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 22:03:05,438 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 22:03:05,438 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 22:03:05,438 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 22:03:05,439 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 22:03:05,439 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 22:03:05,439 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 22:03:05,439 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 22:03:05,439 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 22:03:05,439 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 22:03:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 22:03:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 22:03:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 22:03:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 22:03:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 22:03:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 22:03:05,441 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 22:03:05,441 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-15 22:03:05,441 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-15 22:03:05,441 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-15 22:03:05,441 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 22:03:05,442 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 22:03:05,442 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 22:03:05,442 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 22:03:05,442 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 22:03:05,442 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 22:03:05,442 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 22:03:05,443 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 22:03:05,443 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 22:03:05,443 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 22:03:05,443 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 22:03:05,443 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 22:03:05,443 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 22:03:05,444 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 22:03:05,444 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 22:03:05,444 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 22:03:05,444 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 22:03:05,444 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 22:03:05,444 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 22:03:05,445 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 22:03:05,445 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 22:03:05,445 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 22:03:05,445 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 22:03:05,445 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 22:03:05,446 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 22:03:05,446 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 22:03:05,446 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 22:03:05,446 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 22:03:05,446 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 22:03:05,446 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 22:03:05,447 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 22:03:05,447 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 22:03:05,447 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 22:03:05,447 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 22:03:05,447 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 22:03:05,447 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 22:03:05,448 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 22:03:05,448 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 22:03:05,448 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 22:03:05,448 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 22:03:05,448 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 22:03:05,449 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 22:03:05,449 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 22:03:05,449 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 22:03:05,449 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 22:03:05,449 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 22:03:05,449 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 22:03:05,450 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 22:03:05,450 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 22:03:05,450 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 22:03:05,450 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 22:03:05,450 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 22:03:05,450 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 22:03:05,451 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 22:03:05,451 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 22:03:05,451 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 22:03:05,451 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 22:03:05,451 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 22:03:05,452 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 22:03:05,452 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 22:03:05,452 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 22:03:05,452 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 22:03:05,452 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 22:03:05,452 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 22:03:05,453 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 22:03:05,453 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 22:03:05,453 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 22:03:05,453 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 22:03:05,453 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 22:03:05,453 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 22:03:05,454 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 22:03:05,454 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 22:03:05,454 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 22:03:05,454 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 22:03:05,454 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 22:03:05,454 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 22:03:05,455 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 22:03:05,455 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 22:03:05,455 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 22:03:05,455 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 22:03:05,455 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 22:03:05,455 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 22:03:05,456 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 22:03:05,456 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 22:03:05,456 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 22:03:05,456 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 22:03:05,456 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 22:03:05,457 INFO L130 BoogieDeclarations]: Found specification of procedure push [2019-11-15 22:03:05,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:03:05,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 22:03:05,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:03:05,457 INFO L130 BoogieDeclarations]: Found specification of procedure pop [2019-11-15 22:03:05,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:03:05,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 22:03:05,458 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 22:03:05,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:03:05,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 22:03:05,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:03:06,166 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:03:06,166 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-15 22:03:06,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:03:06 BoogieIcfgContainer [2019-11-15 22:03:06,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:03:06,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:03:06,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:03:06,171 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:03:06,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:03:04" (1/3) ... [2019-11-15 22:03:06,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6393ef1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:03:06, skipping insertion in model container [2019-11-15 22:03:06,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:03:05" (2/3) ... [2019-11-15 22:03:06,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6393ef1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:03:06, skipping insertion in model container [2019-11-15 22:03:06,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:03:06" (3/3) ... [2019-11-15 22:03:06,174 INFO L109 eAbstractionObserver]: Analyzing ICFG lockfree-3.3.i [2019-11-15 22:03:06,183 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:03:06,193 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-15 22:03:06,201 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-15 22:03:06,219 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:03:06,219 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 22:03:06,220 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:03:06,220 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:03:06,220 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:03:06,220 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:03:06,220 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:03:06,220 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:03:06,238 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2019-11-15 22:03:06,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-15 22:03:06,247 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:03:06,248 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:03:06,250 INFO L410 AbstractCegarLoop]: === Iteration 1 === [popErr3REQUIRES_VIOLATION, popErr4REQUIRES_VIOLATION, popErr5REQUIRES_VIOLATION, popErr0REQUIRES_VIOLATION, popErr1REQUIRES_VIOLATION, popErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION, pushErr5REQUIRES_VIOLATION, pushErr0REQUIRES_VIOLATION, pushErr6REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr7REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION]=== [2019-11-15 22:03:06,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:03:06,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1085435516, now seen corresponding path program 1 times [2019-11-15 22:03:06,265 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:03:06,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [671750834] [2019-11-15 22:03:06,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43a5540f-5626-4235-82d7-180b39dab7fe/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-15 22:03:06,487 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:03:06,488 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-15 22:03:06,493 INFO L168 Benchmark]: Toolchain (without parser) took 1769.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 943.0 MB in the beginning and 1.0 GB in the end (delta: -106.0 MB). Peak memory consumption was 42.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:03:06,494 INFO L168 Benchmark]: CDTParser took 0.30 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-15 22:03:06,496 INFO L168 Benchmark]: CACSL2BoogieTranslator took 584.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -181.8 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:03:06,497 INFO L168 Benchmark]: Boogie Preprocessor took 68.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:03:06,499 INFO L168 Benchmark]: RCFGBuilder took 784.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:03:06,500 INFO L168 Benchmark]: TraceAbstraction took 322.98 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: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:03:06,510 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.30 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 584.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -181.8 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 784.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 322.98 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: 12.1 MB). Peak memory consumption was 12.1 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...