./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-properties/simple-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/simple-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 17ff5ae56efea2deac29e7fa779d53a24810a7c7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/simple-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 17ff5ae56efea2deac29e7fa779d53a24810a7c7 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:10:30,904 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:10:30,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:10:30,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:10:30,919 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:10:30,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:10:30,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:10:30,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:10:30,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:10:30,927 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:10:30,928 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:10:30,929 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:10:30,930 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:10:30,931 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:10:30,935 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:10:30,936 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:10:30,937 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:10:30,938 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:10:30,940 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:10:30,942 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:10:30,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:10:30,944 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:10:30,946 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:10:30,947 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:10:30,949 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:10:30,949 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:10:30,950 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:10:30,951 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:10:30,951 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:10:30,952 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:10:30,953 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:10:30,953 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:10:30,954 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:10:30,955 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:10:30,957 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:10:30,957 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:10:30,960 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:10:30,961 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:10:30,961 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:10:30,962 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:10:30,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:10:30,965 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-07-29 01:10:30,989 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:10:30,989 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:10:30,991 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:10:30,991 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:10:30,991 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:10:30,991 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:10:30,992 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:10:30,992 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:10:30,992 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:10:30,993 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:10:30,994 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:10:30,994 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:10:30,994 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:10:30,995 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 01:10:30,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:10:30,995 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:10:30,996 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:10:30,996 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:10:30,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:10:30,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:10:30,997 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:10:30,997 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:10:30,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:10:30,998 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:10:30,998 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:10:30,998 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:10:30,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:10:30,999 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:10:30,999 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 17ff5ae56efea2deac29e7fa779d53a24810a7c7 [2020-07-29 01:10:31,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:10:31,334 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:10:31,337 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:10:31,339 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:10:31,339 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:10:31,340 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/simple-2.i [2020-07-29 01:10:31,398 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceaf9ccc6/f658a34b19aa443d8d85ac551cdbed65/FLAGebd702200 [2020-07-29 01:10:31,893 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:10:31,894 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple-2.i [2020-07-29 01:10:31,915 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceaf9ccc6/f658a34b19aa443d8d85ac551cdbed65/FLAGebd702200 [2020-07-29 01:10:32,162 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceaf9ccc6/f658a34b19aa443d8d85ac551cdbed65 [2020-07-29 01:10:32,166 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:10:32,170 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:10:32,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:10:32,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:10:32,174 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:10:32,176 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:10:32" (1/1) ... [2020-07-29 01:10:32,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@539d8c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:32, skipping insertion in model container [2020-07-29 01:10:32,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:10:32" (1/1) ... [2020-07-29 01:10:32,187 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:10:32,233 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:10:32,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:10:32,657 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:10:32,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:10:32,757 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:10:32,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:32 WrapperNode [2020-07-29 01:10:32,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:10:32,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:10:32,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:10:32,759 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:10:32,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:32" (1/1) ... [2020-07-29 01:10:32,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:32" (1/1) ... [2020-07-29 01:10:32,791 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:32" (1/1) ... [2020-07-29 01:10:32,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:32" (1/1) ... [2020-07-29 01:10:32,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:32" (1/1) ... [2020-07-29 01:10:32,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:32" (1/1) ... [2020-07-29 01:10:32,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:32" (1/1) ... [2020-07-29 01:10:32,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:10:32,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:10:32,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:10:32,833 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:10:32,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-29 01:10:32,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:10:32,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:10:32,900 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-29 01:10:32,900 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-29 01:10:32,900 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-07-29 01:10:32,901 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-07-29 01:10:32,901 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-07-29 01:10:32,901 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-29 01:10:32,901 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:10:32,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-29 01:10:32,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-29 01:10:32,902 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-29 01:10:32,902 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-29 01:10:32,902 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-29 01:10:32,903 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-29 01:10:32,903 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-29 01:10:32,903 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-29 01:10:32,903 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-29 01:10:32,903 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-29 01:10:32,904 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-29 01:10:32,904 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-29 01:10:32,904 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-29 01:10:32,905 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-29 01:10:32,905 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-29 01:10:32,905 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-29 01:10:32,905 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-29 01:10:32,907 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-29 01:10:32,908 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-29 01:10:32,908 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-29 01:10:32,908 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-07-29 01:10:32,908 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-07-29 01:10:32,909 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-07-29 01:10:32,909 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-29 01:10:32,909 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-29 01:10:32,909 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-29 01:10:32,909 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-29 01:10:32,910 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-29 01:10:32,910 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-29 01:10:32,910 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-29 01:10:32,910 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-29 01:10:32,910 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-29 01:10:32,911 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-29 01:10:32,911 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-29 01:10:32,911 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-29 01:10:32,913 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-29 01:10:32,914 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-29 01:10:32,914 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-29 01:10:32,914 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-29 01:10:32,914 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-29 01:10:32,914 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-29 01:10:32,914 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-29 01:10:32,915 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-29 01:10:32,915 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-29 01:10:32,915 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-29 01:10:32,915 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-29 01:10:32,915 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-29 01:10:32,915 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-29 01:10:32,915 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-29 01:10:32,916 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-29 01:10:32,916 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-29 01:10:32,916 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-29 01:10:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-29 01:10:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-29 01:10:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-29 01:10:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-29 01:10:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-29 01:10:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-29 01:10:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-29 01:10:32,918 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-29 01:10:32,918 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-29 01:10:32,918 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-29 01:10:32,919 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-29 01:10:32,919 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-29 01:10:32,919 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-29 01:10:32,920 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-29 01:10:32,920 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-29 01:10:32,921 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-29 01:10:32,921 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-29 01:10:32,921 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-29 01:10:32,921 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-29 01:10:32,921 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-29 01:10:32,922 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-29 01:10:32,922 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-29 01:10:32,922 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-29 01:10:32,922 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-29 01:10:32,922 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-29 01:10:32,922 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-29 01:10:32,922 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-29 01:10:32,922 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-29 01:10:32,923 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-29 01:10:32,923 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-29 01:10:32,923 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-29 01:10:32,923 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-29 01:10:32,923 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-29 01:10:32,923 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-29 01:10:32,924 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-29 01:10:32,924 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-29 01:10:32,924 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-29 01:10:32,924 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-29 01:10:32,924 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-29 01:10:32,924 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-29 01:10:32,925 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-29 01:10:32,925 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-29 01:10:32,925 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-29 01:10:32,925 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-29 01:10:32,925 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-29 01:10:32,925 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-29 01:10:32,925 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-29 01:10:32,925 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-29 01:10:32,925 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-29 01:10:32,926 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-29 01:10:32,926 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-29 01:10:32,926 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-29 01:10:32,926 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-29 01:10:32,926 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-29 01:10:32,926 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-29 01:10:32,927 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-29 01:10:32,927 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-29 01:10:32,927 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-29 01:10:32,928 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:10:32,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:10:32,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:10:32,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-29 01:10:32,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-29 01:10:32,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:10:32,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:10:32,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:10:32,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:10:33,241 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-29 01:10:33,537 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:10:33,538 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-29 01:10:33,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:10:33 BoogieIcfgContainer [2020-07-29 01:10:33,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:10:33,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:10:33,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:10:33,553 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:10:33,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:10:32" (1/3) ... [2020-07-29 01:10:33,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@799f8ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:10:33, skipping insertion in model container [2020-07-29 01:10:33,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:32" (2/3) ... [2020-07-29 01:10:33,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@799f8ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:10:33, skipping insertion in model container [2020-07-29 01:10:33,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:10:33" (3/3) ... [2020-07-29 01:10:33,558 INFO L109 eAbstractionObserver]: Analyzing ICFG simple-2.i [2020-07-29 01:10:33,568 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:10:33,578 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2020-07-29 01:10:33,602 INFO L251 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2020-07-29 01:10:33,625 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:10:33,625 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:10:33,626 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:10:33,626 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:10:33,626 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:10:33,626 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:10:33,626 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:10:33,627 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:10:33,649 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2020-07-29 01:10:33,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-29 01:10:33,661 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:33,662 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:33,663 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:10:33,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:33,669 INFO L82 PathProgramCache]: Analyzing trace with hash 578856491, now seen corresponding path program 1 times [2020-07-29 01:10:33,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:10:33,681 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738958741] [2020-07-29 01:10:33,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:10:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:33,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:10:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:33,892 INFO L280 TraceCheckUtils]: 0: Hoare triple {58#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {53#true} is VALID [2020-07-29 01:10:33,893 INFO L280 TraceCheckUtils]: 1: Hoare triple {53#true} assume true; {53#true} is VALID [2020-07-29 01:10:33,893 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {53#true} {53#true} #103#return; {53#true} is VALID [2020-07-29 01:10:33,897 INFO L263 TraceCheckUtils]: 0: Hoare triple {53#true} call ULTIMATE.init(); {58#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:10:33,898 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {53#true} is VALID [2020-07-29 01:10:33,898 INFO L280 TraceCheckUtils]: 2: Hoare triple {53#true} assume true; {53#true} is VALID [2020-07-29 01:10:33,899 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {53#true} {53#true} #103#return; {53#true} is VALID [2020-07-29 01:10:33,899 INFO L263 TraceCheckUtils]: 4: Hoare triple {53#true} call #t~ret8 := main(); {53#true} is VALID [2020-07-29 01:10:33,900 INFO L280 TraceCheckUtils]: 5: Hoare triple {53#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {53#true} is VALID [2020-07-29 01:10:33,900 INFO L280 TraceCheckUtils]: 6: Hoare triple {53#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {53#true} is VALID [2020-07-29 01:10:33,900 INFO L280 TraceCheckUtils]: 7: Hoare triple {53#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {53#true} is VALID [2020-07-29 01:10:33,902 INFO L280 TraceCheckUtils]: 8: Hoare triple {53#true} assume !true; {54#false} is VALID [2020-07-29 01:10:33,902 INFO L280 TraceCheckUtils]: 9: Hoare triple {54#false} assume !(1 == #valid[~p~0.base]); {54#false} is VALID [2020-07-29 01:10:33,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:10:33,904 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738958741] [2020-07-29 01:10:33,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:10:33,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:10:33,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554982542] [2020-07-29 01:10:33,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-29 01:10:33,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:33,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:10:33,942 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:33,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-29 01:10:33,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:10:33,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:10:33,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:10:33,956 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2020-07-29 01:10:34,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:34,160 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2020-07-29 01:10:34,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:10:34,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-29 01:10:34,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:10:34,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:10:34,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2020-07-29 01:10:34,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:10:34,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2020-07-29 01:10:34,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 56 transitions. [2020-07-29 01:10:34,261 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:34,275 INFO L225 Difference]: With dead ends: 50 [2020-07-29 01:10:34,275 INFO L226 Difference]: Without dead ends: 43 [2020-07-29 01:10:34,277 INFO L675 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 [2020-07-29 01:10:34,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-29 01:10:34,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-29 01:10:34,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:10:34,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2020-07-29 01:10:34,315 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-29 01:10:34,315 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-29 01:10:34,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:34,321 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-07-29 01:10:34,321 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-07-29 01:10:34,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:34,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:34,323 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-29 01:10:34,323 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-29 01:10:34,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:34,328 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-07-29 01:10:34,328 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-07-29 01:10:34,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:34,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:34,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:10:34,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:10:34,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-29 01:10:34,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2020-07-29 01:10:34,335 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 10 [2020-07-29 01:10:34,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:10:34,336 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2020-07-29 01:10:34,336 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-29 01:10:34,337 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-07-29 01:10:34,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-29 01:10:34,337 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:34,338 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:34,338 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 01:10:34,338 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:10:34,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:34,339 INFO L82 PathProgramCache]: Analyzing trace with hash 764657291, now seen corresponding path program 1 times [2020-07-29 01:10:34,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:10:34,340 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556433632] [2020-07-29 01:10:34,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:10:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:34,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:10:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:34,446 INFO L280 TraceCheckUtils]: 0: Hoare triple {247#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {240#true} is VALID [2020-07-29 01:10:34,446 INFO L280 TraceCheckUtils]: 1: Hoare triple {240#true} assume true; {240#true} is VALID [2020-07-29 01:10:34,447 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {240#true} {240#true} #103#return; {240#true} is VALID [2020-07-29 01:10:34,448 INFO L263 TraceCheckUtils]: 0: Hoare triple {240#true} call ULTIMATE.init(); {247#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:10:34,449 INFO L280 TraceCheckUtils]: 1: Hoare triple {247#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {240#true} is VALID [2020-07-29 01:10:34,449 INFO L280 TraceCheckUtils]: 2: Hoare triple {240#true} assume true; {240#true} is VALID [2020-07-29 01:10:34,449 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {240#true} {240#true} #103#return; {240#true} is VALID [2020-07-29 01:10:34,450 INFO L263 TraceCheckUtils]: 4: Hoare triple {240#true} call #t~ret8 := main(); {240#true} is VALID [2020-07-29 01:10:34,451 INFO L280 TraceCheckUtils]: 5: Hoare triple {240#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {245#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-29 01:10:34,452 INFO L280 TraceCheckUtils]: 6: Hoare triple {245#(= 1 (select |#valid| main_~a~0.base))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {245#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-29 01:10:34,453 INFO L280 TraceCheckUtils]: 7: Hoare triple {245#(= 1 (select |#valid| main_~a~0.base))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {246#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:10:34,454 INFO L280 TraceCheckUtils]: 8: Hoare triple {246#(= 1 (select |#valid| main_~p~0.base))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {246#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:10:34,455 INFO L280 TraceCheckUtils]: 9: Hoare triple {246#(= 1 (select |#valid| main_~p~0.base))} assume !(0 != #t~nondet3);havoc #t~nondet3; {246#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:10:34,456 INFO L280 TraceCheckUtils]: 10: Hoare triple {246#(= 1 (select |#valid| main_~p~0.base))} assume !(1 == #valid[~p~0.base]); {241#false} is VALID [2020-07-29 01:10:34,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:10:34,458 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556433632] [2020-07-29 01:10:34,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:10:34,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:10:34,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949369537] [2020-07-29 01:10:34,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-29 01:10:34,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:34,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:10:34,477 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:34,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:10:34,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:10:34,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:10:34,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:10:34,479 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 5 states. [2020-07-29 01:10:34,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:34,803 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2020-07-29 01:10:34,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:10:34,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-29 01:10:34,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:10:34,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:10:34,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2020-07-29 01:10:34,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:10:34,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2020-07-29 01:10:34,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2020-07-29 01:10:34,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:34,902 INFO L225 Difference]: With dead ends: 51 [2020-07-29 01:10:34,903 INFO L226 Difference]: Without dead ends: 51 [2020-07-29 01:10:34,903 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:10:34,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-29 01:10:34,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2020-07-29 01:10:34,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:10:34,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 45 states. [2020-07-29 01:10:34,909 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 45 states. [2020-07-29 01:10:34,909 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 45 states. [2020-07-29 01:10:34,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:34,914 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2020-07-29 01:10:34,914 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2020-07-29 01:10:34,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:34,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:34,916 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 51 states. [2020-07-29 01:10:34,916 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 51 states. [2020-07-29 01:10:34,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:34,920 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2020-07-29 01:10:34,921 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2020-07-29 01:10:34,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:34,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:34,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:10:34,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:10:34,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-29 01:10:34,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2020-07-29 01:10:34,926 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 11 [2020-07-29 01:10:34,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:10:34,927 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2020-07-29 01:10:34,927 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:10:34,927 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2020-07-29 01:10:34,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-29 01:10:34,928 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:34,928 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:34,929 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 01:10:34,929 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:10:34,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:34,930 INFO L82 PathProgramCache]: Analyzing trace with hash 764657292, now seen corresponding path program 1 times [2020-07-29 01:10:34,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:10:34,930 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370197462] [2020-07-29 01:10:34,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:10:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:35,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:10:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:35,027 INFO L280 TraceCheckUtils]: 0: Hoare triple {457#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {450#true} is VALID [2020-07-29 01:10:35,028 INFO L280 TraceCheckUtils]: 1: Hoare triple {450#true} assume true; {450#true} is VALID [2020-07-29 01:10:35,028 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {450#true} {450#true} #103#return; {450#true} is VALID [2020-07-29 01:10:35,029 INFO L263 TraceCheckUtils]: 0: Hoare triple {450#true} call ULTIMATE.init(); {457#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:10:35,030 INFO L280 TraceCheckUtils]: 1: Hoare triple {457#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {450#true} is VALID [2020-07-29 01:10:35,030 INFO L280 TraceCheckUtils]: 2: Hoare triple {450#true} assume true; {450#true} is VALID [2020-07-29 01:10:35,030 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {450#true} {450#true} #103#return; {450#true} is VALID [2020-07-29 01:10:35,031 INFO L263 TraceCheckUtils]: 4: Hoare triple {450#true} call #t~ret8 := main(); {450#true} is VALID [2020-07-29 01:10:35,032 INFO L280 TraceCheckUtils]: 5: Hoare triple {450#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {455#(and (= 0 main_~a~0.offset) (= (select |#length| main_~a~0.base) 8))} is VALID [2020-07-29 01:10:35,034 INFO L280 TraceCheckUtils]: 6: Hoare triple {455#(and (= 0 main_~a~0.offset) (= (select |#length| main_~a~0.base) 8))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {455#(and (= 0 main_~a~0.offset) (= (select |#length| main_~a~0.base) 8))} is VALID [2020-07-29 01:10:35,035 INFO L280 TraceCheckUtils]: 7: Hoare triple {455#(and (= 0 main_~a~0.offset) (= (select |#length| main_~a~0.base) 8))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {456#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-29 01:10:35,036 INFO L280 TraceCheckUtils]: 8: Hoare triple {456#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {456#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-29 01:10:35,037 INFO L280 TraceCheckUtils]: 9: Hoare triple {456#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {456#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-29 01:10:35,038 INFO L280 TraceCheckUtils]: 10: Hoare triple {456#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} assume !(4 + ~p~0.offset <= #length[~p~0.base] && 0 <= ~p~0.offset); {451#false} is VALID [2020-07-29 01:10:35,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:10:35,040 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370197462] [2020-07-29 01:10:35,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:10:35,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:10:35,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607817658] [2020-07-29 01:10:35,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-29 01:10:35,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:35,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:10:35,058 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:35,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:10:35,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:10:35,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:10:35,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:10:35,059 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 5 states. [2020-07-29 01:10:35,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:35,394 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2020-07-29 01:10:35,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:10:35,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-29 01:10:35,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:10:35,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:10:35,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2020-07-29 01:10:35,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:10:35,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2020-07-29 01:10:35,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2020-07-29 01:10:35,503 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:35,506 INFO L225 Difference]: With dead ends: 60 [2020-07-29 01:10:35,506 INFO L226 Difference]: Without dead ends: 60 [2020-07-29 01:10:35,506 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:10:35,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-29 01:10:35,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2020-07-29 01:10:35,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:10:35,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 52 states. [2020-07-29 01:10:35,513 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 52 states. [2020-07-29 01:10:35,513 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 52 states. [2020-07-29 01:10:35,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:35,517 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2020-07-29 01:10:35,517 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2020-07-29 01:10:35,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:35,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:35,519 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 60 states. [2020-07-29 01:10:35,519 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 60 states. [2020-07-29 01:10:35,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:35,523 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2020-07-29 01:10:35,523 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2020-07-29 01:10:35,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:35,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:35,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:10:35,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:10:35,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-29 01:10:35,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2020-07-29 01:10:35,528 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 11 [2020-07-29 01:10:35,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:10:35,529 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2020-07-29 01:10:35,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:10:35,529 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2020-07-29 01:10:35,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-29 01:10:35,530 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:35,531 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:35,531 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-29 01:10:35,531 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:10:35,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:35,532 INFO L82 PathProgramCache]: Analyzing trace with hash 2109784215, now seen corresponding path program 1 times [2020-07-29 01:10:35,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:10:35,533 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197794351] [2020-07-29 01:10:35,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:10:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:35,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:10:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:35,634 INFO L280 TraceCheckUtils]: 0: Hoare triple {702#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {694#true} is VALID [2020-07-29 01:10:35,634 INFO L280 TraceCheckUtils]: 1: Hoare triple {694#true} assume true; {694#true} is VALID [2020-07-29 01:10:35,634 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {694#true} {694#true} #103#return; {694#true} is VALID [2020-07-29 01:10:35,636 INFO L263 TraceCheckUtils]: 0: Hoare triple {694#true} call ULTIMATE.init(); {702#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:10:35,637 INFO L280 TraceCheckUtils]: 1: Hoare triple {702#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {694#true} is VALID [2020-07-29 01:10:35,637 INFO L280 TraceCheckUtils]: 2: Hoare triple {694#true} assume true; {694#true} is VALID [2020-07-29 01:10:35,638 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {694#true} {694#true} #103#return; {694#true} is VALID [2020-07-29 01:10:35,638 INFO L263 TraceCheckUtils]: 4: Hoare triple {694#true} call #t~ret8 := main(); {694#true} is VALID [2020-07-29 01:10:35,639 INFO L280 TraceCheckUtils]: 5: Hoare triple {694#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {699#(= 0 main_~a~0.offset)} is VALID [2020-07-29 01:10:35,643 INFO L280 TraceCheckUtils]: 6: Hoare triple {699#(= 0 main_~a~0.offset)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {700#(not (= 0 main_~a~0.base))} is VALID [2020-07-29 01:10:35,644 INFO L280 TraceCheckUtils]: 7: Hoare triple {700#(not (= 0 main_~a~0.base))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {700#(not (= 0 main_~a~0.base))} is VALID [2020-07-29 01:10:35,645 INFO L280 TraceCheckUtils]: 8: Hoare triple {700#(not (= 0 main_~a~0.base))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {700#(not (= 0 main_~a~0.base))} is VALID [2020-07-29 01:10:35,645 INFO L280 TraceCheckUtils]: 9: Hoare triple {700#(not (= 0 main_~a~0.base))} assume !(0 != #t~nondet3);havoc #t~nondet3; {700#(not (= 0 main_~a~0.base))} is VALID [2020-07-29 01:10:35,646 INFO L280 TraceCheckUtils]: 10: Hoare triple {700#(not (= 0 main_~a~0.base))} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L525-4 {700#(not (= 0 main_~a~0.base))} is VALID [2020-07-29 01:10:35,647 INFO L280 TraceCheckUtils]: 11: Hoare triple {700#(not (= 0 main_~a~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4); srcloc: L532 {700#(not (= 0 main_~a~0.base))} is VALID [2020-07-29 01:10:35,648 INFO L280 TraceCheckUtils]: 12: Hoare triple {700#(not (= 0 main_~a~0.base))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {701#(not (= 0 main_~p~0.base))} is VALID [2020-07-29 01:10:35,649 INFO L280 TraceCheckUtils]: 13: Hoare triple {701#(not (= 0 main_~p~0.base))} assume !(~p~0.base != 0 || ~p~0.offset != 0); {695#false} is VALID [2020-07-29 01:10:35,649 INFO L280 TraceCheckUtils]: 14: Hoare triple {695#false} #res := 0; {695#false} is VALID [2020-07-29 01:10:35,649 INFO L280 TraceCheckUtils]: 15: Hoare triple {695#false} assume !(#valid == old(#valid)); {695#false} is VALID [2020-07-29 01:10:35,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:10:35,651 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197794351] [2020-07-29 01:10:35,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:10:35,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:10:35,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636279195] [2020-07-29 01:10:35,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-29 01:10:35,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:35,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:10:35,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:35,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:10:35,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:10:35,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:10:35,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:10:35,679 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2020-07-29 01:10:35,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:35,982 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2020-07-29 01:10:35,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:10:35,983 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-29 01:10:35,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:10:35,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:10:35,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2020-07-29 01:10:35,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:10:35,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2020-07-29 01:10:35,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2020-07-29 01:10:36,062 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:36,063 INFO L225 Difference]: With dead ends: 57 [2020-07-29 01:10:36,063 INFO L226 Difference]: Without dead ends: 57 [2020-07-29 01:10:36,064 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:10:36,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-29 01:10:36,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2020-07-29 01:10:36,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:10:36,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 52 states. [2020-07-29 01:10:36,073 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 52 states. [2020-07-29 01:10:36,073 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 52 states. [2020-07-29 01:10:36,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:36,077 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2020-07-29 01:10:36,078 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2020-07-29 01:10:36,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:36,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:36,079 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 57 states. [2020-07-29 01:10:36,079 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 57 states. [2020-07-29 01:10:36,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:36,083 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2020-07-29 01:10:36,083 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2020-07-29 01:10:36,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:36,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:36,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:10:36,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:10:36,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-29 01:10:36,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2020-07-29 01:10:36,089 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 16 [2020-07-29 01:10:36,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:10:36,089 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2020-07-29 01:10:36,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:10:36,090 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2020-07-29 01:10:36,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-29 01:10:36,094 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:36,094 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:36,094 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-29 01:10:36,094 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:10:36,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:36,095 INFO L82 PathProgramCache]: Analyzing trace with hash 978842128, now seen corresponding path program 1 times [2020-07-29 01:10:36,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:10:36,097 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189995068] [2020-07-29 01:10:36,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:10:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:36,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:10:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:36,306 INFO L280 TraceCheckUtils]: 0: Hoare triple {942#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {932#true} is VALID [2020-07-29 01:10:36,306 INFO L280 TraceCheckUtils]: 1: Hoare triple {932#true} assume true; {932#true} is VALID [2020-07-29 01:10:36,306 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {932#true} {932#true} #103#return; {932#true} is VALID [2020-07-29 01:10:36,308 INFO L263 TraceCheckUtils]: 0: Hoare triple {932#true} call ULTIMATE.init(); {942#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:10:36,308 INFO L280 TraceCheckUtils]: 1: Hoare triple {942#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {932#true} is VALID [2020-07-29 01:10:36,308 INFO L280 TraceCheckUtils]: 2: Hoare triple {932#true} assume true; {932#true} is VALID [2020-07-29 01:10:36,308 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {932#true} {932#true} #103#return; {932#true} is VALID [2020-07-29 01:10:36,309 INFO L263 TraceCheckUtils]: 4: Hoare triple {932#true} call #t~ret8 := main(); {932#true} is VALID [2020-07-29 01:10:36,309 INFO L280 TraceCheckUtils]: 5: Hoare triple {932#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {932#true} is VALID [2020-07-29 01:10:36,309 INFO L280 TraceCheckUtils]: 6: Hoare triple {932#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {932#true} is VALID [2020-07-29 01:10:36,310 INFO L280 TraceCheckUtils]: 7: Hoare triple {932#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {937#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:10:36,311 INFO L280 TraceCheckUtils]: 8: Hoare triple {937#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {937#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:10:36,312 INFO L280 TraceCheckUtils]: 9: Hoare triple {937#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {937#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:10:36,313 INFO L280 TraceCheckUtils]: 10: Hoare triple {937#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L525-4 {938#(and (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:10:36,315 INFO L280 TraceCheckUtils]: 11: Hoare triple {938#(and (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset main_~p~0.offset))} SUMMARY for call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4); srcloc: L532 {939#(= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-29 01:10:36,317 INFO L280 TraceCheckUtils]: 12: Hoare triple {939#(= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {940#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-29 01:10:36,318 INFO L280 TraceCheckUtils]: 13: Hoare triple {940#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0); {940#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-29 01:10:36,319 INFO L280 TraceCheckUtils]: 14: Hoare triple {940#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L536 {941#(= 1 |main_#t~mem6|)} is VALID [2020-07-29 01:10:36,320 INFO L280 TraceCheckUtils]: 15: Hoare triple {941#(= 1 |main_#t~mem6|)} assume 1 != #t~mem6;havoc #t~mem6; {933#false} is VALID [2020-07-29 01:10:36,320 INFO L280 TraceCheckUtils]: 16: Hoare triple {933#false} assume !false; {933#false} is VALID [2020-07-29 01:10:36,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:10:36,322 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189995068] [2020-07-29 01:10:36,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:10:36,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-29 01:10:36,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499651453] [2020-07-29 01:10:36,323 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-07-29 01:10:36,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:36,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:10:36,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:36,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-29 01:10:36,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:10:36,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:10:36,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:10:36,348 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 8 states. [2020-07-29 01:10:36,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:36,891 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2020-07-29 01:10:36,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:10:36,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-07-29 01:10:36,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:10:36,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:10:36,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2020-07-29 01:10:36,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:10:36,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2020-07-29 01:10:36,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 93 transitions. [2020-07-29 01:10:37,025 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:37,028 INFO L225 Difference]: With dead ends: 89 [2020-07-29 01:10:37,028 INFO L226 Difference]: Without dead ends: 89 [2020-07-29 01:10:37,029 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:10:37,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-07-29 01:10:37,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 56. [2020-07-29 01:10:37,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:10:37,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 56 states. [2020-07-29 01:10:37,034 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 56 states. [2020-07-29 01:10:37,034 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 56 states. [2020-07-29 01:10:37,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:37,038 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2020-07-29 01:10:37,038 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2020-07-29 01:10:37,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:37,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:37,040 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 89 states. [2020-07-29 01:10:37,040 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 89 states. [2020-07-29 01:10:37,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:37,044 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2020-07-29 01:10:37,044 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2020-07-29 01:10:37,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:37,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:37,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:10:37,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:10:37,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-29 01:10:37,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2020-07-29 01:10:37,048 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 17 [2020-07-29 01:10:37,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:10:37,049 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2020-07-29 01:10:37,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-29 01:10:37,049 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2020-07-29 01:10:37,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-29 01:10:37,050 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:37,050 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:37,050 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-29 01:10:37,051 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:10:37,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:37,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1500988158, now seen corresponding path program 1 times [2020-07-29 01:10:37,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:10:37,052 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066887455] [2020-07-29 01:10:37,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:10:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:37,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:10:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:37,174 INFO L280 TraceCheckUtils]: 0: Hoare triple {1281#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1272#true} is VALID [2020-07-29 01:10:37,175 INFO L280 TraceCheckUtils]: 1: Hoare triple {1272#true} assume true; {1272#true} is VALID [2020-07-29 01:10:37,175 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1272#true} {1272#true} #103#return; {1272#true} is VALID [2020-07-29 01:10:37,177 INFO L263 TraceCheckUtils]: 0: Hoare triple {1272#true} call ULTIMATE.init(); {1281#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:10:37,177 INFO L280 TraceCheckUtils]: 1: Hoare triple {1281#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1272#true} is VALID [2020-07-29 01:10:37,177 INFO L280 TraceCheckUtils]: 2: Hoare triple {1272#true} assume true; {1272#true} is VALID [2020-07-29 01:10:37,178 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1272#true} {1272#true} #103#return; {1272#true} is VALID [2020-07-29 01:10:37,178 INFO L263 TraceCheckUtils]: 4: Hoare triple {1272#true} call #t~ret8 := main(); {1272#true} is VALID [2020-07-29 01:10:37,178 INFO L280 TraceCheckUtils]: 5: Hoare triple {1272#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1272#true} is VALID [2020-07-29 01:10:37,180 INFO L280 TraceCheckUtils]: 6: Hoare triple {1272#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1272#true} is VALID [2020-07-29 01:10:37,180 INFO L280 TraceCheckUtils]: 7: Hoare triple {1272#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1272#true} is VALID [2020-07-29 01:10:37,180 INFO L280 TraceCheckUtils]: 8: Hoare triple {1272#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1272#true} is VALID [2020-07-29 01:10:37,181 INFO L280 TraceCheckUtils]: 9: Hoare triple {1272#true} assume !!(0 != #t~nondet3);havoc #t~nondet3; {1272#true} is VALID [2020-07-29 01:10:37,181 INFO L280 TraceCheckUtils]: 10: Hoare triple {1272#true} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L526 {1272#true} is VALID [2020-07-29 01:10:37,182 INFO L280 TraceCheckUtils]: 11: Hoare triple {1272#true} call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {1277#(= 1 (select |#valid| main_~t~0.base))} is VALID [2020-07-29 01:10:37,183 INFO L280 TraceCheckUtils]: 12: Hoare triple {1277#(= 1 (select |#valid| main_~t~0.base))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {1277#(= 1 (select |#valid| main_~t~0.base))} is VALID [2020-07-29 01:10:37,185 INFO L280 TraceCheckUtils]: 13: Hoare triple {1277#(= 1 (select |#valid| main_~t~0.base))} SUMMARY for call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); srcloc: L528-3 {1278#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-29 01:10:37,187 INFO L280 TraceCheckUtils]: 14: Hoare triple {1278#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); srcloc: L529 {1279#(= (select |#valid| |main_#t~mem5.base|) 1)} is VALID [2020-07-29 01:10:37,188 INFO L280 TraceCheckUtils]: 15: Hoare triple {1279#(= (select |#valid| |main_#t~mem5.base|) 1)} ~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1280#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:10:37,189 INFO L280 TraceCheckUtils]: 16: Hoare triple {1280#(= 1 (select |#valid| main_~p~0.base))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1280#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:10:37,190 INFO L280 TraceCheckUtils]: 17: Hoare triple {1280#(= 1 (select |#valid| main_~p~0.base))} assume !(0 != #t~nondet3);havoc #t~nondet3; {1280#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:10:37,191 INFO L280 TraceCheckUtils]: 18: Hoare triple {1280#(= 1 (select |#valid| main_~p~0.base))} assume !(1 == #valid[~p~0.base]); {1273#false} is VALID [2020-07-29 01:10:37,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:10:37,192 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066887455] [2020-07-29 01:10:37,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:10:37,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:10:37,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726307893] [2020-07-29 01:10:37,194 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-29 01:10:37,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:37,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:10:37,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:37,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:10:37,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:10:37,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:10:37,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:10:37,223 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 7 states. [2020-07-29 01:10:37,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:37,744 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2020-07-29 01:10:37,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:10:37,744 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-29 01:10:37,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:10:37,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:10:37,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2020-07-29 01:10:37,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:10:37,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2020-07-29 01:10:37,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 61 transitions. [2020-07-29 01:10:37,818 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:37,819 INFO L225 Difference]: With dead ends: 68 [2020-07-29 01:10:37,820 INFO L226 Difference]: Without dead ends: 68 [2020-07-29 01:10:37,820 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:10:37,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-29 01:10:37,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2020-07-29 01:10:37,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:10:37,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 54 states. [2020-07-29 01:10:37,825 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 54 states. [2020-07-29 01:10:37,825 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 54 states. [2020-07-29 01:10:37,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:37,829 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2020-07-29 01:10:37,830 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2020-07-29 01:10:37,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:37,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:37,830 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 68 states. [2020-07-29 01:10:37,830 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 68 states. [2020-07-29 01:10:37,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:37,833 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2020-07-29 01:10:37,833 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2020-07-29 01:10:37,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:37,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:37,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:10:37,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:10:37,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-29 01:10:37,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2020-07-29 01:10:37,836 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 19 [2020-07-29 01:10:37,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:10:37,836 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2020-07-29 01:10:37,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:10:37,837 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2020-07-29 01:10:37,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-29 01:10:37,837 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:37,837 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:37,838 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-29 01:10:37,838 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:10:37,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:37,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1500988159, now seen corresponding path program 1 times [2020-07-29 01:10:37,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:10:37,839 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928196417] [2020-07-29 01:10:37,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:10:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:38,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:10:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:38,012 INFO L280 TraceCheckUtils]: 0: Hoare triple {1558#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1549#true} is VALID [2020-07-29 01:10:38,013 INFO L280 TraceCheckUtils]: 1: Hoare triple {1549#true} assume true; {1549#true} is VALID [2020-07-29 01:10:38,013 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1549#true} {1549#true} #103#return; {1549#true} is VALID [2020-07-29 01:10:38,014 INFO L263 TraceCheckUtils]: 0: Hoare triple {1549#true} call ULTIMATE.init(); {1558#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:10:38,014 INFO L280 TraceCheckUtils]: 1: Hoare triple {1558#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1549#true} is VALID [2020-07-29 01:10:38,014 INFO L280 TraceCheckUtils]: 2: Hoare triple {1549#true} assume true; {1549#true} is VALID [2020-07-29 01:10:38,015 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1549#true} {1549#true} #103#return; {1549#true} is VALID [2020-07-29 01:10:38,015 INFO L263 TraceCheckUtils]: 4: Hoare triple {1549#true} call #t~ret8 := main(); {1549#true} is VALID [2020-07-29 01:10:38,015 INFO L280 TraceCheckUtils]: 5: Hoare triple {1549#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1549#true} is VALID [2020-07-29 01:10:38,015 INFO L280 TraceCheckUtils]: 6: Hoare triple {1549#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1549#true} is VALID [2020-07-29 01:10:38,016 INFO L280 TraceCheckUtils]: 7: Hoare triple {1549#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1549#true} is VALID [2020-07-29 01:10:38,016 INFO L280 TraceCheckUtils]: 8: Hoare triple {1549#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1549#true} is VALID [2020-07-29 01:10:38,016 INFO L280 TraceCheckUtils]: 9: Hoare triple {1549#true} assume !!(0 != #t~nondet3);havoc #t~nondet3; {1549#true} is VALID [2020-07-29 01:10:38,016 INFO L280 TraceCheckUtils]: 10: Hoare triple {1549#true} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L526 {1549#true} is VALID [2020-07-29 01:10:38,018 INFO L280 TraceCheckUtils]: 11: Hoare triple {1549#true} call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {1554#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset))} is VALID [2020-07-29 01:10:38,018 INFO L280 TraceCheckUtils]: 12: Hoare triple {1554#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {1554#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset))} is VALID [2020-07-29 01:10:38,020 INFO L280 TraceCheckUtils]: 13: Hoare triple {1554#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset))} SUMMARY for call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); srcloc: L528-3 {1555#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-29 01:10:38,021 INFO L280 TraceCheckUtils]: 14: Hoare triple {1555#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); srcloc: L529 {1556#(and (= 0 |main_#t~mem5.offset|) (= 8 (select |#length| |main_#t~mem5.base|)))} is VALID [2020-07-29 01:10:38,022 INFO L280 TraceCheckUtils]: 15: Hoare triple {1556#(and (= 0 |main_#t~mem5.offset|) (= 8 (select |#length| |main_#t~mem5.base|)))} ~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1557#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-29 01:10:38,022 INFO L280 TraceCheckUtils]: 16: Hoare triple {1557#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1557#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-29 01:10:38,023 INFO L280 TraceCheckUtils]: 17: Hoare triple {1557#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {1557#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-29 01:10:38,024 INFO L280 TraceCheckUtils]: 18: Hoare triple {1557#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} assume !(4 + ~p~0.offset <= #length[~p~0.base] && 0 <= ~p~0.offset); {1550#false} is VALID [2020-07-29 01:10:38,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:10:38,026 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928196417] [2020-07-29 01:10:38,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:10:38,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:10:38,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37792502] [2020-07-29 01:10:38,027 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-29 01:10:38,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:38,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:10:38,054 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:38,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:10:38,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:10:38,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:10:38,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:10:38,055 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 7 states. [2020-07-29 01:10:38,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:38,749 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2020-07-29 01:10:38,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:10:38,749 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-29 01:10:38,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:10:38,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:10:38,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 63 transitions. [2020-07-29 01:10:38,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:10:38,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 63 transitions. [2020-07-29 01:10:38,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 63 transitions. [2020-07-29 01:10:38,823 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:38,825 INFO L225 Difference]: With dead ends: 64 [2020-07-29 01:10:38,825 INFO L226 Difference]: Without dead ends: 64 [2020-07-29 01:10:38,826 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:10:38,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-07-29 01:10:38,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 44. [2020-07-29 01:10:38,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:10:38,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 44 states. [2020-07-29 01:10:38,835 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 44 states. [2020-07-29 01:10:38,836 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 44 states. [2020-07-29 01:10:38,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:38,838 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2020-07-29 01:10:38,838 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2020-07-29 01:10:38,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:38,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:38,839 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 64 states. [2020-07-29 01:10:38,839 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 64 states. [2020-07-29 01:10:38,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:38,841 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2020-07-29 01:10:38,841 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2020-07-29 01:10:38,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:38,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:38,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:10:38,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:10:38,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-29 01:10:38,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2020-07-29 01:10:38,844 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 19 [2020-07-29 01:10:38,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:10:38,845 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2020-07-29 01:10:38,845 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:10:38,845 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-07-29 01:10:38,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-29 01:10:38,846 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:38,846 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:38,846 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-29 01:10:38,846 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:10:38,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:38,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2137255130, now seen corresponding path program 1 times [2020-07-29 01:10:38,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:10:38,848 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552751939] [2020-07-29 01:10:38,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:10:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:39,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:10:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:39,064 INFO L280 TraceCheckUtils]: 0: Hoare triple {1819#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1808#true} is VALID [2020-07-29 01:10:39,065 INFO L280 TraceCheckUtils]: 1: Hoare triple {1808#true} assume true; {1808#true} is VALID [2020-07-29 01:10:39,065 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1808#true} {1808#true} #103#return; {1808#true} is VALID [2020-07-29 01:10:39,072 INFO L263 TraceCheckUtils]: 0: Hoare triple {1808#true} call ULTIMATE.init(); {1819#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:10:39,072 INFO L280 TraceCheckUtils]: 1: Hoare triple {1819#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1808#true} is VALID [2020-07-29 01:10:39,072 INFO L280 TraceCheckUtils]: 2: Hoare triple {1808#true} assume true; {1808#true} is VALID [2020-07-29 01:10:39,073 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1808#true} {1808#true} #103#return; {1808#true} is VALID [2020-07-29 01:10:39,073 INFO L263 TraceCheckUtils]: 4: Hoare triple {1808#true} call #t~ret8 := main(); {1808#true} is VALID [2020-07-29 01:10:39,082 INFO L280 TraceCheckUtils]: 5: Hoare triple {1808#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1813#(= 0 main_~a~0.offset)} is VALID [2020-07-29 01:10:39,082 INFO L280 TraceCheckUtils]: 6: Hoare triple {1813#(= 0 main_~a~0.offset)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1813#(= 0 main_~a~0.offset)} is VALID [2020-07-29 01:10:39,086 INFO L280 TraceCheckUtils]: 7: Hoare triple {1813#(= 0 main_~a~0.offset)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1814#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} is VALID [2020-07-29 01:10:39,086 INFO L280 TraceCheckUtils]: 8: Hoare triple {1814#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1814#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} is VALID [2020-07-29 01:10:39,087 INFO L280 TraceCheckUtils]: 9: Hoare triple {1814#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {1814#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} is VALID [2020-07-29 01:10:39,088 INFO L280 TraceCheckUtils]: 10: Hoare triple {1814#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L525-4 {1814#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} is VALID [2020-07-29 01:10:39,089 INFO L280 TraceCheckUtils]: 11: Hoare triple {1814#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} SUMMARY for call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4); srcloc: L532 {1815#(and (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4)) (= 0 main_~a~0.offset))} is VALID [2020-07-29 01:10:39,090 INFO L280 TraceCheckUtils]: 12: Hoare triple {1815#(and (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4)) (= 0 main_~a~0.offset))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1816#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-29 01:10:39,091 INFO L280 TraceCheckUtils]: 13: Hoare triple {1816#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !!(~p~0.base != 0 || ~p~0.offset != 0); {1816#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-29 01:10:39,092 INFO L280 TraceCheckUtils]: 14: Hoare triple {1816#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} SUMMARY for call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L536 {1816#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-29 01:10:39,093 INFO L280 TraceCheckUtils]: 15: Hoare triple {1816#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !(1 != #t~mem6);havoc #t~mem6; {1816#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-29 01:10:39,094 INFO L280 TraceCheckUtils]: 16: Hoare triple {1816#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); srcloc: L536-3 {1817#(and (= 0 |main_#t~mem7.base|) (= 0 |main_#t~mem7.offset|))} is VALID [2020-07-29 01:10:39,095 INFO L280 TraceCheckUtils]: 17: Hoare triple {1817#(and (= 0 |main_#t~mem7.base|) (= 0 |main_#t~mem7.offset|))} ~p~0.base, ~p~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {1818#(and (= 0 main_~p~0.offset) (= 0 main_~p~0.base))} is VALID [2020-07-29 01:10:39,096 INFO L280 TraceCheckUtils]: 18: Hoare triple {1818#(and (= 0 main_~p~0.offset) (= 0 main_~p~0.base))} assume !!(~p~0.base != 0 || ~p~0.offset != 0); {1809#false} is VALID [2020-07-29 01:10:39,096 INFO L280 TraceCheckUtils]: 19: Hoare triple {1809#false} assume !(1 == #valid[~p~0.base]); {1809#false} is VALID [2020-07-29 01:10:39,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:10:39,098 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552751939] [2020-07-29 01:10:39,098 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591711033] [2020-07-29 01:10:39,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-29 01:10:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:39,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 23 conjunts are in the unsatisfiable core [2020-07-29 01:10:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:39,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:10:39,391 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-29 01:10:39,392 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:39,404 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:39,407 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-29 01:10:39,408 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:39,414 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:39,415 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:39,415 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2020-07-29 01:10:39,512 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-29 01:10:39,512 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:39,522 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:39,528 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-29 01:10:39,529 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:39,534 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:39,534 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:39,535 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2020-07-29 01:10:39,538 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:10:39,538 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, main_~p~0.base, |#memory_$Pointer$.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (.cse1 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (and (= .cse0 |main_#t~mem7.base|) (= |main_#t~mem7.offset| .cse1) (= 0 .cse0) (= 0 .cse1))) [2020-07-29 01:10:39,538 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 |main_#t~mem7.base|) (= 0 |main_#t~mem7.offset|)) [2020-07-29 01:10:39,551 INFO L263 TraceCheckUtils]: 0: Hoare triple {1808#true} call ULTIMATE.init(); {1808#true} is VALID [2020-07-29 01:10:39,552 INFO L280 TraceCheckUtils]: 1: Hoare triple {1808#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1808#true} is VALID [2020-07-29 01:10:39,552 INFO L280 TraceCheckUtils]: 2: Hoare triple {1808#true} assume true; {1808#true} is VALID [2020-07-29 01:10:39,552 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1808#true} {1808#true} #103#return; {1808#true} is VALID [2020-07-29 01:10:39,552 INFO L263 TraceCheckUtils]: 4: Hoare triple {1808#true} call #t~ret8 := main(); {1808#true} is VALID [2020-07-29 01:10:39,557 INFO L280 TraceCheckUtils]: 5: Hoare triple {1808#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1838#(<= main_~a~0.offset 0)} is VALID [2020-07-29 01:10:39,558 INFO L280 TraceCheckUtils]: 6: Hoare triple {1838#(<= main_~a~0.offset 0)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1838#(<= main_~a~0.offset 0)} is VALID [2020-07-29 01:10:39,559 INFO L280 TraceCheckUtils]: 7: Hoare triple {1838#(<= main_~a~0.offset 0)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1845#(and (= main_~a~0.base main_~p~0.base) (<= main_~p~0.offset main_~a~0.offset) (<= main_~a~0.offset 0))} is VALID [2020-07-29 01:10:39,560 INFO L280 TraceCheckUtils]: 8: Hoare triple {1845#(and (= main_~a~0.base main_~p~0.base) (<= main_~p~0.offset main_~a~0.offset) (<= main_~a~0.offset 0))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1845#(and (= main_~a~0.base main_~p~0.base) (<= main_~p~0.offset main_~a~0.offset) (<= main_~a~0.offset 0))} is VALID [2020-07-29 01:10:39,561 INFO L280 TraceCheckUtils]: 9: Hoare triple {1845#(and (= main_~a~0.base main_~p~0.base) (<= main_~p~0.offset main_~a~0.offset) (<= main_~a~0.offset 0))} assume !(0 != #t~nondet3);havoc #t~nondet3; {1845#(and (= main_~a~0.base main_~p~0.base) (<= main_~p~0.offset main_~a~0.offset) (<= main_~a~0.offset 0))} is VALID [2020-07-29 01:10:39,563 INFO L280 TraceCheckUtils]: 10: Hoare triple {1845#(and (= main_~a~0.base main_~p~0.base) (<= main_~p~0.offset main_~a~0.offset) (<= main_~a~0.offset 0))} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L525-4 {1814#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} is VALID [2020-07-29 01:10:39,565 INFO L280 TraceCheckUtils]: 11: Hoare triple {1814#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} SUMMARY for call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4); srcloc: L532 {1815#(and (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4)) (= 0 main_~a~0.offset))} is VALID [2020-07-29 01:10:39,566 INFO L280 TraceCheckUtils]: 12: Hoare triple {1815#(and (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4)) (= 0 main_~a~0.offset))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1861#(and (<= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)) (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)))} is VALID [2020-07-29 01:10:39,568 INFO L280 TraceCheckUtils]: 13: Hoare triple {1861#(and (<= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)) (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)))} assume !!(~p~0.base != 0 || ~p~0.offset != 0); {1861#(and (<= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)) (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)))} is VALID [2020-07-29 01:10:39,569 INFO L280 TraceCheckUtils]: 14: Hoare triple {1861#(and (<= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)) (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)))} SUMMARY for call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L536 {1816#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-29 01:10:39,570 INFO L280 TraceCheckUtils]: 15: Hoare triple {1816#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !(1 != #t~mem6);havoc #t~mem6; {1816#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-29 01:10:39,571 INFO L280 TraceCheckUtils]: 16: Hoare triple {1816#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); srcloc: L536-3 {1817#(and (= 0 |main_#t~mem7.base|) (= 0 |main_#t~mem7.offset|))} is VALID [2020-07-29 01:10:39,572 INFO L280 TraceCheckUtils]: 17: Hoare triple {1817#(and (= 0 |main_#t~mem7.base|) (= 0 |main_#t~mem7.offset|))} ~p~0.base, ~p~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {1818#(and (= 0 main_~p~0.offset) (= 0 main_~p~0.base))} is VALID [2020-07-29 01:10:39,573 INFO L280 TraceCheckUtils]: 18: Hoare triple {1818#(and (= 0 main_~p~0.offset) (= 0 main_~p~0.base))} assume !!(~p~0.base != 0 || ~p~0.offset != 0); {1809#false} is VALID [2020-07-29 01:10:39,573 INFO L280 TraceCheckUtils]: 19: Hoare triple {1809#false} assume !(1 == #valid[~p~0.base]); {1809#false} is VALID [2020-07-29 01:10:39,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:10:39,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:10:39,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 12 [2020-07-29 01:10:39,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329389018] [2020-07-29 01:10:39,577 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2020-07-29 01:10:39,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:39,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-29 01:10:39,621 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:39,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-29 01:10:39,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:10:39,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-29 01:10:39,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:10:39,623 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 12 states. [2020-07-29 01:10:40,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:40,191 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-07-29 01:10:40,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:10:40,192 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2020-07-29 01:10:40,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:10:40,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:10:40,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2020-07-29 01:10:40,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:10:40,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2020-07-29 01:10:40,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 61 transitions. [2020-07-29 01:10:40,280 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:40,283 INFO L225 Difference]: With dead ends: 59 [2020-07-29 01:10:40,283 INFO L226 Difference]: Without dead ends: 59 [2020-07-29 01:10:40,284 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2020-07-29 01:10:40,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-29 01:10:40,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2020-07-29 01:10:40,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:10:40,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 47 states. [2020-07-29 01:10:40,287 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 47 states. [2020-07-29 01:10:40,287 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 47 states. [2020-07-29 01:10:40,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:40,290 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-07-29 01:10:40,290 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-07-29 01:10:40,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:40,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:40,291 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 59 states. [2020-07-29 01:10:40,291 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 59 states. [2020-07-29 01:10:40,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:40,293 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-07-29 01:10:40,293 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-07-29 01:10:40,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:40,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:40,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:10:40,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:10:40,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-29 01:10:40,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2020-07-29 01:10:40,296 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 20 [2020-07-29 01:10:40,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:10:40,297 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2020-07-29 01:10:40,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-29 01:10:40,297 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2020-07-29 01:10:40,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-29 01:10:40,297 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:40,298 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:40,513 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2020-07-29 01:10:40,513 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:10:40,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:40,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1830400864, now seen corresponding path program 1 times [2020-07-29 01:10:40,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:10:40,515 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449899367] [2020-07-29 01:10:40,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:10:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:10:40,528 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:10:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:10:40,536 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:10:40,558 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:10:40,558 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-29 01:10:40,559 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-29 01:10:40,573 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2020-07-29 01:10:40,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:10:40 BoogieIcfgContainer [2020-07-29 01:10:40,588 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:10:40,588 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:10:40,588 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:10:40,588 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:10:40,589 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:10:33" (3/4) ... [2020-07-29 01:10:40,595 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:10:40,595 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:10:40,599 INFO L168 Benchmark]: Toolchain (without parser) took 8431.61 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 309.9 MB). Free memory was 961.6 MB in the beginning and 1.0 GB in the end (delta: -55.0 MB). Peak memory consumption was 254.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:10:40,600 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:10:40,600 INFO L168 Benchmark]: CACSL2BoogieTranslator took 587.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -162.7 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:10:40,601 INFO L168 Benchmark]: Boogie Preprocessor took 73.32 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:10:40,602 INFO L168 Benchmark]: RCFGBuilder took 714.66 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: 58.5 MB). Peak memory consumption was 58.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:10:40,602 INFO L168 Benchmark]: TraceAbstraction took 7038.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 35.5 MB). Peak memory consumption was 209.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:10:40,603 INFO L168 Benchmark]: Witness Printer took 6.90 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:10:40,612 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 587.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -162.7 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.32 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 714.66 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: 58.5 MB). Peak memory consumption was 58.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7038.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 35.5 MB). Peak memory consumption was 209.0 MB. Max. memory is 11.5 GB. * Witness Printer took 6.90 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 520]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 520. Possible FailurePath: [L521] List a = (List) malloc(sizeof(struct node)); VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}] [L522] COND FALSE !(a == 0) VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}] [L523] List t; [L524] List p = a; VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L525] COND FALSE !(__VERIFIER_nondet_int()) [L532] p->h = 1 VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L533] p->n = 0 VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L534] p = a VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L535] COND TRUE p!=0 VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L536] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=1] [L536] COND FALSE !(p->h != 1) [L539] EXPR p->n VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->n={0:0}] [L539] p = p->n [L535] COND FALSE !(p!=0) VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={0:0}] [L541] return 0; VAL [\result=0, a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 66 locations, 16 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.9s, OverallIterations: 9, TraceHistogramMax: 2, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 233 SDtfs, 480 SDslu, 406 SDs, 0 SdLazy, 892 SolverSat, 85 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 98 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 164 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 12426 SizeOfPredicates, 12 NumberOfNonLiveVariables, 94 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 6/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: 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.25-8bd4bc6 [2020-07-29 01:10:42,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:10:42,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:10:42,799 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:10:42,799 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:10:42,800 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:10:42,802 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:10:42,804 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:10:42,805 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:10:42,806 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:10:42,807 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:10:42,814 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:10:42,814 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:10:42,815 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:10:42,817 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:10:42,819 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:10:42,820 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:10:42,823 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:10:42,828 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:10:42,831 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:10:42,832 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:10:42,836 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:10:42,841 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:10:42,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:10:42,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:10:42,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:10:42,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:10:42,850 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:10:42,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:10:42,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:10:42,852 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:10:42,853 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:10:42,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:10:42,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:10:42,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:10:42,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:10:42,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:10:42,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:10:42,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:10:42,861 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:10:42,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:10:42,864 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2020-07-29 01:10:42,895 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:10:42,896 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:10:42,897 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:10:42,898 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:10:42,898 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:10:42,898 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:10:42,898 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:10:42,899 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:10:42,899 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:10:42,899 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:10:42,900 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:10:42,900 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:10:42,901 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:10:42,901 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 01:10:42,901 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:10:42,901 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:10:42,902 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-29 01:10:42,902 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-29 01:10:42,902 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:10:42,903 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:10:42,904 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:10:42,906 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:10:42,906 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:10:42,906 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:10:42,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:10:42,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:10:42,908 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:10:42,909 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-29 01:10:42,909 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-29 01:10:42,909 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:10:42,909 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-29 01:10:42,909 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 17ff5ae56efea2deac29e7fa779d53a24810a7c7 [2020-07-29 01:10:43,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:10:43,296 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:10:43,299 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:10:43,301 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:10:43,302 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:10:43,303 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/simple-2.i [2020-07-29 01:10:43,360 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfbd1c767/7010f142dbdd497a9a6831b8da5a7f9c/FLAG97dd7b348 [2020-07-29 01:10:43,836 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:10:43,837 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple-2.i [2020-07-29 01:10:43,852 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfbd1c767/7010f142dbdd497a9a6831b8da5a7f9c/FLAG97dd7b348 [2020-07-29 01:10:44,164 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfbd1c767/7010f142dbdd497a9a6831b8da5a7f9c [2020-07-29 01:10:44,167 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:10:44,170 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:10:44,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:10:44,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:10:44,175 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:10:44,176 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:10:44" (1/1) ... [2020-07-29 01:10:44,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@719c97f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:44, skipping insertion in model container [2020-07-29 01:10:44,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:10:44" (1/1) ... [2020-07-29 01:10:44,187 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:10:44,227 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:10:44,594 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:10:44,610 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:10:44,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:10:44,718 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:10:44,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:44 WrapperNode [2020-07-29 01:10:44,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:10:44,719 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:10:44,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:10:44,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:10:44,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:44" (1/1) ... [2020-07-29 01:10:44,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:44" (1/1) ... [2020-07-29 01:10:44,752 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:44" (1/1) ... [2020-07-29 01:10:44,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:44" (1/1) ... [2020-07-29 01:10:44,778 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:44" (1/1) ... [2020-07-29 01:10:44,784 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:44" (1/1) ... [2020-07-29 01:10:44,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:44" (1/1) ... [2020-07-29 01:10:44,795 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:10:44,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:10:44,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:10:44,796 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:10:44,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-29 01:10:44,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:10:44,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:10:44,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2020-07-29 01:10:44,867 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-29 01:10:44,867 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-29 01:10:44,868 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-07-29 01:10:44,868 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-07-29 01:10:44,869 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-07-29 01:10:44,869 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-29 01:10:44,869 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:10:44,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-29 01:10:44,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-29 01:10:44,870 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-29 01:10:44,871 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-29 01:10:44,871 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-29 01:10:44,871 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-29 01:10:44,871 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-29 01:10:44,871 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-29 01:10:44,871 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-29 01:10:44,871 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-29 01:10:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-29 01:10:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-29 01:10:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-29 01:10:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-29 01:10:44,873 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-29 01:10:44,873 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-29 01:10:44,873 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-29 01:10:44,873 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-29 01:10:44,873 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-29 01:10:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-29 01:10:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-07-29 01:10:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-07-29 01:10:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-07-29 01:10:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-29 01:10:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-29 01:10:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-29 01:10:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-29 01:10:44,875 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-29 01:10:44,875 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-29 01:10:44,877 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-29 01:10:44,877 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-29 01:10:44,877 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-29 01:10:44,877 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-29 01:10:44,877 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-29 01:10:44,877 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-29 01:10:44,877 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-29 01:10:44,878 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-29 01:10:44,878 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-29 01:10:44,878 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-29 01:10:44,878 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-29 01:10:44,878 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-29 01:10:44,878 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-29 01:10:44,879 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-29 01:10:44,879 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-29 01:10:44,879 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-29 01:10:44,880 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-29 01:10:44,880 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-29 01:10:44,880 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-29 01:10:44,880 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-29 01:10:44,880 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-29 01:10:44,881 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-29 01:10:44,881 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-29 01:10:44,881 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-29 01:10:44,881 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-29 01:10:44,881 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-29 01:10:44,882 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-29 01:10:44,882 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-29 01:10:44,883 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-29 01:10:44,883 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-29 01:10:44,884 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-29 01:10:44,884 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-29 01:10:44,884 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-29 01:10:44,885 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-29 01:10:44,885 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-29 01:10:44,886 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-29 01:10:44,886 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-29 01:10:44,886 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-29 01:10:44,886 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-29 01:10:44,886 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-29 01:10:44,886 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-29 01:10:44,887 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-29 01:10:44,887 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-29 01:10:44,887 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-29 01:10:44,887 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-29 01:10:44,887 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-29 01:10:44,887 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-29 01:10:44,888 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-29 01:10:44,888 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-29 01:10:44,888 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-29 01:10:44,888 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-29 01:10:44,889 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-29 01:10:44,889 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-29 01:10:44,889 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-29 01:10:44,889 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-29 01:10:44,889 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-29 01:10:44,890 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-29 01:10:44,890 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-29 01:10:44,890 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-29 01:10:44,890 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-29 01:10:44,890 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-29 01:10:44,890 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-29 01:10:44,890 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-29 01:10:44,891 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-29 01:10:44,891 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-29 01:10:44,891 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-29 01:10:44,891 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-29 01:10:44,891 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-29 01:10:44,891 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-29 01:10:44,892 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-29 01:10:44,892 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-29 01:10:44,892 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-29 01:10:44,892 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-29 01:10:44,892 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-29 01:10:44,893 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-29 01:10:44,893 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-29 01:10:44,893 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-29 01:10:44,894 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-29 01:10:44,894 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-29 01:10:44,894 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-29 01:10:44,894 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-29 01:10:44,894 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:10:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:10:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-07-29 01:10:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-29 01:10:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-29 01:10:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-07-29 01:10:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:10:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:10:44,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2020-07-29 01:10:44,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:10:45,300 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-29 01:10:45,635 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:10:45,636 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-29 01:10:45,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:10:45 BoogieIcfgContainer [2020-07-29 01:10:45,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:10:45,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:10:45,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:10:45,646 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:10:45,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:10:44" (1/3) ... [2020-07-29 01:10:45,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e411cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:10:45, skipping insertion in model container [2020-07-29 01:10:45,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:10:44" (2/3) ... [2020-07-29 01:10:45,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e411cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:10:45, skipping insertion in model container [2020-07-29 01:10:45,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:10:45" (3/3) ... [2020-07-29 01:10:45,662 INFO L109 eAbstractionObserver]: Analyzing ICFG simple-2.i [2020-07-29 01:10:45,676 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:10:45,684 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2020-07-29 01:10:45,698 INFO L251 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2020-07-29 01:10:45,724 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:10:45,724 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:10:45,724 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:10:45,725 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:10:45,725 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:10:45,725 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:10:45,725 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:10:45,726 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:10:45,740 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2020-07-29 01:10:45,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-29 01:10:45,750 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:45,751 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:45,751 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:10:45,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:45,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1404783650, now seen corresponding path program 1 times [2020-07-29 01:10:45,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:10:45,770 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2067008804] [2020-07-29 01:10:45,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-07-29 01:10:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:45,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:10:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:45,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:10:46,034 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-29 01:10:46,036 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:46,049 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:46,049 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:46,050 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-07-29 01:10:46,054 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:10:46,054 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_27|]. (= |#valid| (store |v_#valid_27| main_~a~0.base (_ bv1 1))) [2020-07-29 01:10:46,055 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv1 1) (select |#valid| main_~a~0.base)) [2020-07-29 01:10:46,091 INFO L263 TraceCheckUtils]: 0: Hoare triple {52#true} call ULTIMATE.init(); {52#true} is VALID [2020-07-29 01:10:46,091 INFO L280 TraceCheckUtils]: 1: Hoare triple {52#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {52#true} is VALID [2020-07-29 01:10:46,092 INFO L280 TraceCheckUtils]: 2: Hoare triple {52#true} assume true; {52#true} is VALID [2020-07-29 01:10:46,092 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {52#true} {52#true} #124#return; {52#true} is VALID [2020-07-29 01:10:46,093 INFO L263 TraceCheckUtils]: 4: Hoare triple {52#true} call #t~ret8 := main(); {52#true} is VALID [2020-07-29 01:10:46,095 INFO L280 TraceCheckUtils]: 5: Hoare triple {52#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8bv32);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {72#(= (_ bv1 1) (select |#valid| main_~a~0.base))} is VALID [2020-07-29 01:10:46,096 INFO L280 TraceCheckUtils]: 6: Hoare triple {72#(= (_ bv1 1) (select |#valid| main_~a~0.base))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {72#(= (_ bv1 1) (select |#valid| main_~a~0.base))} is VALID [2020-07-29 01:10:46,097 INFO L280 TraceCheckUtils]: 7: Hoare triple {72#(= (_ bv1 1) (select |#valid| main_~a~0.base))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {79#(= (_ bv1 1) (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:10:46,098 INFO L280 TraceCheckUtils]: 8: Hoare triple {79#(= (_ bv1 1) (select |#valid| main_~p~0.base))} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {79#(= (_ bv1 1) (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:10:46,099 INFO L280 TraceCheckUtils]: 9: Hoare triple {79#(= (_ bv1 1) (select |#valid| main_~p~0.base))} assume !(1bv1 == #valid[~p~0.base]); {53#false} is VALID [2020-07-29 01:10:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:10:46,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:10:46,143 INFO L280 TraceCheckUtils]: 9: Hoare triple {79#(= (_ bv1 1) (select |#valid| main_~p~0.base))} assume !(1bv1 == #valid[~p~0.base]); {53#false} is VALID [2020-07-29 01:10:46,144 INFO L280 TraceCheckUtils]: 8: Hoare triple {79#(= (_ bv1 1) (select |#valid| main_~p~0.base))} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {79#(= (_ bv1 1) (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:10:46,145 INFO L280 TraceCheckUtils]: 7: Hoare triple {72#(= (_ bv1 1) (select |#valid| main_~a~0.base))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {79#(= (_ bv1 1) (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:10:46,146 INFO L280 TraceCheckUtils]: 6: Hoare triple {72#(= (_ bv1 1) (select |#valid| main_~a~0.base))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {72#(= (_ bv1 1) (select |#valid| main_~a~0.base))} is VALID [2020-07-29 01:10:46,148 INFO L280 TraceCheckUtils]: 5: Hoare triple {52#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8bv32);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {72#(= (_ bv1 1) (select |#valid| main_~a~0.base))} is VALID [2020-07-29 01:10:46,148 INFO L263 TraceCheckUtils]: 4: Hoare triple {52#true} call #t~ret8 := main(); {52#true} is VALID [2020-07-29 01:10:46,148 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {52#true} {52#true} #124#return; {52#true} is VALID [2020-07-29 01:10:46,149 INFO L280 TraceCheckUtils]: 2: Hoare triple {52#true} assume true; {52#true} is VALID [2020-07-29 01:10:46,149 INFO L280 TraceCheckUtils]: 1: Hoare triple {52#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {52#true} is VALID [2020-07-29 01:10:46,150 INFO L263 TraceCheckUtils]: 0: Hoare triple {52#true} call ULTIMATE.init(); {52#true} is VALID [2020-07-29 01:10:46,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:10:46,152 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2067008804] [2020-07-29 01:10:46,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:10:46,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-07-29 01:10:46,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150140359] [2020-07-29 01:10:46,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-29 01:10:46,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:46,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:10:46,186 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:46,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:10:46,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:10:46,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:10:46,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:10:46,200 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 4 states. [2020-07-29 01:10:46,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:46,621 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2020-07-29 01:10:46,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:10:46,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-29 01:10:46,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:10:46,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:10:46,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2020-07-29 01:10:46,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:10:46,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2020-07-29 01:10:46,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 74 transitions. [2020-07-29 01:10:46,781 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:46,794 INFO L225 Difference]: With dead ends: 57 [2020-07-29 01:10:46,794 INFO L226 Difference]: Without dead ends: 49 [2020-07-29 01:10:46,796 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:10:46,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-29 01:10:46,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2020-07-29 01:10:46,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:10:46,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 43 states. [2020-07-29 01:10:46,829 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 43 states. [2020-07-29 01:10:46,829 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 43 states. [2020-07-29 01:10:46,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:46,835 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2020-07-29 01:10:46,835 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-29 01:10:46,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:46,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:46,837 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 49 states. [2020-07-29 01:10:46,837 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 49 states. [2020-07-29 01:10:46,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:46,843 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2020-07-29 01:10:46,844 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-29 01:10:46,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:46,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:46,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:10:46,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:10:46,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-29 01:10:46,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2020-07-29 01:10:46,851 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 10 [2020-07-29 01:10:46,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:10:46,851 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2020-07-29 01:10:46,852 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:10:46,852 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2020-07-29 01:10:46,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-29 01:10:46,853 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:46,853 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:47,065 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-29 01:10:47,066 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:10:47,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:47,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1404783651, now seen corresponding path program 1 times [2020-07-29 01:10:47,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:10:47,069 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064905333] [2020-07-29 01:10:47,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-07-29 01:10:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:47,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:10:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:47,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:10:47,221 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-29 01:10:47,221 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:47,228 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:47,228 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:47,229 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-29 01:10:47,234 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:10:47,234 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_22|]. (and (= (_ bv0 32) main_~a~0.offset) (= (store |v_#length_22| main_~a~0.base (_ bv8 32)) |#length|)) [2020-07-29 01:10:47,234 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#length| main_~a~0.base) (_ bv8 32)) (= (_ bv0 32) main_~a~0.offset)) [2020-07-29 01:10:47,269 INFO L263 TraceCheckUtils]: 0: Hoare triple {315#true} call ULTIMATE.init(); {315#true} is VALID [2020-07-29 01:10:47,269 INFO L280 TraceCheckUtils]: 1: Hoare triple {315#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {315#true} is VALID [2020-07-29 01:10:47,269 INFO L280 TraceCheckUtils]: 2: Hoare triple {315#true} assume true; {315#true} is VALID [2020-07-29 01:10:47,270 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {315#true} {315#true} #124#return; {315#true} is VALID [2020-07-29 01:10:47,270 INFO L263 TraceCheckUtils]: 4: Hoare triple {315#true} call #t~ret8 := main(); {315#true} is VALID [2020-07-29 01:10:47,272 INFO L280 TraceCheckUtils]: 5: Hoare triple {315#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8bv32);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {335#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset))} is VALID [2020-07-29 01:10:47,273 INFO L280 TraceCheckUtils]: 6: Hoare triple {335#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {335#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset))} is VALID [2020-07-29 01:10:47,274 INFO L280 TraceCheckUtils]: 7: Hoare triple {335#(and (= (bvadd (select |#length| main_~a~0.base) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv0 32) main_~a~0.offset))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {342#(and (= (_ bv0 32) main_~p~0.offset) (= (_ bv8 32) (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:10:47,274 INFO L280 TraceCheckUtils]: 8: Hoare triple {342#(and (= (_ bv0 32) main_~p~0.offset) (= (_ bv8 32) (select |#length| main_~p~0.base)))} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {342#(and (= (_ bv0 32) main_~p~0.offset) (= (_ bv8 32) (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:10:47,276 INFO L280 TraceCheckUtils]: 9: Hoare triple {342#(and (= (_ bv0 32) main_~p~0.offset) (= (_ bv8 32) (select |#length| main_~p~0.base)))} assume !((~bvule32(~bvadd32(4bv32, ~p~0.offset), #length[~p~0.base]) && ~bvule32(~p~0.offset, ~bvadd32(4bv32, ~p~0.offset))) && ~bvule32(0bv32, ~p~0.offset)); {316#false} is VALID [2020-07-29 01:10:47,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:10:47,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:10:47,515 INFO L280 TraceCheckUtils]: 9: Hoare triple {349#(and (bvule (bvadd main_~p~0.offset (_ bv4 32)) (select |#length| main_~p~0.base)) (bvule main_~p~0.offset (bvadd main_~p~0.offset (_ bv4 32))))} assume !((~bvule32(~bvadd32(4bv32, ~p~0.offset), #length[~p~0.base]) && ~bvule32(~p~0.offset, ~bvadd32(4bv32, ~p~0.offset))) && ~bvule32(0bv32, ~p~0.offset)); {316#false} is VALID [2020-07-29 01:10:47,516 INFO L280 TraceCheckUtils]: 8: Hoare triple {349#(and (bvule (bvadd main_~p~0.offset (_ bv4 32)) (select |#length| main_~p~0.base)) (bvule main_~p~0.offset (bvadd main_~p~0.offset (_ bv4 32))))} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {349#(and (bvule (bvadd main_~p~0.offset (_ bv4 32)) (select |#length| main_~p~0.base)) (bvule main_~p~0.offset (bvadd main_~p~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:47,517 INFO L280 TraceCheckUtils]: 7: Hoare triple {356#(and (bvule (bvadd main_~a~0.offset (_ bv4 32)) (select |#length| main_~a~0.base)) (bvule main_~a~0.offset (bvadd main_~a~0.offset (_ bv4 32))))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {349#(and (bvule (bvadd main_~p~0.offset (_ bv4 32)) (select |#length| main_~p~0.base)) (bvule main_~p~0.offset (bvadd main_~p~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:47,518 INFO L280 TraceCheckUtils]: 6: Hoare triple {356#(and (bvule (bvadd main_~a~0.offset (_ bv4 32)) (select |#length| main_~a~0.base)) (bvule main_~a~0.offset (bvadd main_~a~0.offset (_ bv4 32))))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {356#(and (bvule (bvadd main_~a~0.offset (_ bv4 32)) (select |#length| main_~a~0.base)) (bvule main_~a~0.offset (bvadd main_~a~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:47,520 INFO L280 TraceCheckUtils]: 5: Hoare triple {315#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8bv32);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {356#(and (bvule (bvadd main_~a~0.offset (_ bv4 32)) (select |#length| main_~a~0.base)) (bvule main_~a~0.offset (bvadd main_~a~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:47,520 INFO L263 TraceCheckUtils]: 4: Hoare triple {315#true} call #t~ret8 := main(); {315#true} is VALID [2020-07-29 01:10:47,520 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {315#true} {315#true} #124#return; {315#true} is VALID [2020-07-29 01:10:47,521 INFO L280 TraceCheckUtils]: 2: Hoare triple {315#true} assume true; {315#true} is VALID [2020-07-29 01:10:47,521 INFO L280 TraceCheckUtils]: 1: Hoare triple {315#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {315#true} is VALID [2020-07-29 01:10:47,521 INFO L263 TraceCheckUtils]: 0: Hoare triple {315#true} call ULTIMATE.init(); {315#true} is VALID [2020-07-29 01:10:47,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:10:47,522 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064905333] [2020-07-29 01:10:47,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:10:47,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2020-07-29 01:10:47,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501143810] [2020-07-29 01:10:47,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-07-29 01:10:47,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:47,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:10:47,551 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:47,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:10:47,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:10:47,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:10:47,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:10:47,552 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 6 states. [2020-07-29 01:10:48,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:48,333 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2020-07-29 01:10:48,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:10:48,334 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-07-29 01:10:48,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:10:48,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:10:48,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2020-07-29 01:10:48,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:10:48,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2020-07-29 01:10:48,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2020-07-29 01:10:48,530 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:48,534 INFO L225 Difference]: With dead ends: 58 [2020-07-29 01:10:48,534 INFO L226 Difference]: Without dead ends: 58 [2020-07-29 01:10:48,535 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:10:48,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-29 01:10:48,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2020-07-29 01:10:48,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:10:48,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 50 states. [2020-07-29 01:10:48,539 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 50 states. [2020-07-29 01:10:48,540 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 50 states. [2020-07-29 01:10:48,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:48,543 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2020-07-29 01:10:48,543 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2020-07-29 01:10:48,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:48,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:48,545 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 58 states. [2020-07-29 01:10:48,545 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 58 states. [2020-07-29 01:10:48,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:48,548 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2020-07-29 01:10:48,548 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2020-07-29 01:10:48,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:48,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:48,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:10:48,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:10:48,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-29 01:10:48,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2020-07-29 01:10:48,553 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 10 [2020-07-29 01:10:48,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:10:48,553 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2020-07-29 01:10:48,553 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:10:48,553 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2020-07-29 01:10:48,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-29 01:10:48,554 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:48,554 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:48,765 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-29 01:10:48,766 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:10:48,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:48,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1238965195, now seen corresponding path program 1 times [2020-07-29 01:10:48,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:10:48,768 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2099511824] [2020-07-29 01:10:48,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-07-29 01:10:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:48,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:10:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:48,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:10:48,910 INFO L263 TraceCheckUtils]: 0: Hoare triple {608#true} call ULTIMATE.init(); {608#true} is VALID [2020-07-29 01:10:48,910 INFO L280 TraceCheckUtils]: 1: Hoare triple {608#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {608#true} is VALID [2020-07-29 01:10:48,910 INFO L280 TraceCheckUtils]: 2: Hoare triple {608#true} assume true; {608#true} is VALID [2020-07-29 01:10:48,911 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {608#true} {608#true} #124#return; {608#true} is VALID [2020-07-29 01:10:48,911 INFO L263 TraceCheckUtils]: 4: Hoare triple {608#true} call #t~ret8 := main(); {608#true} is VALID [2020-07-29 01:10:48,914 INFO L280 TraceCheckUtils]: 5: Hoare triple {608#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8bv32);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {628#(not (= main_~a~0.base (_ bv0 32)))} is VALID [2020-07-29 01:10:48,915 INFO L280 TraceCheckUtils]: 6: Hoare triple {628#(not (= main_~a~0.base (_ bv0 32)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {628#(not (= main_~a~0.base (_ bv0 32)))} is VALID [2020-07-29 01:10:48,916 INFO L280 TraceCheckUtils]: 7: Hoare triple {628#(not (= main_~a~0.base (_ bv0 32)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {628#(not (= main_~a~0.base (_ bv0 32)))} is VALID [2020-07-29 01:10:48,917 INFO L280 TraceCheckUtils]: 8: Hoare triple {628#(not (= main_~a~0.base (_ bv0 32)))} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {628#(not (= main_~a~0.base (_ bv0 32)))} is VALID [2020-07-29 01:10:48,918 INFO L280 TraceCheckUtils]: 9: Hoare triple {628#(not (= main_~a~0.base (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32); srcloc: L525-3 {628#(not (= main_~a~0.base (_ bv0 32)))} is VALID [2020-07-29 01:10:48,919 INFO L280 TraceCheckUtils]: 10: Hoare triple {628#(not (= main_~a~0.base (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); srcloc: L532 {628#(not (= main_~a~0.base (_ bv0 32)))} is VALID [2020-07-29 01:10:48,925 INFO L280 TraceCheckUtils]: 11: Hoare triple {628#(not (= main_~a~0.base (_ bv0 32)))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {647#(not (= main_~p~0.base (_ bv0 32)))} is VALID [2020-07-29 01:10:48,926 INFO L280 TraceCheckUtils]: 12: Hoare triple {647#(not (= main_~p~0.base (_ bv0 32)))} assume !(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); {609#false} is VALID [2020-07-29 01:10:48,926 INFO L280 TraceCheckUtils]: 13: Hoare triple {609#false} #res := 0bv32; {609#false} is VALID [2020-07-29 01:10:48,926 INFO L280 TraceCheckUtils]: 14: Hoare triple {609#false} assume !(#valid == old(#valid)); {609#false} is VALID [2020-07-29 01:10:48,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:10:48,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:10:48,962 INFO L280 TraceCheckUtils]: 14: Hoare triple {609#false} assume !(#valid == old(#valid)); {609#false} is VALID [2020-07-29 01:10:48,963 INFO L280 TraceCheckUtils]: 13: Hoare triple {609#false} #res := 0bv32; {609#false} is VALID [2020-07-29 01:10:48,963 INFO L280 TraceCheckUtils]: 12: Hoare triple {647#(not (= main_~p~0.base (_ bv0 32)))} assume !(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); {609#false} is VALID [2020-07-29 01:10:48,964 INFO L280 TraceCheckUtils]: 11: Hoare triple {628#(not (= main_~a~0.base (_ bv0 32)))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {647#(not (= main_~p~0.base (_ bv0 32)))} is VALID [2020-07-29 01:10:48,965 INFO L280 TraceCheckUtils]: 10: Hoare triple {628#(not (= main_~a~0.base (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); srcloc: L532 {628#(not (= main_~a~0.base (_ bv0 32)))} is VALID [2020-07-29 01:10:48,966 INFO L280 TraceCheckUtils]: 9: Hoare triple {628#(not (= main_~a~0.base (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32); srcloc: L525-3 {628#(not (= main_~a~0.base (_ bv0 32)))} is VALID [2020-07-29 01:10:48,969 INFO L280 TraceCheckUtils]: 8: Hoare triple {628#(not (= main_~a~0.base (_ bv0 32)))} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {628#(not (= main_~a~0.base (_ bv0 32)))} is VALID [2020-07-29 01:10:48,970 INFO L280 TraceCheckUtils]: 7: Hoare triple {628#(not (= main_~a~0.base (_ bv0 32)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {628#(not (= main_~a~0.base (_ bv0 32)))} is VALID [2020-07-29 01:10:48,971 INFO L280 TraceCheckUtils]: 6: Hoare triple {628#(not (= main_~a~0.base (_ bv0 32)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {628#(not (= main_~a~0.base (_ bv0 32)))} is VALID [2020-07-29 01:10:48,972 INFO L280 TraceCheckUtils]: 5: Hoare triple {608#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8bv32);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {628#(not (= main_~a~0.base (_ bv0 32)))} is VALID [2020-07-29 01:10:48,972 INFO L263 TraceCheckUtils]: 4: Hoare triple {608#true} call #t~ret8 := main(); {608#true} is VALID [2020-07-29 01:10:48,973 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {608#true} {608#true} #124#return; {608#true} is VALID [2020-07-29 01:10:48,973 INFO L280 TraceCheckUtils]: 2: Hoare triple {608#true} assume true; {608#true} is VALID [2020-07-29 01:10:48,973 INFO L280 TraceCheckUtils]: 1: Hoare triple {608#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {608#true} is VALID [2020-07-29 01:10:48,974 INFO L263 TraceCheckUtils]: 0: Hoare triple {608#true} call ULTIMATE.init(); {608#true} is VALID [2020-07-29 01:10:48,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:10:48,977 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2099511824] [2020-07-29 01:10:48,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:10:48,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-07-29 01:10:48,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999223347] [2020-07-29 01:10:48,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-07-29 01:10:48,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:48,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:10:49,008 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:49,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:10:49,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:10:49,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:10:49,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:10:49,009 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 4 states. [2020-07-29 01:10:49,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:49,358 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2020-07-29 01:10:49,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:10:49,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-07-29 01:10:49,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:10:49,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:10:49,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2020-07-29 01:10:49,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:10:49,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2020-07-29 01:10:49,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2020-07-29 01:10:49,482 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:49,484 INFO L225 Difference]: With dead ends: 55 [2020-07-29 01:10:49,484 INFO L226 Difference]: Without dead ends: 55 [2020-07-29 01:10:49,485 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:10:49,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-29 01:10:49,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2020-07-29 01:10:49,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:10:49,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 50 states. [2020-07-29 01:10:49,495 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 50 states. [2020-07-29 01:10:49,495 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 50 states. [2020-07-29 01:10:49,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:49,498 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2020-07-29 01:10:49,498 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2020-07-29 01:10:49,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:49,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:49,499 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 55 states. [2020-07-29 01:10:49,500 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 55 states. [2020-07-29 01:10:49,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:49,502 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2020-07-29 01:10:49,503 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2020-07-29 01:10:49,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:49,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:49,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:10:49,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:10:49,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-29 01:10:49,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2020-07-29 01:10:49,506 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 15 [2020-07-29 01:10:49,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:10:49,507 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2020-07-29 01:10:49,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:10:49,507 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2020-07-29 01:10:49,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-29 01:10:49,507 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:49,508 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:49,716 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-29 01:10:49,716 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:10:49,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:49,717 INFO L82 PathProgramCache]: Analyzing trace with hash 246825543, now seen corresponding path program 1 times [2020-07-29 01:10:49,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:10:49,719 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [115743661] [2020-07-29 01:10:49,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-07-29 01:10:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:49,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:10:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:49,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:10:49,871 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-29 01:10:49,871 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:49,878 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:49,879 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:49,879 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2020-07-29 01:10:49,930 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-07-29 01:10:49,931 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2020-07-29 01:10:49,933 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:49,936 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:49,937 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:49,937 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:7 [2020-07-29 01:10:49,982 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-29 01:10:49,982 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:49,985 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:49,985 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:49,985 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-07-29 01:10:49,988 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:10:49,988 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (= .cse0 |main_#t~mem6|) (= (_ bv1 32) .cse0))) [2020-07-29 01:10:49,989 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem6| (_ bv1 32)) [2020-07-29 01:10:50,006 INFO L263 TraceCheckUtils]: 0: Hoare triple {918#true} call ULTIMATE.init(); {918#true} is VALID [2020-07-29 01:10:50,006 INFO L280 TraceCheckUtils]: 1: Hoare triple {918#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {918#true} is VALID [2020-07-29 01:10:50,006 INFO L280 TraceCheckUtils]: 2: Hoare triple {918#true} assume true; {918#true} is VALID [2020-07-29 01:10:50,007 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {918#true} {918#true} #124#return; {918#true} is VALID [2020-07-29 01:10:50,007 INFO L263 TraceCheckUtils]: 4: Hoare triple {918#true} call #t~ret8 := main(); {918#true} is VALID [2020-07-29 01:10:50,007 INFO L280 TraceCheckUtils]: 5: Hoare triple {918#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8bv32);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {918#true} is VALID [2020-07-29 01:10:50,007 INFO L280 TraceCheckUtils]: 6: Hoare triple {918#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {918#true} is VALID [2020-07-29 01:10:50,010 INFO L280 TraceCheckUtils]: 7: Hoare triple {918#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {944#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2020-07-29 01:10:50,010 INFO L280 TraceCheckUtils]: 8: Hoare triple {944#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {944#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2020-07-29 01:10:50,013 INFO L280 TraceCheckUtils]: 9: Hoare triple {944#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} SUMMARY for call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32); srcloc: L525-3 {951#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2020-07-29 01:10:50,016 INFO L280 TraceCheckUtils]: 10: Hoare triple {951#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); srcloc: L532 {955#(= (bvadd (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-29 01:10:50,017 INFO L280 TraceCheckUtils]: 11: Hoare triple {955#(= (bvadd (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {959#(= (_ bv1 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-29 01:10:50,017 INFO L280 TraceCheckUtils]: 12: Hoare triple {959#(= (_ bv1 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); {959#(= (_ bv1 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-29 01:10:50,018 INFO L280 TraceCheckUtils]: 13: Hoare triple {959#(= (_ bv1 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem6 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); srcloc: L536 {966#(= (bvadd |main_#t~mem6| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-29 01:10:50,019 INFO L280 TraceCheckUtils]: 14: Hoare triple {966#(= (bvadd |main_#t~mem6| (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != #t~mem6;havoc #t~mem6; {919#false} is VALID [2020-07-29 01:10:50,019 INFO L280 TraceCheckUtils]: 15: Hoare triple {919#false} assume !false; {919#false} is VALID [2020-07-29 01:10:50,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:10:50,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:10:50,057 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 01:10:50,063 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:50,064 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 01:10:50,064 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2020-07-29 01:10:50,139 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 75 [2020-07-29 01:10:50,155 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:50,216 INFO L624 ElimStorePlain]: treesize reduction 34, result has 39.3 percent of original size [2020-07-29 01:10:50,221 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-29 01:10:50,221 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2020-07-29 01:10:50,228 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:10:50,228 WARN L407 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, v_DerPreprocessor_1]. (= (_ bv0 32) (bvadd (select (select (store |#memory_int| main_~p~0.base (store (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv1 32)) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_1)) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32))) [2020-07-29 01:10:50,229 WARN L408 uantifierElimination]: ElimStorePlain result: ∀ []. (and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset)) [2020-07-29 01:10:50,243 INFO L280 TraceCheckUtils]: 15: Hoare triple {919#false} assume !false; {919#false} is VALID [2020-07-29 01:10:50,244 INFO L280 TraceCheckUtils]: 14: Hoare triple {966#(= (bvadd |main_#t~mem6| (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != #t~mem6;havoc #t~mem6; {919#false} is VALID [2020-07-29 01:10:50,246 INFO L280 TraceCheckUtils]: 13: Hoare triple {959#(= (_ bv1 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem6 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); srcloc: L536 {966#(= (bvadd |main_#t~mem6| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-29 01:10:50,247 INFO L280 TraceCheckUtils]: 12: Hoare triple {959#(= (_ bv1 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); {959#(= (_ bv1 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-29 01:10:50,248 INFO L280 TraceCheckUtils]: 11: Hoare triple {955#(= (bvadd (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {959#(= (_ bv1 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-29 01:10:50,250 INFO L280 TraceCheckUtils]: 10: Hoare triple {988#(forall ((v_DerPreprocessor_1 (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_1)) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); srcloc: L532 {955#(= (bvadd (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-29 01:10:50,252 INFO L280 TraceCheckUtils]: 9: Hoare triple {944#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} SUMMARY for call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32); srcloc: L525-3 {988#(forall ((v_DerPreprocessor_1 (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_1)) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2020-07-29 01:10:50,253 INFO L280 TraceCheckUtils]: 8: Hoare triple {944#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {944#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2020-07-29 01:10:50,253 INFO L280 TraceCheckUtils]: 7: Hoare triple {918#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {944#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2020-07-29 01:10:50,254 INFO L280 TraceCheckUtils]: 6: Hoare triple {918#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {918#true} is VALID [2020-07-29 01:10:50,254 INFO L280 TraceCheckUtils]: 5: Hoare triple {918#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8bv32);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {918#true} is VALID [2020-07-29 01:10:50,254 INFO L263 TraceCheckUtils]: 4: Hoare triple {918#true} call #t~ret8 := main(); {918#true} is VALID [2020-07-29 01:10:50,254 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {918#true} {918#true} #124#return; {918#true} is VALID [2020-07-29 01:10:50,255 INFO L280 TraceCheckUtils]: 2: Hoare triple {918#true} assume true; {918#true} is VALID [2020-07-29 01:10:50,255 INFO L280 TraceCheckUtils]: 1: Hoare triple {918#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {918#true} is VALID [2020-07-29 01:10:50,255 INFO L263 TraceCheckUtils]: 0: Hoare triple {918#true} call ULTIMATE.init(); {918#true} is VALID [2020-07-29 01:10:50,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:10:50,256 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [115743661] [2020-07-29 01:10:50,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:10:50,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2020-07-29 01:10:50,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180260681] [2020-07-29 01:10:50,257 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-07-29 01:10:50,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:50,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:10:50,285 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:50,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-29 01:10:50,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:10:50,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:10:50,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:10:50,286 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 8 states. [2020-07-29 01:10:51,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:51,329 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2020-07-29 01:10:51,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:10:51,329 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-07-29 01:10:51,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:10:51,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:10:51,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2020-07-29 01:10:51,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:10:51,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2020-07-29 01:10:51,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 90 transitions. [2020-07-29 01:10:51,493 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:51,497 INFO L225 Difference]: With dead ends: 86 [2020-07-29 01:10:51,497 INFO L226 Difference]: Without dead ends: 86 [2020-07-29 01:10:51,498 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:10:51,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-29 01:10:51,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 54. [2020-07-29 01:10:51,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:10:51,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 54 states. [2020-07-29 01:10:51,503 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 54 states. [2020-07-29 01:10:51,503 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 54 states. [2020-07-29 01:10:51,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:51,507 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2020-07-29 01:10:51,507 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2020-07-29 01:10:51,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:51,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:51,508 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 86 states. [2020-07-29 01:10:51,508 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 86 states. [2020-07-29 01:10:51,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:51,512 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2020-07-29 01:10:51,512 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2020-07-29 01:10:51,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:51,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:51,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:10:51,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:10:51,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-29 01:10:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2020-07-29 01:10:51,516 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 16 [2020-07-29 01:10:51,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:10:51,516 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2020-07-29 01:10:51,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-29 01:10:51,517 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2020-07-29 01:10:51,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-29 01:10:51,517 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:51,517 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:51,728 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-07-29 01:10:51,729 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:10:51,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:51,730 INFO L82 PathProgramCache]: Analyzing trace with hash -199427220, now seen corresponding path program 1 times [2020-07-29 01:10:51,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:10:51,731 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810552184] [2020-07-29 01:10:51,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-07-29 01:10:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:51,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:10:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:51,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:10:51,838 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-29 01:10:51,838 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:51,840 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:51,840 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:51,841 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-07-29 01:10:51,844 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:10:51,844 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_43|]. (= |#valid| (store |v_#valid_43| main_~t~0.base (_ bv1 1))) [2020-07-29 01:10:51,844 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#valid| main_~t~0.base) (_ bv1 1)) [2020-07-29 01:10:51,865 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-07-29 01:10:51,865 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:51,890 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:51,891 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:51,892 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:13 [2020-07-29 01:10:51,904 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:10:51,904 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_17|, main_~t~0.base]. (and (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)) (= (store |v_#memory_$Pointer$.base_17| main_~p~0.base (store (select |v_#memory_$Pointer$.base_17| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) main_~t~0.base)) |#memory_$Pointer$.base|)) [2020-07-29 01:10:51,905 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv1 1))) [2020-07-29 01:10:51,937 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2020-07-29 01:10:51,938 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:51,941 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:51,941 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:51,941 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2020-07-29 01:10:51,944 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:10:51,944 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, main_~p~0.base, main_~p~0.offset]. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (and (= (_ bv1 1) (select |#valid| .cse0)) (= .cse0 |main_#t~mem5.base|))) [2020-07-29 01:10:51,944 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv1 1) (select |#valid| |main_#t~mem5.base|)) [2020-07-29 01:10:51,971 INFO L263 TraceCheckUtils]: 0: Hoare triple {1337#true} call ULTIMATE.init(); {1337#true} is VALID [2020-07-29 01:10:51,971 INFO L280 TraceCheckUtils]: 1: Hoare triple {1337#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {1337#true} is VALID [2020-07-29 01:10:51,971 INFO L280 TraceCheckUtils]: 2: Hoare triple {1337#true} assume true; {1337#true} is VALID [2020-07-29 01:10:51,971 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1337#true} {1337#true} #124#return; {1337#true} is VALID [2020-07-29 01:10:51,972 INFO L263 TraceCheckUtils]: 4: Hoare triple {1337#true} call #t~ret8 := main(); {1337#true} is VALID [2020-07-29 01:10:51,972 INFO L280 TraceCheckUtils]: 5: Hoare triple {1337#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8bv32);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1337#true} is VALID [2020-07-29 01:10:51,972 INFO L280 TraceCheckUtils]: 6: Hoare triple {1337#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {1337#true} is VALID [2020-07-29 01:10:51,972 INFO L280 TraceCheckUtils]: 7: Hoare triple {1337#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1337#true} is VALID [2020-07-29 01:10:51,973 INFO L280 TraceCheckUtils]: 8: Hoare triple {1337#true} assume !!(0bv32 != #t~nondet3);havoc #t~nondet3; {1337#true} is VALID [2020-07-29 01:10:51,973 INFO L280 TraceCheckUtils]: 9: Hoare triple {1337#true} SUMMARY for call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32); srcloc: L526 {1337#true} is VALID [2020-07-29 01:10:51,977 INFO L280 TraceCheckUtils]: 10: Hoare triple {1337#true} call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnHeap(8bv32);~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {1372#(= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:10:51,977 INFO L280 TraceCheckUtils]: 11: Hoare triple {1372#(= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1372#(= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:10:51,981 INFO L280 TraceCheckUtils]: 12: Hoare triple {1372#(= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1))} SUMMARY for call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); srcloc: L528-3 {1379#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} is VALID [2020-07-29 01:10:51,982 INFO L280 TraceCheckUtils]: 13: Hoare triple {1379#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); srcloc: L529 {1383#(= (_ bv1 1) (select |#valid| |main_#t~mem5.base|))} is VALID [2020-07-29 01:10:51,983 INFO L280 TraceCheckUtils]: 14: Hoare triple {1383#(= (_ bv1 1) (select |#valid| |main_#t~mem5.base|))} ~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1387#(= (_ bv1 1) (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:10:51,983 INFO L280 TraceCheckUtils]: 15: Hoare triple {1387#(= (_ bv1 1) (select |#valid| main_~p~0.base))} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {1387#(= (_ bv1 1) (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:10:51,984 INFO L280 TraceCheckUtils]: 16: Hoare triple {1387#(= (_ bv1 1) (select |#valid| main_~p~0.base))} assume !(1bv1 == #valid[~p~0.base]); {1338#false} is VALID [2020-07-29 01:10:51,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:10:51,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:10:52,036 INFO L280 TraceCheckUtils]: 16: Hoare triple {1387#(= (_ bv1 1) (select |#valid| main_~p~0.base))} assume !(1bv1 == #valid[~p~0.base]); {1338#false} is VALID [2020-07-29 01:10:52,037 INFO L280 TraceCheckUtils]: 15: Hoare triple {1387#(= (_ bv1 1) (select |#valid| main_~p~0.base))} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {1387#(= (_ bv1 1) (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:10:52,038 INFO L280 TraceCheckUtils]: 14: Hoare triple {1383#(= (_ bv1 1) (select |#valid| |main_#t~mem5.base|))} ~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1387#(= (_ bv1 1) (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:10:52,039 INFO L280 TraceCheckUtils]: 13: Hoare triple {1379#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); srcloc: L529 {1383#(= (_ bv1 1) (select |#valid| |main_#t~mem5.base|))} is VALID [2020-07-29 01:10:52,042 INFO L280 TraceCheckUtils]: 12: Hoare triple {1372#(= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1))} SUMMARY for call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); srcloc: L528-3 {1379#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} is VALID [2020-07-29 01:10:52,043 INFO L280 TraceCheckUtils]: 11: Hoare triple {1372#(= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1372#(= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:10:52,060 INFO L280 TraceCheckUtils]: 10: Hoare triple {1337#true} call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnHeap(8bv32);~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {1372#(= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:10:52,061 INFO L280 TraceCheckUtils]: 9: Hoare triple {1337#true} SUMMARY for call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32); srcloc: L526 {1337#true} is VALID [2020-07-29 01:10:52,061 INFO L280 TraceCheckUtils]: 8: Hoare triple {1337#true} assume !!(0bv32 != #t~nondet3);havoc #t~nondet3; {1337#true} is VALID [2020-07-29 01:10:52,061 INFO L280 TraceCheckUtils]: 7: Hoare triple {1337#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1337#true} is VALID [2020-07-29 01:10:52,062 INFO L280 TraceCheckUtils]: 6: Hoare triple {1337#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {1337#true} is VALID [2020-07-29 01:10:52,062 INFO L280 TraceCheckUtils]: 5: Hoare triple {1337#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8bv32);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1337#true} is VALID [2020-07-29 01:10:52,062 INFO L263 TraceCheckUtils]: 4: Hoare triple {1337#true} call #t~ret8 := main(); {1337#true} is VALID [2020-07-29 01:10:52,063 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1337#true} {1337#true} #124#return; {1337#true} is VALID [2020-07-29 01:10:52,063 INFO L280 TraceCheckUtils]: 2: Hoare triple {1337#true} assume true; {1337#true} is VALID [2020-07-29 01:10:52,063 INFO L280 TraceCheckUtils]: 1: Hoare triple {1337#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {1337#true} is VALID [2020-07-29 01:10:52,063 INFO L263 TraceCheckUtils]: 0: Hoare triple {1337#true} call ULTIMATE.init(); {1337#true} is VALID [2020-07-29 01:10:52,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:10:52,065 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810552184] [2020-07-29 01:10:52,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:10:52,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2020-07-29 01:10:52,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098066513] [2020-07-29 01:10:52,066 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-29 01:10:52,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:52,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:10:52,092 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:52,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:10:52,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:10:52,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:10:52,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:10:52,094 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 6 states. [2020-07-29 01:10:53,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:53,032 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2020-07-29 01:10:53,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:10:53,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-29 01:10:53,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:10:53,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:10:53,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2020-07-29 01:10:53,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:10:53,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2020-07-29 01:10:53,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2020-07-29 01:10:53,136 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:53,139 INFO L225 Difference]: With dead ends: 66 [2020-07-29 01:10:53,139 INFO L226 Difference]: Without dead ends: 66 [2020-07-29 01:10:53,140 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:10:53,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-29 01:10:53,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2020-07-29 01:10:53,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:10:53,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 52 states. [2020-07-29 01:10:53,150 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 52 states. [2020-07-29 01:10:53,150 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 52 states. [2020-07-29 01:10:53,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:53,154 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2020-07-29 01:10:53,154 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2020-07-29 01:10:53,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:53,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:53,157 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 66 states. [2020-07-29 01:10:53,158 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 66 states. [2020-07-29 01:10:53,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:53,164 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2020-07-29 01:10:53,164 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2020-07-29 01:10:53,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:53,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:53,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:10:53,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:10:53,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-29 01:10:53,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2020-07-29 01:10:53,172 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 17 [2020-07-29 01:10:53,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:10:53,173 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2020-07-29 01:10:53,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:10:53,173 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2020-07-29 01:10:53,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-29 01:10:53,174 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:53,174 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:53,386 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-07-29 01:10:53,387 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:10:53,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:53,388 INFO L82 PathProgramCache]: Analyzing trace with hash -199427219, now seen corresponding path program 1 times [2020-07-29 01:10:53,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:10:53,389 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738959405] [2020-07-29 01:10:53,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-07-29 01:10:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:53,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:10:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:53,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:10:53,497 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-29 01:10:53,497 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:53,502 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:53,502 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:53,502 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-29 01:10:53,507 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:10:53,507 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_26|]. (and (= (store |v_#length_26| main_~t~0.base (_ bv8 32)) |#length|) (= (_ bv0 32) main_~t~0.offset)) [2020-07-29 01:10:53,508 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#length| main_~t~0.base) (_ bv8 32)) (= (_ bv0 32) main_~t~0.offset)) [2020-07-29 01:10:53,539 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-07-29 01:10:53,539 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:53,551 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:53,557 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-07-29 01:10:53,558 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:53,567 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:53,568 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:53,569 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2020-07-29 01:10:53,603 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:10:53,603 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_19|, main_~t~0.base, |v_#memory_$Pointer$.offset_18|]. (let ((.cse0 (bvadd main_~p~0.offset (_ bv4 32)))) (and (= (bvadd (select |#length| main_~t~0.base) (_ bv4294967288 32)) (_ bv0 32)) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_18| main_~p~0.base (store (select |v_#memory_$Pointer$.offset_18| main_~p~0.base) .cse0 (_ bv0 32)))) (= (store |v_#memory_$Pointer$.base_19| main_~p~0.base (store (select |v_#memory_$Pointer$.base_19| main_~p~0.base) .cse0 main_~t~0.base)) |#memory_$Pointer$.base|))) [2020-07-29 01:10:53,604 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (bvadd main_~p~0.offset (_ bv4 32)))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~p~0.base) .cse0)) (= (bvadd (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) .cse0)) (_ bv4294967288 32)) (_ bv0 32)))) [2020-07-29 01:10:53,644 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2020-07-29 01:10:53,645 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:53,656 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:53,660 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2020-07-29 01:10:53,661 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:53,667 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:53,667 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:53,668 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2020-07-29 01:10:53,672 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:10:53,673 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.offset|, main_~p~0.base, main_~p~0.offset, |#memory_$Pointer$.base|]. (let ((.cse2 (bvadd main_~p~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) .cse2)) (.cse1 (select (select |#memory_$Pointer$.base| main_~p~0.base) .cse2))) (and (= .cse0 |main_#t~mem5.offset|) (= .cse1 |main_#t~mem5.base|) (= (_ bv0 32) .cse0) (= (bvadd (select |#length| .cse1) (_ bv4294967288 32)) (_ bv0 32))))) [2020-07-29 01:10:53,673 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (bvadd (select |#length| |main_#t~mem5.base|) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv0 32) |main_#t~mem5.offset|)) [2020-07-29 01:10:53,712 INFO L263 TraceCheckUtils]: 0: Hoare triple {1701#true} call ULTIMATE.init(); {1701#true} is VALID [2020-07-29 01:10:53,712 INFO L280 TraceCheckUtils]: 1: Hoare triple {1701#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {1701#true} is VALID [2020-07-29 01:10:53,713 INFO L280 TraceCheckUtils]: 2: Hoare triple {1701#true} assume true; {1701#true} is VALID [2020-07-29 01:10:53,713 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1701#true} {1701#true} #124#return; {1701#true} is VALID [2020-07-29 01:10:53,713 INFO L263 TraceCheckUtils]: 4: Hoare triple {1701#true} call #t~ret8 := main(); {1701#true} is VALID [2020-07-29 01:10:53,714 INFO L280 TraceCheckUtils]: 5: Hoare triple {1701#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8bv32);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1701#true} is VALID [2020-07-29 01:10:53,714 INFO L280 TraceCheckUtils]: 6: Hoare triple {1701#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {1701#true} is VALID [2020-07-29 01:10:53,714 INFO L280 TraceCheckUtils]: 7: Hoare triple {1701#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1701#true} is VALID [2020-07-29 01:10:53,715 INFO L280 TraceCheckUtils]: 8: Hoare triple {1701#true} assume !!(0bv32 != #t~nondet3);havoc #t~nondet3; {1701#true} is VALID [2020-07-29 01:10:53,715 INFO L280 TraceCheckUtils]: 9: Hoare triple {1701#true} SUMMARY for call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32); srcloc: L526 {1701#true} is VALID [2020-07-29 01:10:53,719 INFO L280 TraceCheckUtils]: 10: Hoare triple {1701#true} call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnHeap(8bv32);~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {1736#(and (= (bvadd (select |#length| main_~t~0.base) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv0 32) main_~t~0.offset))} is VALID [2020-07-29 01:10:53,720 INFO L280 TraceCheckUtils]: 11: Hoare triple {1736#(and (= (bvadd (select |#length| main_~t~0.base) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv0 32) main_~t~0.offset))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1736#(and (= (bvadd (select |#length| main_~t~0.base) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv0 32) main_~t~0.offset))} is VALID [2020-07-29 01:10:53,722 INFO L280 TraceCheckUtils]: 12: Hoare triple {1736#(and (= (bvadd (select |#length| main_~t~0.base) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv0 32) main_~t~0.offset))} SUMMARY for call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); srcloc: L528-3 {1743#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (bvadd (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967288 32)) (_ bv0 32)))} is VALID [2020-07-29 01:10:53,723 INFO L280 TraceCheckUtils]: 13: Hoare triple {1743#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (bvadd (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967288 32)) (_ bv0 32)))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); srcloc: L529 {1747#(and (= (bvadd (select |#length| |main_#t~mem5.base|) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv0 32) |main_#t~mem5.offset|))} is VALID [2020-07-29 01:10:53,724 INFO L280 TraceCheckUtils]: 14: Hoare triple {1747#(and (= (bvadd (select |#length| |main_#t~mem5.base|) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv0 32) |main_#t~mem5.offset|))} ~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1751#(and (= (_ bv0 32) main_~p~0.offset) (= (_ bv8 32) (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:10:53,726 INFO L280 TraceCheckUtils]: 15: Hoare triple {1751#(and (= (_ bv0 32) main_~p~0.offset) (= (_ bv8 32) (select |#length| main_~p~0.base)))} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {1751#(and (= (_ bv0 32) main_~p~0.offset) (= (_ bv8 32) (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:10:53,731 INFO L280 TraceCheckUtils]: 16: Hoare triple {1751#(and (= (_ bv0 32) main_~p~0.offset) (= (_ bv8 32) (select |#length| main_~p~0.base)))} assume !((~bvule32(~bvadd32(4bv32, ~p~0.offset), #length[~p~0.base]) && ~bvule32(~p~0.offset, ~bvadd32(4bv32, ~p~0.offset))) && ~bvule32(0bv32, ~p~0.offset)); {1702#false} is VALID [2020-07-29 01:10:53,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:10:53,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:10:54,199 INFO L280 TraceCheckUtils]: 16: Hoare triple {1758#(and (bvule (bvadd main_~p~0.offset (_ bv4 32)) (select |#length| main_~p~0.base)) (bvule main_~p~0.offset (bvadd main_~p~0.offset (_ bv4 32))))} assume !((~bvule32(~bvadd32(4bv32, ~p~0.offset), #length[~p~0.base]) && ~bvule32(~p~0.offset, ~bvadd32(4bv32, ~p~0.offset))) && ~bvule32(0bv32, ~p~0.offset)); {1702#false} is VALID [2020-07-29 01:10:54,200 INFO L280 TraceCheckUtils]: 15: Hoare triple {1758#(and (bvule (bvadd main_~p~0.offset (_ bv4 32)) (select |#length| main_~p~0.base)) (bvule main_~p~0.offset (bvadd main_~p~0.offset (_ bv4 32))))} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {1758#(and (bvule (bvadd main_~p~0.offset (_ bv4 32)) (select |#length| main_~p~0.base)) (bvule main_~p~0.offset (bvadd main_~p~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:54,200 INFO L280 TraceCheckUtils]: 14: Hoare triple {1765#(and (bvule |main_#t~mem5.offset| (bvadd |main_#t~mem5.offset| (_ bv4 32))) (bvule (bvadd |main_#t~mem5.offset| (_ bv4 32)) (select |#length| |main_#t~mem5.base|)))} ~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1758#(and (bvule (bvadd main_~p~0.offset (_ bv4 32)) (select |#length| main_~p~0.base)) (bvule main_~p~0.offset (bvadd main_~p~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:54,201 INFO L280 TraceCheckUtils]: 13: Hoare triple {1769#(and (bvule (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)) (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (bvule (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32))))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); srcloc: L529 {1765#(and (bvule |main_#t~mem5.offset| (bvadd |main_#t~mem5.offset| (_ bv4 32))) (bvule (bvadd |main_#t~mem5.offset| (_ bv4 32)) (select |#length| |main_#t~mem5.base|)))} is VALID [2020-07-29 01:10:54,223 INFO L280 TraceCheckUtils]: 12: Hoare triple {1773#(and (bvule main_~t~0.offset (bvadd main_~t~0.offset (_ bv4 32))) (bvule (bvadd main_~t~0.offset (_ bv4 32)) (select |#length| main_~t~0.base)))} SUMMARY for call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); srcloc: L528-3 {1769#(and (bvule (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)) (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (bvule (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32))))} is VALID [2020-07-29 01:10:54,223 INFO L280 TraceCheckUtils]: 11: Hoare triple {1773#(and (bvule main_~t~0.offset (bvadd main_~t~0.offset (_ bv4 32))) (bvule (bvadd main_~t~0.offset (_ bv4 32)) (select |#length| main_~t~0.base)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1773#(and (bvule main_~t~0.offset (bvadd main_~t~0.offset (_ bv4 32))) (bvule (bvadd main_~t~0.offset (_ bv4 32)) (select |#length| main_~t~0.base)))} is VALID [2020-07-29 01:10:54,225 INFO L280 TraceCheckUtils]: 10: Hoare triple {1701#true} call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnHeap(8bv32);~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {1773#(and (bvule main_~t~0.offset (bvadd main_~t~0.offset (_ bv4 32))) (bvule (bvadd main_~t~0.offset (_ bv4 32)) (select |#length| main_~t~0.base)))} is VALID [2020-07-29 01:10:54,225 INFO L280 TraceCheckUtils]: 9: Hoare triple {1701#true} SUMMARY for call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32); srcloc: L526 {1701#true} is VALID [2020-07-29 01:10:54,225 INFO L280 TraceCheckUtils]: 8: Hoare triple {1701#true} assume !!(0bv32 != #t~nondet3);havoc #t~nondet3; {1701#true} is VALID [2020-07-29 01:10:54,225 INFO L280 TraceCheckUtils]: 7: Hoare triple {1701#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1701#true} is VALID [2020-07-29 01:10:54,226 INFO L280 TraceCheckUtils]: 6: Hoare triple {1701#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {1701#true} is VALID [2020-07-29 01:10:54,226 INFO L280 TraceCheckUtils]: 5: Hoare triple {1701#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8bv32);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1701#true} is VALID [2020-07-29 01:10:54,226 INFO L263 TraceCheckUtils]: 4: Hoare triple {1701#true} call #t~ret8 := main(); {1701#true} is VALID [2020-07-29 01:10:54,226 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1701#true} {1701#true} #124#return; {1701#true} is VALID [2020-07-29 01:10:54,226 INFO L280 TraceCheckUtils]: 2: Hoare triple {1701#true} assume true; {1701#true} is VALID [2020-07-29 01:10:54,226 INFO L280 TraceCheckUtils]: 1: Hoare triple {1701#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {1701#true} is VALID [2020-07-29 01:10:54,227 INFO L263 TraceCheckUtils]: 0: Hoare triple {1701#true} call ULTIMATE.init(); {1701#true} is VALID [2020-07-29 01:10:54,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:10:54,228 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738959405] [2020-07-29 01:10:54,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:10:54,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2020-07-29 01:10:54,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025830379] [2020-07-29 01:10:54,229 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2020-07-29 01:10:54,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:54,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:10:54,298 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:54,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-29 01:10:54,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:10:54,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:10:54,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:10:54,299 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 10 states. [2020-07-29 01:10:56,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:56,464 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2020-07-29 01:10:56,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:10:56,464 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2020-07-29 01:10:56,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:10:56,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:10:56,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2020-07-29 01:10:56,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:10:56,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2020-07-29 01:10:56,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 61 transitions. [2020-07-29 01:10:56,589 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:56,590 INFO L225 Difference]: With dead ends: 62 [2020-07-29 01:10:56,591 INFO L226 Difference]: Without dead ends: 62 [2020-07-29 01:10:56,591 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2020-07-29 01:10:56,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-29 01:10:56,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 42. [2020-07-29 01:10:56,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:10:56,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 42 states. [2020-07-29 01:10:56,595 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 42 states. [2020-07-29 01:10:56,595 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 42 states. [2020-07-29 01:10:56,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:56,597 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2020-07-29 01:10:56,598 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2020-07-29 01:10:56,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:56,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:56,598 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 62 states. [2020-07-29 01:10:56,598 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 62 states. [2020-07-29 01:10:56,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:56,601 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2020-07-29 01:10:56,601 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2020-07-29 01:10:56,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:56,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:56,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:10:56,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:10:56,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-29 01:10:56,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2020-07-29 01:10:56,603 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 17 [2020-07-29 01:10:56,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:10:56,604 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2020-07-29 01:10:56,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-29 01:10:56,604 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2020-07-29 01:10:56,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-29 01:10:56,604 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:56,604 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:56,820 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-07-29 01:10:56,822 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:10:56,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:56,823 INFO L82 PathProgramCache]: Analyzing trace with hash 200611076, now seen corresponding path program 1 times [2020-07-29 01:10:56,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:10:56,824 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135643523] [2020-07-29 01:10:56,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-07-29 01:10:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:56,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:10:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:56,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:10:56,963 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-07-29 01:10:56,963 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:56,973 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:56,977 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-07-29 01:10:56,977 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:56,985 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:56,986 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:56,986 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2020-07-29 01:10:57,055 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2020-07-29 01:10:57,055 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:57,064 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:57,072 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2020-07-29 01:10:57,072 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:57,088 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:57,088 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:57,089 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2020-07-29 01:10:57,093 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:10:57,093 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.offset|, main_~p~0.base, main_~p~0.offset, |#memory_$Pointer$.base|]. (let ((.cse2 (bvadd main_~p~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) .cse2)) (.cse1 (select (select |#memory_$Pointer$.base| main_~p~0.base) .cse2))) (and (= .cse0 |main_#t~mem7.offset|) (= (_ bv0 32) .cse0) (= .cse1 |main_#t~mem7.base|) (= .cse1 (_ bv0 32))))) [2020-07-29 01:10:57,093 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_#t~mem7.base| (_ bv0 32)) (= (_ bv0 32) |main_#t~mem7.offset|)) [2020-07-29 01:10:57,133 INFO L263 TraceCheckUtils]: 0: Hoare triple {2053#true} call ULTIMATE.init(); {2053#true} is VALID [2020-07-29 01:10:57,133 INFO L280 TraceCheckUtils]: 1: Hoare triple {2053#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {2053#true} is VALID [2020-07-29 01:10:57,133 INFO L280 TraceCheckUtils]: 2: Hoare triple {2053#true} assume true; {2053#true} is VALID [2020-07-29 01:10:57,134 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2053#true} {2053#true} #124#return; {2053#true} is VALID [2020-07-29 01:10:57,134 INFO L263 TraceCheckUtils]: 4: Hoare triple {2053#true} call #t~ret8 := main(); {2053#true} is VALID [2020-07-29 01:10:57,134 INFO L280 TraceCheckUtils]: 5: Hoare triple {2053#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8bv32);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {2053#true} is VALID [2020-07-29 01:10:57,135 INFO L280 TraceCheckUtils]: 6: Hoare triple {2053#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {2053#true} is VALID [2020-07-29 01:10:57,135 INFO L280 TraceCheckUtils]: 7: Hoare triple {2053#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2079#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2020-07-29 01:10:57,136 INFO L280 TraceCheckUtils]: 8: Hoare triple {2079#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {2079#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2020-07-29 01:10:57,137 INFO L280 TraceCheckUtils]: 9: Hoare triple {2079#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} SUMMARY for call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32); srcloc: L525-3 {2079#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2020-07-29 01:10:57,140 INFO L280 TraceCheckUtils]: 10: Hoare triple {2079#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); srcloc: L532 {2089#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2020-07-29 01:10:57,141 INFO L280 TraceCheckUtils]: 11: Hoare triple {2089#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2093#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2020-07-29 01:10:57,141 INFO L280 TraceCheckUtils]: 12: Hoare triple {2093#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); {2093#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2020-07-29 01:10:57,142 INFO L280 TraceCheckUtils]: 13: Hoare triple {2093#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} SUMMARY for call #t~mem6 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); srcloc: L536 {2093#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2020-07-29 01:10:57,143 INFO L280 TraceCheckUtils]: 14: Hoare triple {2093#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} assume !(1bv32 != #t~mem6);havoc #t~mem6; {2093#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2020-07-29 01:10:57,144 INFO L280 TraceCheckUtils]: 15: Hoare triple {2093#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); srcloc: L536-3 {2106#(and (= |main_#t~mem7.base| (_ bv0 32)) (= (_ bv0 32) |main_#t~mem7.offset|))} is VALID [2020-07-29 01:10:57,145 INFO L280 TraceCheckUtils]: 16: Hoare triple {2106#(and (= |main_#t~mem7.base| (_ bv0 32)) (= (_ bv0 32) |main_#t~mem7.offset|))} ~p~0.base, ~p~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {2110#(and (= (_ bv0 32) main_~p~0.offset) (= main_~p~0.base (_ bv0 32)))} is VALID [2020-07-29 01:10:57,146 INFO L280 TraceCheckUtils]: 17: Hoare triple {2110#(and (= (_ bv0 32) main_~p~0.offset) (= main_~p~0.base (_ bv0 32)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); {2054#false} is VALID [2020-07-29 01:10:57,146 INFO L280 TraceCheckUtils]: 18: Hoare triple {2054#false} assume !(1bv1 == #valid[~p~0.base]); {2054#false} is VALID [2020-07-29 01:10:57,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:10:57,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:10:59,248 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2020-07-29 01:10:59,253 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-29 01:10:59,283 INFO L624 ElimStorePlain]: treesize reduction 19, result has 36.7 percent of original size [2020-07-29 01:10:59,283 INFO L512 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-07-29 01:10:59,283 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-29 01:10:59,283 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:11 [2020-07-29 01:10:59,301 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:10:59,301 WARN L407 uantifierElimination]: Input elimination task: ∀ [|#memory_$Pointer$.offset|, |#memory_$Pointer$.base|]. (let ((.cse0 (bvadd main_~p~0.offset (_ bv4 32))) (.cse1 (bvadd main_~a~0.offset (_ bv4 32)))) (and (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) .cse0 (_ bv0 32))) main_~a~0.base) .cse1)) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) .cse0 (_ bv0 32))) main_~a~0.base) .cse1) (_ bv0 32)))) [2020-07-29 01:10:59,301 WARN L408 uantifierElimination]: ElimStorePlain result: ∀ []. (and (= main_~p~0.base main_~a~0.base) (= (bvadd main_~a~0.offset (_ bv4 32)) (bvadd main_~p~0.offset (_ bv4 32)))) [2020-07-29 01:10:59,321 INFO L280 TraceCheckUtils]: 18: Hoare triple {2054#false} assume !(1bv1 == #valid[~p~0.base]); {2054#false} is VALID [2020-07-29 01:10:59,322 INFO L280 TraceCheckUtils]: 17: Hoare triple {2110#(and (= (_ bv0 32) main_~p~0.offset) (= main_~p~0.base (_ bv0 32)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); {2054#false} is VALID [2020-07-29 01:10:59,322 INFO L280 TraceCheckUtils]: 16: Hoare triple {2106#(and (= |main_#t~mem7.base| (_ bv0 32)) (= (_ bv0 32) |main_#t~mem7.offset|))} ~p~0.base, ~p~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {2110#(and (= (_ bv0 32) main_~p~0.offset) (= main_~p~0.base (_ bv0 32)))} is VALID [2020-07-29 01:10:59,327 INFO L280 TraceCheckUtils]: 15: Hoare triple {2093#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); srcloc: L536-3 {2106#(and (= |main_#t~mem7.base| (_ bv0 32)) (= (_ bv0 32) |main_#t~mem7.offset|))} is VALID [2020-07-29 01:10:59,328 INFO L280 TraceCheckUtils]: 14: Hoare triple {2093#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} assume !(1bv32 != #t~mem6);havoc #t~mem6; {2093#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2020-07-29 01:10:59,328 INFO L280 TraceCheckUtils]: 13: Hoare triple {2093#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} SUMMARY for call #t~mem6 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); srcloc: L536 {2093#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2020-07-29 01:10:59,329 INFO L280 TraceCheckUtils]: 12: Hoare triple {2093#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); {2093#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2020-07-29 01:10:59,330 INFO L280 TraceCheckUtils]: 11: Hoare triple {2089#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2093#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2020-07-29 01:10:59,332 INFO L280 TraceCheckUtils]: 10: Hoare triple {2079#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); srcloc: L532 {2089#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2020-07-29 01:10:59,334 INFO L280 TraceCheckUtils]: 9: Hoare triple {2079#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} SUMMARY for call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32); srcloc: L525-3 {2079#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2020-07-29 01:10:59,334 INFO L280 TraceCheckUtils]: 8: Hoare triple {2079#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !(0bv32 != #t~nondet3);havoc #t~nondet3; {2079#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2020-07-29 01:10:59,335 INFO L280 TraceCheckUtils]: 7: Hoare triple {2053#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2079#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2020-07-29 01:10:59,335 INFO L280 TraceCheckUtils]: 6: Hoare triple {2053#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {2053#true} is VALID [2020-07-29 01:10:59,335 INFO L280 TraceCheckUtils]: 5: Hoare triple {2053#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8bv32);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {2053#true} is VALID [2020-07-29 01:10:59,335 INFO L263 TraceCheckUtils]: 4: Hoare triple {2053#true} call #t~ret8 := main(); {2053#true} is VALID [2020-07-29 01:10:59,335 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2053#true} {2053#true} #124#return; {2053#true} is VALID [2020-07-29 01:10:59,336 INFO L280 TraceCheckUtils]: 2: Hoare triple {2053#true} assume true; {2053#true} is VALID [2020-07-29 01:10:59,336 INFO L280 TraceCheckUtils]: 1: Hoare triple {2053#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {2053#true} is VALID [2020-07-29 01:10:59,336 INFO L263 TraceCheckUtils]: 0: Hoare triple {2053#true} call ULTIMATE.init(); {2053#true} is VALID [2020-07-29 01:10:59,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:10:59,338 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135643523] [2020-07-29 01:10:59,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:10:59,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-07-29 01:10:59,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557414138] [2020-07-29 01:10:59,339 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-29 01:10:59,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:59,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:10:59,415 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:59,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:10:59,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:10:59,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:10:59,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:10:59,416 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 7 states. [2020-07-29 01:11:03,892 WARN L193 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2020-07-29 01:11:08,254 WARN L193 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 29 DAG size of output: 22 [2020-07-29 01:11:08,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:11:08,560 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2020-07-29 01:11:08,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:11:08,560 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-29 01:11:08,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:11:08,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:11:08,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2020-07-29 01:11:08,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:11:08,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2020-07-29 01:11:08,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 59 transitions. [2020-07-29 01:11:10,725 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 58 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-29 01:11:10,727 INFO L225 Difference]: With dead ends: 57 [2020-07-29 01:11:10,727 INFO L226 Difference]: Without dead ends: 57 [2020-07-29 01:11:10,728 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:11:10,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-29 01:11:10,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 45. [2020-07-29 01:11:10,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:11:10,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 45 states. [2020-07-29 01:11:10,732 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 45 states. [2020-07-29 01:11:10,732 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 45 states. [2020-07-29 01:11:10,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:11:10,734 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2020-07-29 01:11:10,734 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-07-29 01:11:10,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:11:10,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:11:10,735 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 57 states. [2020-07-29 01:11:10,735 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 57 states. [2020-07-29 01:11:10,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:11:10,738 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2020-07-29 01:11:10,738 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-07-29 01:11:10,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:11:10,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:11:10,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:11:10,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:11:10,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-29 01:11:10,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2020-07-29 01:11:10,741 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 19 [2020-07-29 01:11:10,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:11:10,741 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2020-07-29 01:11:10,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:11:10,741 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2020-07-29 01:11:10,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-29 01:11:10,742 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:11:10,742 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:11:10,948 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-07-29 01:11:10,948 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:11:10,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:11:10,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1923974807, now seen corresponding path program 1 times [2020-07-29 01:11:10,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:11:10,949 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525730765] [2020-07-29 01:11:10,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-07-29 01:11:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:11:11,068 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:11:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:11:11,102 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:11:11,130 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2020-07-29 01:11:11,130 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-29 01:11:11,331 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-07-29 01:11:11,346 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2020-07-29 01:11:11,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:11:11 BoogieIcfgContainer [2020-07-29 01:11:11,366 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:11:11,367 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:11:11,367 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:11:11,367 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:11:11,368 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:10:45" (3/4) ... [2020-07-29 01:11:11,376 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:11:11,376 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:11:11,378 INFO L168 Benchmark]: Toolchain (without parser) took 27209.22 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 286.3 MB). Free memory was 956.2 MB in the beginning and 835.9 MB in the end (delta: 120.3 MB). Peak memory consumption was 406.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:11:11,378 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:11:11,379 INFO L168 Benchmark]: CACSL2BoogieTranslator took 547.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -170.1 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:11:11,379 INFO L168 Benchmark]: Boogie Preprocessor took 76.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:11:11,380 INFO L168 Benchmark]: RCFGBuilder took 845.76 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: 64.1 MB). Peak memory consumption was 64.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:11:11,380 INFO L168 Benchmark]: TraceAbstraction took 25723.30 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 141.6 MB). Free memory was 1.1 GB in the beginning and 844.7 MB in the end (delta: 210.5 MB). Peak memory consumption was 352.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:11:11,381 INFO L168 Benchmark]: Witness Printer took 9.45 ms. Allocated memory is still 1.3 GB. Free memory was 844.7 MB in the beginning and 835.9 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:11:11,383 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 547.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -170.1 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 845.76 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: 64.1 MB). Peak memory consumption was 64.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25723.30 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 141.6 MB). Free memory was 1.1 GB in the beginning and 844.7 MB in the end (delta: 210.5 MB). Peak memory consumption was 352.0 MB. Max. memory is 11.5 GB. * Witness Printer took 9.45 ms. Allocated memory is still 1.3 GB. Free memory was 844.7 MB in the beginning and 835.9 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. 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.traceabstraction: - UnprovableResult [Line: 520]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 520. Possible FailurePath: [L521] List a = (List) malloc(sizeof(struct node)); VAL [a={1:0}, malloc(sizeof(struct node))={1:0}] [L522] COND FALSE !(a == 0) VAL [a={1:0}, malloc(sizeof(struct node))={1:0}] [L523] List t; [L524] List p = a; VAL [a={1:0}, malloc(sizeof(struct node))={1:0}, p={1:0}] [L525] COND FALSE !(__VERIFIER_nondet_int()) [L532] p->h = 1 VAL [a={1:0}, malloc(sizeof(struct node))={1:0}, p={1:0}] [L533] p->n = 0 VAL [a={1:0}, malloc(sizeof(struct node))={1:0}, p={1:0}] [L534] p = a VAL [a={1:0}, malloc(sizeof(struct node))={1:0}, p={1:0}] [L535] COND TRUE p!=0 VAL [a={1:0}, malloc(sizeof(struct node))={1:0}, p={1:0}] [L536] EXPR p->h VAL [a={1:0}, malloc(sizeof(struct node))={1:0}, p={1:0}, p->h=1] [L536] COND FALSE !(p->h != 1) [L539] EXPR p->n VAL [a={1:0}, malloc(sizeof(struct node))={1:0}, p={1:0}, p->n={0:0}] [L539] p = p->n [L535] COND FALSE !(p!=0) VAL [a={1:0}, malloc(sizeof(struct node))={1:0}, p={0:0}] [L541] return 0; VAL [\result=0, a={1:0}, malloc(sizeof(struct node))={1:0}, p={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 71 locations, 16 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 25.6s, OverallIterations: 8, TraceHistogramMax: 2, AutomataDifference: 17.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 191 SDtfs, 414 SDslu, 467 SDs, 0 SdLazy, 610 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 221 GetRequests, 170 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 97 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 194 ConstructedInterpolants, 1 QuantifiedInterpolants, 14092 SizeOfPredicates, 49 NumberOfNonLiveVariables, 432 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 6/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: 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...