./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/960521-1_1-3.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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-ext-properties/960521-1_1-3.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 b78007c6b6ea6b815e47bde6b36f25c26c431b61fea97b83eeeefa52c8c4206a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:47:50,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:47:50,939 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:47:50,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:47:50,968 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:47:50,969 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:47:50,970 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:47:50,971 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:47:50,972 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:47:50,972 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:47:50,973 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:47:50,974 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:47:50,974 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:47:50,975 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:47:50,976 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:47:50,976 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:47:50,977 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:47:50,977 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:47:50,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:47:50,979 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:47:50,980 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:47:50,981 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:47:50,982 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:47:50,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:47:50,984 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:47:50,984 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:47:50,984 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:47:50,985 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:47:50,985 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:47:50,986 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:47:50,986 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:47:50,986 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:47:50,987 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:47:50,987 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:47:50,988 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:47:50,988 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:47:50,989 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:47:50,989 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:47:50,989 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:47:50,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:47:50,990 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:47:50,991 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:47:51,005 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:47:51,006 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:47:51,006 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:47:51,006 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:47:51,007 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:47:51,007 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:47:51,008 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:47:51,008 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:47:51,008 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:47:51,008 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:47:51,008 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:47:51,009 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:47:51,009 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:47:51,009 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:47:51,009 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:47:51,009 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:47:51,009 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:47:51,010 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:47:51,010 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:47:51,010 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:47:51,010 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:47:51,010 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:47:51,010 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:47:51,011 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:47:51,011 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:47:51,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:47:51,011 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:47:51,011 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:47:51,012 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:47:51,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:47:51,012 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> b78007c6b6ea6b815e47bde6b36f25c26c431b61fea97b83eeeefa52c8c4206a [2022-02-20 23:47:51,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:47:51,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:47:51,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:47:51,260 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:47:51,260 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:47:51,261 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/960521-1_1-3.i [2022-02-20 23:47:51,320 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc5da1758/c3fb84642af94f3b992eba010b146fc3/FLAGe7e6f7b6c [2022-02-20 23:47:51,745 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:47:51,746 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/960521-1_1-3.i [2022-02-20 23:47:51,771 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc5da1758/c3fb84642af94f3b992eba010b146fc3/FLAGe7e6f7b6c [2022-02-20 23:47:52,070 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc5da1758/c3fb84642af94f3b992eba010b146fc3 [2022-02-20 23:47:52,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:47:52,075 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:47:52,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:47:52,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:47:52,079 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:47:52,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:47:52" (1/1) ... [2022-02-20 23:47:52,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73778fd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:52, skipping insertion in model container [2022-02-20 23:47:52,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:47:52" (1/1) ... [2022-02-20 23:47:52,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:47:52,123 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:47:52,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:47:52,343 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:47:52,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:47:52,441 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:47:52,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:52 WrapperNode [2022-02-20 23:47:52,442 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:47:52,442 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:47:52,443 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:47:52,443 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:47:52,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:52" (1/1) ... [2022-02-20 23:47:52,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:52" (1/1) ... [2022-02-20 23:47:52,482 INFO L137 Inliner]: procedures = 122, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 75 [2022-02-20 23:47:52,491 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:47:52,492 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:47:52,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:47:52,492 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:47:52,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:52" (1/1) ... [2022-02-20 23:47:52,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:52" (1/1) ... [2022-02-20 23:47:52,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:52" (1/1) ... [2022-02-20 23:47:52,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:52" (1/1) ... [2022-02-20 23:47:52,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:52" (1/1) ... [2022-02-20 23:47:52,518 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:52" (1/1) ... [2022-02-20 23:47:52,519 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:52" (1/1) ... [2022-02-20 23:47:52,520 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:47:52,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:47:52,523 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:47:52,523 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:47:52,524 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:52" (1/1) ... [2022-02-20 23:47:52,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:47:52,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:47:52,548 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:47:52,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:47:52,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:47:52,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:47:52,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:47:52,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:47:52,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:47:52,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:47:52,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:47:52,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:47:52,636 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:47:52,638 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:47:52,818 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:47:52,823 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:47:52,823 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 23:47:52,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:47:52 BoogieIcfgContainer [2022-02-20 23:47:52,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:47:52,826 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:47:52,826 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:47:52,832 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:47:52,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:47:52" (1/3) ... [2022-02-20 23:47:52,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2608ee18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:47:52, skipping insertion in model container [2022-02-20 23:47:52,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:52" (2/3) ... [2022-02-20 23:47:52,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2608ee18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:47:52, skipping insertion in model container [2022-02-20 23:47:52,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:47:52" (3/3) ... [2022-02-20 23:47:52,835 INFO L111 eAbstractionObserver]: Analyzing ICFG 960521-1_1-3.i [2022-02-20 23:47:52,838 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:47:52,839 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2022-02-20 23:47:52,899 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:47:52,904 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:47:52,904 INFO L340 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-02-20 23:47:52,945 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 32 states have (on average 1.875) internal successors, (60), 53 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:52,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:47:52,950 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:52,951 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:47:52,952 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:47:52,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:52,959 INFO L85 PathProgramCache]: Analyzing trace with hash 28702701, now seen corresponding path program 1 times [2022-02-20 23:47:52,965 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:52,966 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502853594] [2022-02-20 23:47:52,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:52,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:53,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {57#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {57#true} is VALID [2022-02-20 23:47:53,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {57#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post6#1, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~post9#1.base, main_#t~post9#1.offset, main_#t~mem10#1;~n~0 := 1; {57#true} is VALID [2022-02-20 23:47:53,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {57#true} assume !true; {58#false} is VALID [2022-02-20 23:47:53,094 INFO L290 TraceCheckUtils]: 3: Hoare triple {58#false} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_#t~post9#1.base, main_#t~post9#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post9#1.base, 4 + main_#t~post9#1.offset; {58#false} is VALID [2022-02-20 23:47:53,094 INFO L290 TraceCheckUtils]: 4: Hoare triple {58#false} assume !(1 == #valid[main_#t~post9#1.base]); {58#false} is VALID [2022-02-20 23:47:53,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:53,095 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:53,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502853594] [2022-02-20 23:47:53,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502853594] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:53,096 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:53,096 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:53,097 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104284216] [2022-02-20 23:47:53,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:53,101 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:47:53,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:53,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:53,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:53,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:47:53,124 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:53,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:47:53,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:47:53,140 INFO L87 Difference]: Start difference. First operand has 54 states, 32 states have (on average 1.875) internal successors, (60), 53 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:53,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:53,174 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-02-20 23:47:53,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:47:53,174 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:47:53,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:53,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:53,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2022-02-20 23:47:53,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:53,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2022-02-20 23:47:53,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 60 transitions. [2022-02-20 23:47:53,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:53,226 INFO L225 Difference]: With dead ends: 54 [2022-02-20 23:47:53,227 INFO L226 Difference]: Without dead ends: 52 [2022-02-20 23:47:53,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:47:53,230 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:53,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:47:53,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-20 23:47:53,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-02-20 23:47:53,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:53,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:53,250 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:53,250 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:53,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:53,254 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-02-20 23:47:53,254 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-02-20 23:47:53,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:53,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:53,255 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 52 states. [2022-02-20 23:47:53,255 INFO L87 Difference]: Start difference. First operand has 52 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 52 states. [2022-02-20 23:47:53,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:53,258 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-02-20 23:47:53,258 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-02-20 23:47:53,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:53,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:53,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:53,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:53,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:53,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-02-20 23:47:53,262 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 5 [2022-02-20 23:47:53,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:53,263 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-02-20 23:47:53,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:53,263 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-02-20 23:47:53,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:47:53,263 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:53,263 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:47:53,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:47:53,264 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:47:53,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:53,265 INFO L85 PathProgramCache]: Analyzing trace with hash 889569384, now seen corresponding path program 1 times [2022-02-20 23:47:53,265 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:53,265 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218128327] [2022-02-20 23:47:53,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:53,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:53,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {271#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {271#true} is VALID [2022-02-20 23:47:53,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {271#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post6#1, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~post9#1.base, main_#t~post9#1.offset, main_#t~mem10#1;~n~0 := 1; {271#true} is VALID [2022-02-20 23:47:53,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {271#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {271#true} is VALID [2022-02-20 23:47:53,305 INFO L290 TraceCheckUtils]: 3: Hoare triple {271#true} assume !(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1; {271#true} is VALID [2022-02-20 23:47:53,306 INFO L290 TraceCheckUtils]: 4: Hoare triple {271#true} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_#t~post9#1.base, main_#t~post9#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post9#1.base, 4 + main_#t~post9#1.offset; {273#(= (select |#valid| |ULTIMATE.start_main_#t~post9#1.base|) 1)} is VALID [2022-02-20 23:47:53,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {273#(= (select |#valid| |ULTIMATE.start_main_#t~post9#1.base|) 1)} assume !(1 == #valid[main_#t~post9#1.base]); {272#false} is VALID [2022-02-20 23:47:53,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:53,307 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:53,307 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218128327] [2022-02-20 23:47:53,307 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218128327] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:53,307 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:53,307 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:53,307 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113688748] [2022-02-20 23:47:53,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:53,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:47:53,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:53,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:53,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:53,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:53,314 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:53,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:53,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:53,316 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:53,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:53,384 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-02-20 23:47:53,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:53,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:47:53,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:53,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:53,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-02-20 23:47:53,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:53,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-02-20 23:47:53,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-02-20 23:47:53,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:53,437 INFO L225 Difference]: With dead ends: 51 [2022-02-20 23:47:53,437 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 23:47:53,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:53,443 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:53,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 85 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:47:53,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 23:47:53,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-02-20 23:47:53,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:53,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:53,455 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:53,457 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:53,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:53,461 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-02-20 23:47:53,461 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-02-20 23:47:53,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:53,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:53,462 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states. [2022-02-20 23:47:53,462 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states. [2022-02-20 23:47:53,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:53,465 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-02-20 23:47:53,465 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-02-20 23:47:53,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:53,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:53,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:53,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:53,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:53,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2022-02-20 23:47:53,470 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 6 [2022-02-20 23:47:53,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:53,471 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2022-02-20 23:47:53,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:53,471 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-02-20 23:47:53,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:47:53,472 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:53,472 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:47:53,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:47:53,472 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:47:53,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:53,473 INFO L85 PathProgramCache]: Analyzing trace with hash 889569385, now seen corresponding path program 1 times [2022-02-20 23:47:53,473 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:53,473 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561029533] [2022-02-20 23:47:53,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:53,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:53,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {480#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {480#true} is VALID [2022-02-20 23:47:53,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {480#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post6#1, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~post9#1.base, main_#t~post9#1.offset, main_#t~mem10#1;~n~0 := 1; {482#(= (+ (- 1) ~n~0) 0)} is VALID [2022-02-20 23:47:53,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {482#(= (+ (- 1) ~n~0) 0)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {482#(= (+ (- 1) ~n~0) 0)} is VALID [2022-02-20 23:47:53,533 INFO L290 TraceCheckUtils]: 3: Hoare triple {482#(= (+ (- 1) ~n~0) 0)} assume !(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1; {482#(= (+ (- 1) ~n~0) 0)} is VALID [2022-02-20 23:47:53,534 INFO L290 TraceCheckUtils]: 4: Hoare triple {482#(= (+ (- 1) ~n~0) 0)} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_#t~post9#1.base, main_#t~post9#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post9#1.base, 4 + main_#t~post9#1.offset; {483#(and (<= 4 (select |#length| |ULTIMATE.start_main_#t~post9#1.base|)) (= |ULTIMATE.start_main_#t~post9#1.offset| 0))} is VALID [2022-02-20 23:47:53,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {483#(and (<= 4 (select |#length| |ULTIMATE.start_main_#t~post9#1.base|)) (= |ULTIMATE.start_main_#t~post9#1.offset| 0))} assume !(4 + main_#t~post9#1.offset <= #length[main_#t~post9#1.base] && 0 <= main_#t~post9#1.offset); {481#false} is VALID [2022-02-20 23:47:53,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:53,535 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:53,536 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561029533] [2022-02-20 23:47:53,536 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561029533] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:53,536 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:53,536 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:47:53,536 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352850147] [2022-02-20 23:47:53,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:53,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:47:53,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:53,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:53,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:53,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:47:53,544 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:53,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:47:53,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:47:53,546 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:53,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:53,661 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2022-02-20 23:47:53,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:47:53,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:47:53,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:53,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:53,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-02-20 23:47:53,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:53,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-02-20 23:47:53,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 106 transitions. [2022-02-20 23:47:53,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:53,775 INFO L225 Difference]: With dead ends: 99 [2022-02-20 23:47:53,775 INFO L226 Difference]: Without dead ends: 99 [2022-02-20 23:47:53,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:53,776 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 49 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:53,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 127 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:47:53,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-02-20 23:47:53,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 55. [2022-02-20 23:47:53,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:53,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 55 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:53,779 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 55 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:53,780 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 55 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:53,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:53,782 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2022-02-20 23:47:53,782 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2022-02-20 23:47:53,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:53,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:53,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 99 states. [2022-02-20 23:47:53,783 INFO L87 Difference]: Start difference. First operand has 55 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 99 states. [2022-02-20 23:47:53,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:53,785 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2022-02-20 23:47:53,785 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2022-02-20 23:47:53,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:53,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:53,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:53,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:53,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:53,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2022-02-20 23:47:53,787 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 6 [2022-02-20 23:47:53,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:53,788 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2022-02-20 23:47:53,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:53,788 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-02-20 23:47:53,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:47:53,788 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:53,789 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:53,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:47:53,789 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:47:53,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:53,790 INFO L85 PathProgramCache]: Analyzing trace with hash 179257870, now seen corresponding path program 1 times [2022-02-20 23:47:53,790 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:53,790 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904492831] [2022-02-20 23:47:53,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:53,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:53,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {840#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {840#true} is VALID [2022-02-20 23:47:53,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {840#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post6#1, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~post9#1.base, main_#t~post9#1.offset, main_#t~mem10#1;~n~0 := 1; {842#(= (+ (- 1) ~n~0) 0)} is VALID [2022-02-20 23:47:53,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {842#(= (+ (- 1) ~n~0) 0)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {842#(= (+ (- 1) ~n~0) 0)} is VALID [2022-02-20 23:47:53,837 INFO L290 TraceCheckUtils]: 3: Hoare triple {842#(= (+ (- 1) ~n~0) 0)} assume !!(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1;main_#t~post6#1 := ~n~0;~n~0 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {843#(<= 2 ~n~0)} is VALID [2022-02-20 23:47:53,837 INFO L290 TraceCheckUtils]: 4: Hoare triple {843#(<= 2 ~n~0)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {843#(<= 2 ~n~0)} is VALID [2022-02-20 23:47:53,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {843#(<= 2 ~n~0)} assume !(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1; {843#(<= 2 ~n~0)} is VALID [2022-02-20 23:47:53,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {843#(<= 2 ~n~0)} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_#t~post9#1.base, main_#t~post9#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post9#1.base, 4 + main_#t~post9#1.offset; {844#(and (<= 8 (select |#length| |ULTIMATE.start_main_#t~post9#1.base|)) (= |ULTIMATE.start_main_#t~post9#1.offset| 0))} is VALID [2022-02-20 23:47:53,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {844#(and (<= 8 (select |#length| |ULTIMATE.start_main_#t~post9#1.base|)) (= |ULTIMATE.start_main_#t~post9#1.offset| 0))} assume !(4 + main_#t~post9#1.offset <= #length[main_#t~post9#1.base] && 0 <= main_#t~post9#1.offset); {841#false} is VALID [2022-02-20 23:47:53,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:53,840 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:53,840 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904492831] [2022-02-20 23:47:53,840 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904492831] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:47:53,840 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582280785] [2022-02-20 23:47:53,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:53,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:47:53,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:47:53,842 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:47:53,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 23:47:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:53,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:47:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:53,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:54,037 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:47:54,038 INFO L390 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-02-20 23:47:54,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {840#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {840#true} is VALID [2022-02-20 23:47:54,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {840#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post6#1, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~post9#1.base, main_#t~post9#1.offset, main_#t~mem10#1;~n~0 := 1; {851#(<= 1 ~n~0)} is VALID [2022-02-20 23:47:54,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {851#(<= 1 ~n~0)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {851#(<= 1 ~n~0)} is VALID [2022-02-20 23:47:54,075 INFO L290 TraceCheckUtils]: 3: Hoare triple {851#(<= 1 ~n~0)} assume !!(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1;main_#t~post6#1 := ~n~0;~n~0 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {843#(<= 2 ~n~0)} is VALID [2022-02-20 23:47:54,076 INFO L290 TraceCheckUtils]: 4: Hoare triple {843#(<= 2 ~n~0)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {843#(<= 2 ~n~0)} is VALID [2022-02-20 23:47:54,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {843#(<= 2 ~n~0)} assume !(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1; {843#(<= 2 ~n~0)} is VALID [2022-02-20 23:47:54,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {843#(<= 2 ~n~0)} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_#t~post9#1.base, main_#t~post9#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post9#1.base, 4 + main_#t~post9#1.offset; {844#(and (<= 8 (select |#length| |ULTIMATE.start_main_#t~post9#1.base|)) (= |ULTIMATE.start_main_#t~post9#1.offset| 0))} is VALID [2022-02-20 23:47:54,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {844#(and (<= 8 (select |#length| |ULTIMATE.start_main_#t~post9#1.base|)) (= |ULTIMATE.start_main_#t~post9#1.offset| 0))} assume !(4 + main_#t~post9#1.offset <= #length[main_#t~post9#1.base] && 0 <= main_#t~post9#1.offset); {841#false} is VALID [2022-02-20 23:47:54,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:54,078 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:54,078 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582280785] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:54,078 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:47:54,079 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-02-20 23:47:54,079 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497714607] [2022-02-20 23:47:54,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:54,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:47:54,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:54,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:54,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:54,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:47:54,086 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:54,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:47:54,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:47:54,087 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:54,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:54,265 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2022-02-20 23:47:54,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:47:54,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:47:54,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:54,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:54,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2022-02-20 23:47:54,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:54,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2022-02-20 23:47:54,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 105 transitions. [2022-02-20 23:47:54,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:54,350 INFO L225 Difference]: With dead ends: 98 [2022-02-20 23:47:54,351 INFO L226 Difference]: Without dead ends: 98 [2022-02-20 23:47:54,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:47:54,352 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 98 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:54,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 205 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:47:54,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-02-20 23:47:54,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 50. [2022-02-20 23:47:54,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:54,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 50 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:54,355 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 50 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:54,355 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 50 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:54,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:54,357 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2022-02-20 23:47:54,357 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2022-02-20 23:47:54,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:54,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:54,358 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 98 states. [2022-02-20 23:47:54,358 INFO L87 Difference]: Start difference. First operand has 50 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 98 states. [2022-02-20 23:47:54,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:54,360 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2022-02-20 23:47:54,360 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2022-02-20 23:47:54,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:54,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:54,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:54,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:54,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:54,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-02-20 23:47:54,362 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 8 [2022-02-20 23:47:54,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:54,362 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-02-20 23:47:54,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:54,363 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-02-20 23:47:54,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:47:54,363 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:54,363 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:54,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:54,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:47:54,580 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:47:54,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:54,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1213292751, now seen corresponding path program 1 times [2022-02-20 23:47:54,580 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:54,580 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325073593] [2022-02-20 23:47:54,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:54,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:54,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {1215#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {1215#true} is VALID [2022-02-20 23:47:54,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {1215#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post6#1, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~post9#1.base, main_#t~post9#1.offset, main_#t~mem10#1;~n~0 := 1; {1215#true} is VALID [2022-02-20 23:47:54,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {1215#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {1215#true} is VALID [2022-02-20 23:47:54,637 INFO L290 TraceCheckUtils]: 3: Hoare triple {1215#true} assume !(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1; {1215#true} is VALID [2022-02-20 23:47:54,638 INFO L290 TraceCheckUtils]: 4: Hoare triple {1215#true} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_#t~post9#1.base, main_#t~post9#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post9#1.base, 4 + main_#t~post9#1.offset; {1217#(or (= |ULTIMATE.start_main_#t~post9#1.base| ~a~0.base) (= (select |#valid| ~a~0.base) 1))} is VALID [2022-02-20 23:47:54,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {1217#(or (= |ULTIMATE.start_main_#t~post9#1.base| ~a~0.base) (= (select |#valid| ~a~0.base) 1))} SUMMARY for call write~int(0, main_#t~post9#1.base, main_#t~post9#1.offset, 4); srcloc: L542 {1218#(= (select |#valid| ~a~0.base) 1)} is VALID [2022-02-20 23:47:54,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {1218#(= (select |#valid| ~a~0.base) 1)} havoc main_#t~post9#1.base, main_#t~post9#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {1218#(= (select |#valid| ~a~0.base) 1)} is VALID [2022-02-20 23:47:54,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {1218#(= (select |#valid| ~a~0.base) 1)} assume !!(foo_~i~0#1 < ~n~0); {1218#(= (select |#valid| ~a~0.base) 1)} is VALID [2022-02-20 23:47:54,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {1218#(= (select |#valid| ~a~0.base) 1)} assume !(1 == #valid[~a~0.base]); {1216#false} is VALID [2022-02-20 23:47:54,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:54,640 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:54,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325073593] [2022-02-20 23:47:54,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325073593] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:54,641 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:54,641 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:47:54,641 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676760746] [2022-02-20 23:47:54,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:54,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:47:54,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:54,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:54,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:54,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:47:54,648 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:54,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:47:54,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:47:54,649 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:54,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:54,724 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-02-20 23:47:54,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:54,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:47:54,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:54,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:54,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-02-20 23:47:54,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:54,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-02-20 23:47:54,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 53 transitions. [2022-02-20 23:47:54,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:54,764 INFO L225 Difference]: With dead ends: 47 [2022-02-20 23:47:54,764 INFO L226 Difference]: Without dead ends: 47 [2022-02-20 23:47:54,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:47:54,765 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 28 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:54,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 61 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:47:54,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-20 23:47:54,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-02-20 23:47:54,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:54,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 46 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:54,767 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 46 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:54,768 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 46 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:54,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:54,769 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-02-20 23:47:54,769 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-02-20 23:47:54,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:54,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:54,769 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 46 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 47 states. [2022-02-20 23:47:54,770 INFO L87 Difference]: Start difference. First operand has 47 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 46 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 47 states. [2022-02-20 23:47:54,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:54,771 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-02-20 23:47:54,771 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-02-20 23:47:54,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:54,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:54,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:54,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:54,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 46 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:54,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-02-20 23:47:54,773 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 9 [2022-02-20 23:47:54,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:54,773 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-02-20 23:47:54,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:54,773 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-02-20 23:47:54,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:47:54,774 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:54,774 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:54,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:47:54,774 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:47:54,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:54,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1213292752, now seen corresponding path program 1 times [2022-02-20 23:47:54,775 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:54,775 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702651577] [2022-02-20 23:47:54,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:54,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:54,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {1409#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {1409#true} is VALID [2022-02-20 23:47:54,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {1409#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post6#1, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~post9#1.base, main_#t~post9#1.offset, main_#t~mem10#1;~n~0 := 1; {1411#(= (+ (- 1) ~n~0) 0)} is VALID [2022-02-20 23:47:54,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {1411#(= (+ (- 1) ~n~0) 0)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {1411#(= (+ (- 1) ~n~0) 0)} is VALID [2022-02-20 23:47:54,863 INFO L290 TraceCheckUtils]: 3: Hoare triple {1411#(= (+ (- 1) ~n~0) 0)} assume !(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1; {1411#(= (+ (- 1) ~n~0) 0)} is VALID [2022-02-20 23:47:54,864 INFO L290 TraceCheckUtils]: 4: Hoare triple {1411#(= (+ (- 1) ~n~0) 0)} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_#t~post9#1.base, main_#t~post9#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post9#1.base, 4 + main_#t~post9#1.offset; {1412#(and (not (= |ULTIMATE.start_main_#t~post9#1.base| ~a~0.base)) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~n~0 1))} is VALID [2022-02-20 23:47:54,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {1412#(and (not (= |ULTIMATE.start_main_#t~post9#1.base| ~a~0.base)) (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~n~0 1))} SUMMARY for call write~int(0, main_#t~post9#1.base, main_#t~post9#1.offset, 4); srcloc: L542 {1413#(and (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~n~0 1))} is VALID [2022-02-20 23:47:54,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {1413#(and (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~n~0 1))} havoc main_#t~post9#1.base, main_#t~post9#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {1414#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~n~0 1))} is VALID [2022-02-20 23:47:54,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {1414#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (= ~n~0 1))} assume !!(foo_~i~0#1 < ~n~0); {1415#(and (<= 4 (select |#length| ~a~0.base)) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:47:54,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {1415#(and (<= 4 (select |#length| ~a~0.base)) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume !(4 + (~a~0.offset + 4 * foo_~i~0#1) <= #length[~a~0.base] && 0 <= ~a~0.offset + 4 * foo_~i~0#1); {1410#false} is VALID [2022-02-20 23:47:54,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:54,867 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:54,867 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702651577] [2022-02-20 23:47:54,867 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702651577] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:54,867 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:54,867 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:47:54,867 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494366734] [2022-02-20 23:47:54,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:54,868 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:47:54,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:54,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:54,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:54,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:47:54,875 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:54,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:47:54,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:47:54,876 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:55,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:55,070 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2022-02-20 23:47:55,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:47:55,070 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:47:55,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:55,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:55,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2022-02-20 23:47:55,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:55,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2022-02-20 23:47:55,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 98 transitions. [2022-02-20 23:47:55,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:55,147 INFO L225 Difference]: With dead ends: 88 [2022-02-20 23:47:55,147 INFO L226 Difference]: Without dead ends: 88 [2022-02-20 23:47:55,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:47:55,148 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 72 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:55,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 144 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:47:55,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-02-20 23:47:55,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 64. [2022-02-20 23:47:55,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:55,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 64 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 63 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:55,151 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 64 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 63 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:55,151 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 64 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 63 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:55,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:55,153 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2022-02-20 23:47:55,153 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2022-02-20 23:47:55,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:55,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:55,154 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 63 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 88 states. [2022-02-20 23:47:55,154 INFO L87 Difference]: Start difference. First operand has 64 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 63 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 88 states. [2022-02-20 23:47:55,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:55,156 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2022-02-20 23:47:55,157 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2022-02-20 23:47:55,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:55,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:55,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:55,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:55,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 63 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:55,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2022-02-20 23:47:55,159 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 9 [2022-02-20 23:47:55,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:55,159 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2022-02-20 23:47:55,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:55,159 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2022-02-20 23:47:55,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:47:55,160 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:55,160 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:55,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:47:55,160 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:47:55,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:55,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1626816779, now seen corresponding path program 1 times [2022-02-20 23:47:55,161 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:55,161 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930476761] [2022-02-20 23:47:55,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:55,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:55,223 INFO L290 TraceCheckUtils]: 0: Hoare triple {1746#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {1746#true} is VALID [2022-02-20 23:47:55,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {1746#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post6#1, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~post9#1.base, main_#t~post9#1.offset, main_#t~mem10#1;~n~0 := 1; {1748#(= (+ (- 1) ~n~0) 0)} is VALID [2022-02-20 23:47:55,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {1748#(= (+ (- 1) ~n~0) 0)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {1748#(= (+ (- 1) ~n~0) 0)} is VALID [2022-02-20 23:47:55,224 INFO L290 TraceCheckUtils]: 3: Hoare triple {1748#(= (+ (- 1) ~n~0) 0)} assume !!(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1;main_#t~post6#1 := ~n~0;~n~0 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1749#(<= 2 ~n~0)} is VALID [2022-02-20 23:47:55,224 INFO L290 TraceCheckUtils]: 4: Hoare triple {1749#(<= 2 ~n~0)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {1749#(<= 2 ~n~0)} is VALID [2022-02-20 23:47:55,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {1749#(<= 2 ~n~0)} assume !(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1; {1749#(<= 2 ~n~0)} is VALID [2022-02-20 23:47:55,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {1749#(<= 2 ~n~0)} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_#t~post9#1.base, main_#t~post9#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post9#1.base, 4 + main_#t~post9#1.offset; {1750#(and (<= 8 (select |#length| ~a~0.base)) (= ~a~0.offset 0))} is VALID [2022-02-20 23:47:55,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {1750#(and (<= 8 (select |#length| ~a~0.base)) (= ~a~0.offset 0))} SUMMARY for call write~int(0, main_#t~post9#1.base, main_#t~post9#1.offset, 4); srcloc: L542 {1750#(and (<= 8 (select |#length| ~a~0.base)) (= ~a~0.offset 0))} is VALID [2022-02-20 23:47:55,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {1750#(and (<= 8 (select |#length| ~a~0.base)) (= ~a~0.offset 0))} havoc main_#t~post9#1.base, main_#t~post9#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {1751#(and (<= 8 (select |#length| ~a~0.base)) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:47:55,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {1751#(and (<= 8 (select |#length| ~a~0.base)) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume !!(foo_~i~0#1 < ~n~0); {1751#(and (<= 8 (select |#length| ~a~0.base)) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:47:55,232 INFO L290 TraceCheckUtils]: 10: Hoare triple {1751#(and (<= 8 (select |#length| ~a~0.base)) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume !(4 + (~a~0.offset + 4 * foo_~i~0#1) <= #length[~a~0.base] && 0 <= ~a~0.offset + 4 * foo_~i~0#1); {1747#false} is VALID [2022-02-20 23:47:55,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:55,233 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:55,233 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930476761] [2022-02-20 23:47:55,233 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930476761] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:47:55,233 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591117347] [2022-02-20 23:47:55,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:55,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:47:55,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:47:55,234 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:47:55,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 23:47:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:55,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 23:47:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:55,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:55,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:47:55,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-02-20 23:47:55,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-20 23:47:55,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {1746#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {1746#true} is VALID [2022-02-20 23:47:55,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {1746#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post6#1, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~post9#1.base, main_#t~post9#1.offset, main_#t~mem10#1;~n~0 := 1; {1758#(<= 1 ~n~0)} is VALID [2022-02-20 23:47:55,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {1758#(<= 1 ~n~0)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {1758#(<= 1 ~n~0)} is VALID [2022-02-20 23:47:55,479 INFO L290 TraceCheckUtils]: 3: Hoare triple {1758#(<= 1 ~n~0)} assume !!(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1;main_#t~post6#1 := ~n~0;~n~0 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1749#(<= 2 ~n~0)} is VALID [2022-02-20 23:47:55,479 INFO L290 TraceCheckUtils]: 4: Hoare triple {1749#(<= 2 ~n~0)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {1749#(<= 2 ~n~0)} is VALID [2022-02-20 23:47:55,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {1749#(<= 2 ~n~0)} assume !(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1; {1749#(<= 2 ~n~0)} is VALID [2022-02-20 23:47:55,480 INFO L290 TraceCheckUtils]: 6: Hoare triple {1749#(<= 2 ~n~0)} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_#t~post9#1.base, main_#t~post9#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post9#1.base, 4 + main_#t~post9#1.offset; {1750#(and (<= 8 (select |#length| ~a~0.base)) (= ~a~0.offset 0))} is VALID [2022-02-20 23:47:55,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {1750#(and (<= 8 (select |#length| ~a~0.base)) (= ~a~0.offset 0))} SUMMARY for call write~int(0, main_#t~post9#1.base, main_#t~post9#1.offset, 4); srcloc: L542 {1750#(and (<= 8 (select |#length| ~a~0.base)) (= ~a~0.offset 0))} is VALID [2022-02-20 23:47:55,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {1750#(and (<= 8 (select |#length| ~a~0.base)) (= ~a~0.offset 0))} havoc main_#t~post9#1.base, main_#t~post9#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {1751#(and (<= 8 (select |#length| ~a~0.base)) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:47:55,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {1751#(and (<= 8 (select |#length| ~a~0.base)) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume !!(foo_~i~0#1 < ~n~0); {1751#(and (<= 8 (select |#length| ~a~0.base)) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:47:55,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {1751#(and (<= 8 (select |#length| ~a~0.base)) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume !(4 + (~a~0.offset + 4 * foo_~i~0#1) <= #length[~a~0.base] && 0 <= ~a~0.offset + 4 * foo_~i~0#1); {1747#false} is VALID [2022-02-20 23:47:55,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:55,482 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:55,483 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591117347] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:55,483 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:47:55,483 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-02-20 23:47:55,483 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066392527] [2022-02-20 23:47:55,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:55,484 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 23:47:55,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:55,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:55,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:55,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:47:55,491 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:55,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:47:55,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:47:55,492 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:55,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:55,718 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2022-02-20 23:47:55,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:47:55,718 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 23:47:55,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:55,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:55,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-02-20 23:47:55,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:55,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-02-20 23:47:55,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 102 transitions. [2022-02-20 23:47:55,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:55,789 INFO L225 Difference]: With dead ends: 94 [2022-02-20 23:47:55,789 INFO L226 Difference]: Without dead ends: 94 [2022-02-20 23:47:55,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:47:55,790 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 149 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:55,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 137 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:47:55,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-02-20 23:47:55,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 60. [2022-02-20 23:47:55,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:55,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 60 states, 46 states have (on average 1.434782608695652) internal successors, (66), 59 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:55,793 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 60 states, 46 states have (on average 1.434782608695652) internal successors, (66), 59 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:55,793 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 60 states, 46 states have (on average 1.434782608695652) internal successors, (66), 59 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:55,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:55,794 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2022-02-20 23:47:55,794 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2022-02-20 23:47:55,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:55,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:55,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 46 states have (on average 1.434782608695652) internal successors, (66), 59 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 94 states. [2022-02-20 23:47:55,795 INFO L87 Difference]: Start difference. First operand has 60 states, 46 states have (on average 1.434782608695652) internal successors, (66), 59 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 94 states. [2022-02-20 23:47:55,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:55,797 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2022-02-20 23:47:55,797 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2022-02-20 23:47:55,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:55,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:55,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:55,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:55,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.434782608695652) internal successors, (66), 59 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:55,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2022-02-20 23:47:55,798 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 11 [2022-02-20 23:47:55,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:55,799 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2022-02-20 23:47:55,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:55,799 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2022-02-20 23:47:55,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:47:55,799 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:55,799 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:55,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:56,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-02-20 23:47:56,017 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:47:56,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:56,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1240415274, now seen corresponding path program 1 times [2022-02-20 23:47:56,018 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:56,018 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042254324] [2022-02-20 23:47:56,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:56,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:56,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {2131#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {2131#true} is VALID [2022-02-20 23:47:56,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {2131#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post6#1, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~post9#1.base, main_#t~post9#1.offset, main_#t~mem10#1;~n~0 := 1; {2133#(= (+ (- 1) ~n~0) 0)} is VALID [2022-02-20 23:47:56,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {2133#(= (+ (- 1) ~n~0) 0)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {2133#(= (+ (- 1) ~n~0) 0)} is VALID [2022-02-20 23:47:56,099 INFO L290 TraceCheckUtils]: 3: Hoare triple {2133#(= (+ (- 1) ~n~0) 0)} assume !(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1; {2133#(= (+ (- 1) ~n~0) 0)} is VALID [2022-02-20 23:47:56,099 INFO L290 TraceCheckUtils]: 4: Hoare triple {2133#(= (+ (- 1) ~n~0) 0)} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_#t~post9#1.base, main_#t~post9#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post9#1.base, 4 + main_#t~post9#1.offset; {2133#(= (+ (- 1) ~n~0) 0)} is VALID [2022-02-20 23:47:56,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {2133#(= (+ (- 1) ~n~0) 0)} SUMMARY for call write~int(0, main_#t~post9#1.base, main_#t~post9#1.offset, 4); srcloc: L542 {2133#(= (+ (- 1) ~n~0) 0)} is VALID [2022-02-20 23:47:56,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {2133#(= (+ (- 1) ~n~0) 0)} havoc main_#t~post9#1.base, main_#t~post9#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {2134#(and (= (+ (- 1) ~n~0) 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:47:56,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {2134#(and (= (+ (- 1) ~n~0) 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume !!(foo_~i~0#1 < ~n~0); {2134#(and (= (+ (- 1) ~n~0) 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:47:56,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {2134#(and (= (+ (- 1) ~n~0) 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L530 {2134#(and (= (+ (- 1) ~n~0) 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:47:56,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {2134#(and (= (+ (- 1) ~n~0) 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2135#(and (= (+ (- 1) ~n~0) 0) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:47:56,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {2135#(and (= (+ (- 1) ~n~0) 0) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} assume !!(foo_~i~0#1 < ~n~0); {2132#false} is VALID [2022-02-20 23:47:56,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {2132#false} assume !(4 + (~a~0.offset + 4 * foo_~i~0#1) <= #length[~a~0.base] && 0 <= ~a~0.offset + 4 * foo_~i~0#1); {2132#false} is VALID [2022-02-20 23:47:56,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:56,102 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:56,103 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042254324] [2022-02-20 23:47:56,103 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042254324] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:47:56,103 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122216682] [2022-02-20 23:47:56,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:56,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:47:56,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:47:56,104 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:47:56,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 23:47:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:56,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:47:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:56,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:56,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {2131#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {2131#true} is VALID [2022-02-20 23:47:56,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {2131#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post6#1, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~post9#1.base, main_#t~post9#1.offset, main_#t~mem10#1;~n~0 := 1; {2142#(<= ~n~0 1)} is VALID [2022-02-20 23:47:56,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {2142#(<= ~n~0 1)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {2142#(<= ~n~0 1)} is VALID [2022-02-20 23:47:56,284 INFO L290 TraceCheckUtils]: 3: Hoare triple {2142#(<= ~n~0 1)} assume !(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1; {2142#(<= ~n~0 1)} is VALID [2022-02-20 23:47:56,284 INFO L290 TraceCheckUtils]: 4: Hoare triple {2142#(<= ~n~0 1)} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_#t~post9#1.base, main_#t~post9#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post9#1.base, 4 + main_#t~post9#1.offset; {2142#(<= ~n~0 1)} is VALID [2022-02-20 23:47:56,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {2142#(<= ~n~0 1)} SUMMARY for call write~int(0, main_#t~post9#1.base, main_#t~post9#1.offset, 4); srcloc: L542 {2142#(<= ~n~0 1)} is VALID [2022-02-20 23:47:56,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {2142#(<= ~n~0 1)} havoc main_#t~post9#1.base, main_#t~post9#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {2158#(and (<= ~n~0 1) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:47:56,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {2158#(and (<= ~n~0 1) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} assume !!(foo_~i~0#1 < ~n~0); {2158#(and (<= ~n~0 1) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:47:56,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {2158#(and (<= ~n~0 1) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L530 {2158#(and (<= ~n~0 1) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:47:56,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {2158#(and (<= ~n~0 1) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2168#(and (<= ~n~0 1) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:47:56,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {2168#(and (<= ~n~0 1) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} assume !!(foo_~i~0#1 < ~n~0); {2132#false} is VALID [2022-02-20 23:47:56,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {2132#false} assume !(4 + (~a~0.offset + 4 * foo_~i~0#1) <= #length[~a~0.base] && 0 <= ~a~0.offset + 4 * foo_~i~0#1); {2132#false} is VALID [2022-02-20 23:47:56,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:56,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:56,289 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122216682] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:56,289 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:47:56,289 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-02-20 23:47:56,289 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971457501] [2022-02-20 23:47:56,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:56,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:47:56,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:56,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:56,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:56,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:47:56,299 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:56,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:47:56,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:47:56,300 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:56,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:56,417 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-02-20 23:47:56,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:47:56,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:47:56,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:56,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:56,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2022-02-20 23:47:56,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:56,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2022-02-20 23:47:56,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 89 transitions. [2022-02-20 23:47:56,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:56,473 INFO L225 Difference]: With dead ends: 87 [2022-02-20 23:47:56,473 INFO L226 Difference]: Without dead ends: 87 [2022-02-20 23:47:56,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:47:56,473 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 33 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:56,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 141 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:47:56,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-02-20 23:47:56,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 59. [2022-02-20 23:47:56,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:56,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 59 states, 45 states have (on average 1.4) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:56,477 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 59 states, 45 states have (on average 1.4) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:56,477 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 59 states, 45 states have (on average 1.4) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:56,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:56,479 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-02-20 23:47:56,479 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2022-02-20 23:47:56,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:56,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:56,479 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 45 states have (on average 1.4) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 87 states. [2022-02-20 23:47:56,479 INFO L87 Difference]: Start difference. First operand has 59 states, 45 states have (on average 1.4) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 87 states. [2022-02-20 23:47:56,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:56,481 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-02-20 23:47:56,481 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2022-02-20 23:47:56,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:56,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:56,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:56,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:56,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.4) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:56,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-02-20 23:47:56,482 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 12 [2022-02-20 23:47:56,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:56,483 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-02-20 23:47:56,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:56,483 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-02-20 23:47:56,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:47:56,483 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:56,483 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:56,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:56,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:47:56,696 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:47:56,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:56,697 INFO L85 PathProgramCache]: Analyzing trace with hash 87668155, now seen corresponding path program 1 times [2022-02-20 23:47:56,697 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:56,697 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13989357] [2022-02-20 23:47:56,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:56,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:56,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {2494#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {2494#true} is VALID [2022-02-20 23:47:56,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {2494#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post6#1, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~post9#1.base, main_#t~post9#1.offset, main_#t~mem10#1;~n~0 := 1; {2496#(= (+ (- 1) ~n~0) 0)} is VALID [2022-02-20 23:47:56,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {2496#(= (+ (- 1) ~n~0) 0)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {2496#(= (+ (- 1) ~n~0) 0)} is VALID [2022-02-20 23:47:56,823 INFO L290 TraceCheckUtils]: 3: Hoare triple {2496#(= (+ (- 1) ~n~0) 0)} assume !!(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1;main_#t~post6#1 := ~n~0;~n~0 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2497#(<= 2 ~n~0)} is VALID [2022-02-20 23:47:56,824 INFO L290 TraceCheckUtils]: 4: Hoare triple {2497#(<= 2 ~n~0)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {2497#(<= 2 ~n~0)} is VALID [2022-02-20 23:47:56,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {2497#(<= 2 ~n~0)} assume !(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1; {2497#(<= 2 ~n~0)} is VALID [2022-02-20 23:47:56,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {2497#(<= 2 ~n~0)} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_#t~post9#1.base, main_#t~post9#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post9#1.base, 4 + main_#t~post9#1.offset; {2498#(and (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 2 ~n~0))} is VALID [2022-02-20 23:47:56,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {2498#(and (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 2 ~n~0))} SUMMARY for call write~int(0, main_#t~post9#1.base, main_#t~post9#1.offset, 4); srcloc: L542 {2498#(and (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 2 ~n~0))} is VALID [2022-02-20 23:47:56,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {2498#(and (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 2 ~n~0))} havoc main_#t~post9#1.base, main_#t~post9#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {2499#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 2 ~n~0))} is VALID [2022-02-20 23:47:56,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {2499#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 2 ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {2499#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 2 ~n~0))} is VALID [2022-02-20 23:47:56,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {2499#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 2 ~n~0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L530 {2499#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 2 ~n~0))} is VALID [2022-02-20 23:47:56,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {2499#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 2 ~n~0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2500#(and (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 1 |ULTIMATE.start_foo_~i~0#1|) (<= (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0))} is VALID [2022-02-20 23:47:56,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {2500#(and (= ~a~0.offset 0) (= (* ~n~0 4) (select |#length| ~a~0.base)) (<= 1 |ULTIMATE.start_foo_~i~0#1|) (<= (+ |ULTIMATE.start_foo_~i~0#1| 1) ~n~0))} assume !!(foo_~i~0#1 < ~n~0); {2501#(and (<= (+ 4 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (= ~a~0.offset 0) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:47:56,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {2501#(and (<= (+ 4 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (= ~a~0.offset 0) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} assume !(4 + (~a~0.offset + 4 * foo_~i~0#1) <= #length[~a~0.base] && 0 <= ~a~0.offset + 4 * foo_~i~0#1); {2495#false} is VALID [2022-02-20 23:47:56,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:56,831 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:56,831 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13989357] [2022-02-20 23:47:56,831 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13989357] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:47:56,831 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228320428] [2022-02-20 23:47:56,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:56,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:47:56,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:47:56,832 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:47:56,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 23:47:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:56,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 23:47:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:56,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:57,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:47:57,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-02-20 23:47:57,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-20 23:47:57,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {2494#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {2494#true} is VALID [2022-02-20 23:47:57,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {2494#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post6#1, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~post9#1.base, main_#t~post9#1.offset, main_#t~mem10#1;~n~0 := 1; {2508#(<= 1 ~n~0)} is VALID [2022-02-20 23:47:57,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {2508#(<= 1 ~n~0)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {2508#(<= 1 ~n~0)} is VALID [2022-02-20 23:47:57,236 INFO L290 TraceCheckUtils]: 3: Hoare triple {2508#(<= 1 ~n~0)} assume !!(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1;main_#t~post6#1 := ~n~0;~n~0 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2497#(<= 2 ~n~0)} is VALID [2022-02-20 23:47:57,237 INFO L290 TraceCheckUtils]: 4: Hoare triple {2497#(<= 2 ~n~0)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {2497#(<= 2 ~n~0)} is VALID [2022-02-20 23:47:57,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {2497#(<= 2 ~n~0)} assume !(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1; {2497#(<= 2 ~n~0)} is VALID [2022-02-20 23:47:57,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {2497#(<= 2 ~n~0)} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_#t~post9#1.base, main_#t~post9#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post9#1.base, 4 + main_#t~post9#1.offset; {2524#(and (<= 2 (div (select |#length| ~a~0.base) 4)) (= ~a~0.offset 0))} is VALID [2022-02-20 23:47:57,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {2524#(and (<= 2 (div (select |#length| ~a~0.base) 4)) (= ~a~0.offset 0))} SUMMARY for call write~int(0, main_#t~post9#1.base, main_#t~post9#1.offset, 4); srcloc: L542 {2524#(and (<= 2 (div (select |#length| ~a~0.base) 4)) (= ~a~0.offset 0))} is VALID [2022-02-20 23:47:57,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {2524#(and (<= 2 (div (select |#length| ~a~0.base) 4)) (= ~a~0.offset 0))} havoc main_#t~post9#1.base, main_#t~post9#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {2531#(and (<= 2 (div (select |#length| ~a~0.base) 4)) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:47:57,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {2531#(and (<= 2 (div (select |#length| ~a~0.base) 4)) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume !!(foo_~i~0#1 < ~n~0); {2531#(and (<= 2 (div (select |#length| ~a~0.base) 4)) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:47:57,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {2531#(and (<= 2 (div (select |#length| ~a~0.base) 4)) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L530 {2531#(and (<= 2 (div (select |#length| ~a~0.base) 4)) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:47:57,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {2531#(and (<= 2 (div (select |#length| ~a~0.base) 4)) (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2541#(and (<= 2 (div (select |#length| ~a~0.base) 4)) (= |ULTIMATE.start_foo_~i~0#1| 1) (= ~a~0.offset 0))} is VALID [2022-02-20 23:47:57,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {2541#(and (<= 2 (div (select |#length| ~a~0.base) 4)) (= |ULTIMATE.start_foo_~i~0#1| 1) (= ~a~0.offset 0))} assume !!(foo_~i~0#1 < ~n~0); {2541#(and (<= 2 (div (select |#length| ~a~0.base) 4)) (= |ULTIMATE.start_foo_~i~0#1| 1) (= ~a~0.offset 0))} is VALID [2022-02-20 23:47:57,249 INFO L290 TraceCheckUtils]: 13: Hoare triple {2541#(and (<= 2 (div (select |#length| ~a~0.base) 4)) (= |ULTIMATE.start_foo_~i~0#1| 1) (= ~a~0.offset 0))} assume !(4 + (~a~0.offset + 4 * foo_~i~0#1) <= #length[~a~0.base] && 0 <= ~a~0.offset + 4 * foo_~i~0#1); {2495#false} is VALID [2022-02-20 23:47:57,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:57,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:47:57,476 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:47:57,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {2548#(and (<= (+ ~a~0.offset 4 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset (* |ULTIMATE.start_foo_~i~0#1| 4))))} assume !(4 + (~a~0.offset + 4 * foo_~i~0#1) <= #length[~a~0.base] && 0 <= ~a~0.offset + 4 * foo_~i~0#1); {2495#false} is VALID [2022-02-20 23:47:57,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {2548#(and (<= (+ ~a~0.offset 4 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset (* |ULTIMATE.start_foo_~i~0#1| 4))))} assume !!(foo_~i~0#1 < ~n~0); {2548#(and (<= (+ ~a~0.offset 4 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset (* |ULTIMATE.start_foo_~i~0#1| 4))))} is VALID [2022-02-20 23:47:57,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {2555#(and (<= (+ ~a~0.offset 8 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset 4 (* |ULTIMATE.start_foo_~i~0#1| 4))))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {2548#(and (<= (+ ~a~0.offset 4 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset (* |ULTIMATE.start_foo_~i~0#1| 4))))} is VALID [2022-02-20 23:47:57,525 INFO L290 TraceCheckUtils]: 10: Hoare triple {2555#(and (<= (+ ~a~0.offset 8 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset 4 (* |ULTIMATE.start_foo_~i~0#1| 4))))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L530 {2555#(and (<= (+ ~a~0.offset 8 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset 4 (* |ULTIMATE.start_foo_~i~0#1| 4))))} is VALID [2022-02-20 23:47:57,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {2555#(and (<= (+ ~a~0.offset 8 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset 4 (* |ULTIMATE.start_foo_~i~0#1| 4))))} assume !!(foo_~i~0#1 < ~n~0); {2555#(and (<= (+ ~a~0.offset 8 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset 4 (* |ULTIMATE.start_foo_~i~0#1| 4))))} is VALID [2022-02-20 23:47:57,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {2565#(and (<= (+ ~a~0.offset 8) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset 4)))} havoc main_#t~post9#1.base, main_#t~post9#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {2555#(and (<= (+ ~a~0.offset 8 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset 4 (* |ULTIMATE.start_foo_~i~0#1| 4))))} is VALID [2022-02-20 23:47:57,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {2565#(and (<= (+ ~a~0.offset 8) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset 4)))} SUMMARY for call write~int(0, main_#t~post9#1.base, main_#t~post9#1.offset, 4); srcloc: L542 {2565#(and (<= (+ ~a~0.offset 8) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset 4)))} is VALID [2022-02-20 23:47:57,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {2497#(<= 2 ~n~0)} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_#t~post9#1.base, main_#t~post9#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post9#1.base, 4 + main_#t~post9#1.offset; {2565#(and (<= (+ ~a~0.offset 8) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset 4)))} is VALID [2022-02-20 23:47:57,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {2497#(<= 2 ~n~0)} assume !(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1; {2497#(<= 2 ~n~0)} is VALID [2022-02-20 23:47:57,528 INFO L290 TraceCheckUtils]: 4: Hoare triple {2497#(<= 2 ~n~0)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {2497#(<= 2 ~n~0)} is VALID [2022-02-20 23:47:57,529 INFO L290 TraceCheckUtils]: 3: Hoare triple {2508#(<= 1 ~n~0)} assume !!(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1;main_#t~post6#1 := ~n~0;~n~0 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2497#(<= 2 ~n~0)} is VALID [2022-02-20 23:47:57,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {2508#(<= 1 ~n~0)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {2508#(<= 1 ~n~0)} is VALID [2022-02-20 23:47:57,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {2494#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post6#1, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~post9#1.base, main_#t~post9#1.offset, main_#t~mem10#1;~n~0 := 1; {2508#(<= 1 ~n~0)} is VALID [2022-02-20 23:47:57,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {2494#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {2494#true} is VALID [2022-02-20 23:47:57,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:57,530 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228320428] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:47:57,530 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:47:57,530 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-02-20 23:47:57,530 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682264038] [2022-02-20 23:47:57,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:47:57,531 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 23:47:57,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:57,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:57,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:57,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 23:47:57,556 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:57,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 23:47:57,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:47:57,557 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:58,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:58,184 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2022-02-20 23:47:58,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:47:58,184 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 23:47:58,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:58,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:58,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions. [2022-02-20 23:47:58,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:58,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions. [2022-02-20 23:47:58,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 135 transitions. [2022-02-20 23:47:58,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:58,291 INFO L225 Difference]: With dead ends: 128 [2022-02-20 23:47:58,291 INFO L226 Difference]: Without dead ends: 128 [2022-02-20 23:47:58,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2022-02-20 23:47:58,292 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 392 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:58,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 218 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:47:58,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-02-20 23:47:58,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 62. [2022-02-20 23:47:58,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:58,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 62 states, 48 states have (on average 1.375) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:58,294 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 62 states, 48 states have (on average 1.375) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:58,294 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 62 states, 48 states have (on average 1.375) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:58,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:58,296 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2022-02-20 23:47:58,296 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2022-02-20 23:47:58,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:58,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:58,296 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 48 states have (on average 1.375) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 128 states. [2022-02-20 23:47:58,297 INFO L87 Difference]: Start difference. First operand has 62 states, 48 states have (on average 1.375) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 128 states. [2022-02-20 23:47:58,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:58,298 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2022-02-20 23:47:58,298 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2022-02-20 23:47:58,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:58,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:58,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:58,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:58,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.375) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2022-02-20 23:47:58,300 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 14 [2022-02-20 23:47:58,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:58,300 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2022-02-20 23:47:58,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:58,300 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-02-20 23:47:58,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:47:58,300 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:58,300 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:58,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:58,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:47:58,517 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:47:58,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:58,518 INFO L85 PathProgramCache]: Analyzing trace with hash 685561807, now seen corresponding path program 1 times [2022-02-20 23:47:58,518 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:58,518 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017150386] [2022-02-20 23:47:58,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:58,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:58,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {3045#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {3045#true} is VALID [2022-02-20 23:47:58,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {3045#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post6#1, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~post9#1.base, main_#t~post9#1.offset, main_#t~mem10#1;~n~0 := 1; {3045#true} is VALID [2022-02-20 23:47:58,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {3045#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {3045#true} is VALID [2022-02-20 23:47:58,586 INFO L290 TraceCheckUtils]: 3: Hoare triple {3045#true} assume !(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1; {3045#true} is VALID [2022-02-20 23:47:58,587 INFO L290 TraceCheckUtils]: 4: Hoare triple {3045#true} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_#t~post9#1.base, main_#t~post9#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post9#1.base, 4 + main_#t~post9#1.offset; {3047#(= (select |#valid| ~b~0.base) (select |#valid| |ULTIMATE.start_main_#t~post9#1.base|))} is VALID [2022-02-20 23:47:58,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {3047#(= (select |#valid| ~b~0.base) (select |#valid| |ULTIMATE.start_main_#t~post9#1.base|))} SUMMARY for call write~int(0, main_#t~post9#1.base, main_#t~post9#1.offset, 4); srcloc: L542 {3048#(= (select |#valid| ~b~0.base) 1)} is VALID [2022-02-20 23:47:58,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {3048#(= (select |#valid| ~b~0.base) 1)} havoc main_#t~post9#1.base, main_#t~post9#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {3048#(= (select |#valid| ~b~0.base) 1)} is VALID [2022-02-20 23:47:58,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {3048#(= (select |#valid| ~b~0.base) 1)} assume !!(foo_~i~0#1 < ~n~0); {3048#(= (select |#valid| ~b~0.base) 1)} is VALID [2022-02-20 23:47:58,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {3048#(= (select |#valid| ~b~0.base) 1)} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L530 {3048#(= (select |#valid| ~b~0.base) 1)} is VALID [2022-02-20 23:47:58,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {3048#(= (select |#valid| ~b~0.base) 1)} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3048#(= (select |#valid| ~b~0.base) 1)} is VALID [2022-02-20 23:47:58,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {3048#(= (select |#valid| ~b~0.base) 1)} assume !(foo_~i~0#1 < ~n~0); {3048#(= (select |#valid| ~b~0.base) 1)} is VALID [2022-02-20 23:47:58,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {3048#(= (select |#valid| ~b~0.base) 1)} foo_~i~0#1 := 0; {3048#(= (select |#valid| ~b~0.base) 1)} is VALID [2022-02-20 23:47:58,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {3048#(= (select |#valid| ~b~0.base) 1)} assume !(foo_~i~0#1 < ~n~0 - 1); {3048#(= (select |#valid| ~b~0.base) 1)} is VALID [2022-02-20 23:47:58,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {3048#(= (select |#valid| ~b~0.base) 1)} assume { :end_inline_foo } true; {3048#(= (select |#valid| ~b~0.base) 1)} is VALID [2022-02-20 23:47:58,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {3048#(= (select |#valid| ~b~0.base) 1)} assume !(1 == #valid[~b~0.base]); {3046#false} is VALID [2022-02-20 23:47:58,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:47:58,591 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:58,591 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017150386] [2022-02-20 23:47:58,592 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017150386] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:58,592 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:58,592 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:47:58,592 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768823833] [2022-02-20 23:47:58,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:58,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:47:58,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:58,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:58,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:58,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:47:58,605 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:58,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:47:58,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:47:58,606 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:58,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:58,696 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-02-20 23:47:58,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:47:58,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:47:58,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:58,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:58,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-02-20 23:47:58,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:58,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-02-20 23:47:58,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 48 transitions. [2022-02-20 23:47:58,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:58,733 INFO L225 Difference]: With dead ends: 60 [2022-02-20 23:47:58,733 INFO L226 Difference]: Without dead ends: 60 [2022-02-20 23:47:58,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:58,733 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 16 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:58,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 71 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:47:58,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-02-20 23:47:58,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-02-20 23:47:58,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:58,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:58,737 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:58,737 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:58,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:58,738 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-02-20 23:47:58,738 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-02-20 23:47:58,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:58,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:58,738 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 60 states. [2022-02-20 23:47:58,738 INFO L87 Difference]: Start difference. First operand has 60 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 60 states. [2022-02-20 23:47:58,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:58,739 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-02-20 23:47:58,739 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-02-20 23:47:58,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:58,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:58,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:58,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:58,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:58,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2022-02-20 23:47:58,741 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 15 [2022-02-20 23:47:58,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:58,741 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2022-02-20 23:47:58,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:58,741 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-02-20 23:47:58,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:47:58,741 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:58,742 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:58,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:47:58,742 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:47:58,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:58,742 INFO L85 PathProgramCache]: Analyzing trace with hash 685561808, now seen corresponding path program 1 times [2022-02-20 23:47:58,742 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:58,743 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900240285] [2022-02-20 23:47:58,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:58,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:58,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {3293#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {3293#true} is VALID [2022-02-20 23:47:58,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {3293#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post6#1, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~post9#1.base, main_#t~post9#1.offset, main_#t~mem10#1;~n~0 := 1; {3295#(= (+ (- 1) ~n~0) 0)} is VALID [2022-02-20 23:47:58,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {3295#(= (+ (- 1) ~n~0) 0)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {3295#(= (+ (- 1) ~n~0) 0)} is VALID [2022-02-20 23:47:58,813 INFO L290 TraceCheckUtils]: 3: Hoare triple {3295#(= (+ (- 1) ~n~0) 0)} assume !(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1; {3295#(= (+ (- 1) ~n~0) 0)} is VALID [2022-02-20 23:47:58,814 INFO L290 TraceCheckUtils]: 4: Hoare triple {3295#(= (+ (- 1) ~n~0) 0)} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_#t~post9#1.base, main_#t~post9#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post9#1.base, 4 + main_#t~post9#1.offset; {3296#(and (<= (+ ~b~0.offset (* ~n~0 4)) (+ (select |#length| ~b~0.base) 4 |ULTIMATE.start_main_#t~post9#1.offset|)) (= (+ (- 1) ~n~0) 0) (<= (+ 4 |ULTIMATE.start_main_#t~post9#1.offset|) ~b~0.offset) (= |ULTIMATE.start_main_#t~post9#1.offset| 0))} is VALID [2022-02-20 23:47:58,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {3296#(and (<= (+ ~b~0.offset (* ~n~0 4)) (+ (select |#length| ~b~0.base) 4 |ULTIMATE.start_main_#t~post9#1.offset|)) (= (+ (- 1) ~n~0) 0) (<= (+ 4 |ULTIMATE.start_main_#t~post9#1.offset|) ~b~0.offset) (= |ULTIMATE.start_main_#t~post9#1.offset| 0))} SUMMARY for call write~int(0, main_#t~post9#1.base, main_#t~post9#1.offset, 4); srcloc: L542 {3297#(and (<= 4 ~b~0.offset) (= (+ (- 1) ~n~0) 0) (<= (+ ~b~0.offset (* ~n~0 4)) (+ (select |#length| ~b~0.base) 4)))} is VALID [2022-02-20 23:47:58,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {3297#(and (<= 4 ~b~0.offset) (= (+ (- 1) ~n~0) 0) (<= (+ ~b~0.offset (* ~n~0 4)) (+ (select |#length| ~b~0.base) 4)))} havoc main_#t~post9#1.base, main_#t~post9#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {3297#(and (<= 4 ~b~0.offset) (= (+ (- 1) ~n~0) 0) (<= (+ ~b~0.offset (* ~n~0 4)) (+ (select |#length| ~b~0.base) 4)))} is VALID [2022-02-20 23:47:58,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {3297#(and (<= 4 ~b~0.offset) (= (+ (- 1) ~n~0) 0) (<= (+ ~b~0.offset (* ~n~0 4)) (+ (select |#length| ~b~0.base) 4)))} assume !!(foo_~i~0#1 < ~n~0); {3297#(and (<= 4 ~b~0.offset) (= (+ (- 1) ~n~0) 0) (<= (+ ~b~0.offset (* ~n~0 4)) (+ (select |#length| ~b~0.base) 4)))} is VALID [2022-02-20 23:47:58,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {3297#(and (<= 4 ~b~0.offset) (= (+ (- 1) ~n~0) 0) (<= (+ ~b~0.offset (* ~n~0 4)) (+ (select |#length| ~b~0.base) 4)))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L530 {3297#(and (<= 4 ~b~0.offset) (= (+ (- 1) ~n~0) 0) (<= (+ ~b~0.offset (* ~n~0 4)) (+ (select |#length| ~b~0.base) 4)))} is VALID [2022-02-20 23:47:58,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {3297#(and (<= 4 ~b~0.offset) (= (+ (- 1) ~n~0) 0) (<= (+ ~b~0.offset (* ~n~0 4)) (+ (select |#length| ~b~0.base) 4)))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3297#(and (<= 4 ~b~0.offset) (= (+ (- 1) ~n~0) 0) (<= (+ ~b~0.offset (* ~n~0 4)) (+ (select |#length| ~b~0.base) 4)))} is VALID [2022-02-20 23:47:58,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {3297#(and (<= 4 ~b~0.offset) (= (+ (- 1) ~n~0) 0) (<= (+ ~b~0.offset (* ~n~0 4)) (+ (select |#length| ~b~0.base) 4)))} assume !(foo_~i~0#1 < ~n~0); {3297#(and (<= 4 ~b~0.offset) (= (+ (- 1) ~n~0) 0) (<= (+ ~b~0.offset (* ~n~0 4)) (+ (select |#length| ~b~0.base) 4)))} is VALID [2022-02-20 23:47:58,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {3297#(and (<= 4 ~b~0.offset) (= (+ (- 1) ~n~0) 0) (<= (+ ~b~0.offset (* ~n~0 4)) (+ (select |#length| ~b~0.base) 4)))} foo_~i~0#1 := 0; {3297#(and (<= 4 ~b~0.offset) (= (+ (- 1) ~n~0) 0) (<= (+ ~b~0.offset (* ~n~0 4)) (+ (select |#length| ~b~0.base) 4)))} is VALID [2022-02-20 23:47:58,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {3297#(and (<= 4 ~b~0.offset) (= (+ (- 1) ~n~0) 0) (<= (+ ~b~0.offset (* ~n~0 4)) (+ (select |#length| ~b~0.base) 4)))} assume !(foo_~i~0#1 < ~n~0 - 1); {3298#(and (<= 4 ~b~0.offset) (<= ~b~0.offset (select |#length| ~b~0.base)))} is VALID [2022-02-20 23:47:58,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {3298#(and (<= 4 ~b~0.offset) (<= ~b~0.offset (select |#length| ~b~0.base)))} assume { :end_inline_foo } true; {3298#(and (<= 4 ~b~0.offset) (<= ~b~0.offset (select |#length| ~b~0.base)))} is VALID [2022-02-20 23:47:58,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {3298#(and (<= 4 ~b~0.offset) (<= ~b~0.offset (select |#length| ~b~0.base)))} assume !(4 + (-4 + ~b~0.offset) <= #length[~b~0.base] && 0 <= -4 + ~b~0.offset); {3294#false} is VALID [2022-02-20 23:47:58,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:47:58,819 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:58,819 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900240285] [2022-02-20 23:47:58,819 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900240285] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:58,819 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:58,819 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:47:58,819 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88960283] [2022-02-20 23:47:58,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:58,820 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:47:58,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:58,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:58,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:58,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:47:58,832 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:58,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:47:58,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:47:58,832 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:58,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:58,928 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2022-02-20 23:47:58,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:47:58,928 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:47:58,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:58,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:58,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-02-20 23:47:58,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:58,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-02-20 23:47:58,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 65 transitions. [2022-02-20 23:47:58,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:58,972 INFO L225 Difference]: With dead ends: 64 [2022-02-20 23:47:58,972 INFO L226 Difference]: Without dead ends: 64 [2022-02-20 23:47:58,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:47:58,972 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 58 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:58,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 71 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:47:58,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-20 23:47:58,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 51. [2022-02-20 23:47:58,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:58,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 51 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:58,974 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 51 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:58,974 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 51 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:58,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:58,975 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2022-02-20 23:47:58,975 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2022-02-20 23:47:58,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:58,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:58,975 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 64 states. [2022-02-20 23:47:58,976 INFO L87 Difference]: Start difference. First operand has 51 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 64 states. [2022-02-20 23:47:58,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:58,976 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2022-02-20 23:47:58,976 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2022-02-20 23:47:58,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:58,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:58,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:58,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:58,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:58,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2022-02-20 23:47:58,977 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 15 [2022-02-20 23:47:58,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:58,977 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2022-02-20 23:47:58,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:58,977 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-02-20 23:47:58,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:47:58,978 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:58,978 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:58,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 23:47:58,978 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:47:58,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:58,978 INFO L85 PathProgramCache]: Analyzing trace with hash 381862667, now seen corresponding path program 2 times [2022-02-20 23:47:58,978 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:58,979 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687604002] [2022-02-20 23:47:58,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:58,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:59,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {3544#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {3544#true} is VALID [2022-02-20 23:47:59,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {3544#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post6#1, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~post9#1.base, main_#t~post9#1.offset, main_#t~mem10#1;~n~0 := 1; {3546#(= (+ (- 1) ~n~0) 0)} is VALID [2022-02-20 23:47:59,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {3546#(= (+ (- 1) ~n~0) 0)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {3546#(= (+ (- 1) ~n~0) 0)} is VALID [2022-02-20 23:47:59,029 INFO L290 TraceCheckUtils]: 3: Hoare triple {3546#(= (+ (- 1) ~n~0) 0)} assume !!(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1;main_#t~post6#1 := ~n~0;~n~0 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3547#(<= ~n~0 2)} is VALID [2022-02-20 23:47:59,029 INFO L290 TraceCheckUtils]: 4: Hoare triple {3547#(<= ~n~0 2)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {3547#(<= ~n~0 2)} is VALID [2022-02-20 23:47:59,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {3547#(<= ~n~0 2)} assume !(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1; {3547#(<= ~n~0 2)} is VALID [2022-02-20 23:47:59,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {3547#(<= ~n~0 2)} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_#t~post9#1.base, main_#t~post9#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post9#1.base, 4 + main_#t~post9#1.offset; {3547#(<= ~n~0 2)} is VALID [2022-02-20 23:47:59,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {3547#(<= ~n~0 2)} SUMMARY for call write~int(0, main_#t~post9#1.base, main_#t~post9#1.offset, 4); srcloc: L542 {3547#(<= ~n~0 2)} is VALID [2022-02-20 23:47:59,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {3547#(<= ~n~0 2)} havoc main_#t~post9#1.base, main_#t~post9#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {3548#(and (<= ~n~0 2) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:47:59,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {3548#(and (<= ~n~0 2) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume !!(foo_~i~0#1 < ~n~0); {3548#(and (<= ~n~0 2) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:47:59,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {3548#(and (<= ~n~0 2) (= |ULTIMATE.start_foo_~i~0#1| 0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L530 {3548#(and (<= ~n~0 2) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:47:59,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {3548#(and (<= ~n~0 2) (= |ULTIMATE.start_foo_~i~0#1| 0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3549#(<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 1))} is VALID [2022-02-20 23:47:59,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {3549#(<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 1))} assume !!(foo_~i~0#1 < ~n~0); {3549#(<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 1))} is VALID [2022-02-20 23:47:59,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {3549#(<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 1))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L530 {3549#(<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 1))} is VALID [2022-02-20 23:47:59,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {3549#(<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 1))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3550#(<= ~n~0 |ULTIMATE.start_foo_~i~0#1|)} is VALID [2022-02-20 23:47:59,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {3550#(<= ~n~0 |ULTIMATE.start_foo_~i~0#1|)} assume !!(foo_~i~0#1 < ~n~0); {3545#false} is VALID [2022-02-20 23:47:59,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {3545#false} assume !(4 + (~a~0.offset + 4 * foo_~i~0#1) <= #length[~a~0.base] && 0 <= ~a~0.offset + 4 * foo_~i~0#1); {3545#false} is VALID [2022-02-20 23:47:59,035 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:59,035 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:59,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687604002] [2022-02-20 23:47:59,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687604002] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:47:59,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618441175] [2022-02-20 23:47:59,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:47:59,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:47:59,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:47:59,038 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:47:59,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 23:47:59,084 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:47:59,085 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:47:59,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:47:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:59,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:59,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {3544#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {3544#true} is VALID [2022-02-20 23:47:59,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {3544#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post6#1, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~post9#1.base, main_#t~post9#1.offset, main_#t~mem10#1;~n~0 := 1; {3557#(<= ~n~0 1)} is VALID [2022-02-20 23:47:59,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {3557#(<= ~n~0 1)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {3557#(<= ~n~0 1)} is VALID [2022-02-20 23:47:59,273 INFO L290 TraceCheckUtils]: 3: Hoare triple {3557#(<= ~n~0 1)} assume !!(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1;main_#t~post6#1 := ~n~0;~n~0 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3547#(<= ~n~0 2)} is VALID [2022-02-20 23:47:59,273 INFO L290 TraceCheckUtils]: 4: Hoare triple {3547#(<= ~n~0 2)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {3547#(<= ~n~0 2)} is VALID [2022-02-20 23:47:59,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {3547#(<= ~n~0 2)} assume !(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1; {3547#(<= ~n~0 2)} is VALID [2022-02-20 23:47:59,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {3547#(<= ~n~0 2)} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_#t~post9#1.base, main_#t~post9#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post9#1.base, 4 + main_#t~post9#1.offset; {3547#(<= ~n~0 2)} is VALID [2022-02-20 23:47:59,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {3547#(<= ~n~0 2)} SUMMARY for call write~int(0, main_#t~post9#1.base, main_#t~post9#1.offset, 4); srcloc: L542 {3547#(<= ~n~0 2)} is VALID [2022-02-20 23:47:59,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {3547#(<= ~n~0 2)} havoc main_#t~post9#1.base, main_#t~post9#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {3579#(and (<= ~n~0 2) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:47:59,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {3579#(and (<= ~n~0 2) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} assume !!(foo_~i~0#1 < ~n~0); {3579#(and (<= ~n~0 2) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:47:59,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {3579#(and (<= ~n~0 2) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L530 {3579#(and (<= ~n~0 2) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:47:59,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {3579#(and (<= ~n~0 2) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3589#(and (<= ~n~0 2) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:47:59,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {3589#(and (<= ~n~0 2) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} assume !!(foo_~i~0#1 < ~n~0); {3589#(and (<= ~n~0 2) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:47:59,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {3589#(and (<= ~n~0 2) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L530 {3589#(and (<= ~n~0 2) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:47:59,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {3589#(and (<= ~n~0 2) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3599#(and (<= ~n~0 2) (<= 2 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:47:59,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {3599#(and (<= ~n~0 2) (<= 2 |ULTIMATE.start_foo_~i~0#1|))} assume !!(foo_~i~0#1 < ~n~0); {3545#false} is VALID [2022-02-20 23:47:59,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {3545#false} assume !(4 + (~a~0.offset + 4 * foo_~i~0#1) <= #length[~a~0.base] && 0 <= ~a~0.offset + 4 * foo_~i~0#1); {3545#false} is VALID [2022-02-20 23:47:59,278 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:59,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:47:59,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {3545#false} assume !(4 + (~a~0.offset + 4 * foo_~i~0#1) <= #length[~a~0.base] && 0 <= ~a~0.offset + 4 * foo_~i~0#1); {3545#false} is VALID [2022-02-20 23:47:59,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {3550#(<= ~n~0 |ULTIMATE.start_foo_~i~0#1|)} assume !!(foo_~i~0#1 < ~n~0); {3545#false} is VALID [2022-02-20 23:47:59,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {3549#(<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 1))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3550#(<= ~n~0 |ULTIMATE.start_foo_~i~0#1|)} is VALID [2022-02-20 23:47:59,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {3549#(<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 1))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L530 {3549#(<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 1))} is VALID [2022-02-20 23:47:59,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {3549#(<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 1))} assume !!(foo_~i~0#1 < ~n~0); {3549#(<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 1))} is VALID [2022-02-20 23:47:59,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {3621#(<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 2))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {3549#(<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 1))} is VALID [2022-02-20 23:47:59,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {3621#(<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 2))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L530 {3621#(<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 2))} is VALID [2022-02-20 23:47:59,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {3621#(<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 2))} assume !!(foo_~i~0#1 < ~n~0); {3621#(<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 2))} is VALID [2022-02-20 23:47:59,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {3547#(<= ~n~0 2)} havoc main_#t~post9#1.base, main_#t~post9#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {3621#(<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 2))} is VALID [2022-02-20 23:47:59,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {3547#(<= ~n~0 2)} SUMMARY for call write~int(0, main_#t~post9#1.base, main_#t~post9#1.offset, 4); srcloc: L542 {3547#(<= ~n~0 2)} is VALID [2022-02-20 23:47:59,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {3547#(<= ~n~0 2)} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_#t~post9#1.base, main_#t~post9#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post9#1.base, 4 + main_#t~post9#1.offset; {3547#(<= ~n~0 2)} is VALID [2022-02-20 23:47:59,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {3547#(<= ~n~0 2)} assume !(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1; {3547#(<= ~n~0 2)} is VALID [2022-02-20 23:47:59,393 INFO L290 TraceCheckUtils]: 4: Hoare triple {3547#(<= ~n~0 2)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {3547#(<= ~n~0 2)} is VALID [2022-02-20 23:47:59,394 INFO L290 TraceCheckUtils]: 3: Hoare triple {3557#(<= ~n~0 1)} assume !!(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1;main_#t~post6#1 := ~n~0;~n~0 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3547#(<= ~n~0 2)} is VALID [2022-02-20 23:47:59,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {3557#(<= ~n~0 1)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {3557#(<= ~n~0 1)} is VALID [2022-02-20 23:47:59,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {3544#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post6#1, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~post9#1.base, main_#t~post9#1.offset, main_#t~mem10#1;~n~0 := 1; {3557#(<= ~n~0 1)} is VALID [2022-02-20 23:47:59,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {3544#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {3544#true} is VALID [2022-02-20 23:47:59,395 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:59,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618441175] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:47:59,395 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:47:59,395 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-02-20 23:47:59,395 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987528135] [2022-02-20 23:47:59,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:47:59,396 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:47:59,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:59,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:59,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:59,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:47:59,416 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:59,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:47:59,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:47:59,417 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:59,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:59,685 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2022-02-20 23:47:59,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:47:59,685 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:47:59,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:59,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:59,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 96 transitions. [2022-02-20 23:47:59,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:59,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 96 transitions. [2022-02-20 23:47:59,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 96 transitions. [2022-02-20 23:47:59,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:59,750 INFO L225 Difference]: With dead ends: 98 [2022-02-20 23:47:59,750 INFO L226 Difference]: Without dead ends: 98 [2022-02-20 23:47:59,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:47:59,750 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 173 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:59,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 161 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:47:59,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-02-20 23:47:59,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 68. [2022-02-20 23:47:59,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:59,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 68 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 67 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:59,753 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 68 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 67 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:59,753 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 68 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 67 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:59,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:59,754 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2022-02-20 23:47:59,754 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2022-02-20 23:47:59,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:59,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:59,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 67 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 98 states. [2022-02-20 23:47:59,755 INFO L87 Difference]: Start difference. First operand has 68 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 67 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 98 states. [2022-02-20 23:47:59,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:59,756 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2022-02-20 23:47:59,756 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2022-02-20 23:47:59,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:59,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:59,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:59,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:59,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 67 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:59,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2022-02-20 23:47:59,758 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 17 [2022-02-20 23:47:59,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:59,758 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2022-02-20 23:47:59,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:59,758 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2022-02-20 23:47:59,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:47:59,759 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:59,759 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:59,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:59,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-02-20 23:47:59,960 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:47:59,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:59,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1002343613, now seen corresponding path program 1 times [2022-02-20 23:47:59,961 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:59,961 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827726612] [2022-02-20 23:47:59,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:59,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:59,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {4020#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {4020#true} is VALID [2022-02-20 23:47:59,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {4020#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post6#1, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~post9#1.base, main_#t~post9#1.offset, main_#t~mem10#1;~n~0 := 1; {4020#true} is VALID [2022-02-20 23:47:59,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {4020#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {4020#true} is VALID [2022-02-20 23:47:59,990 INFO L290 TraceCheckUtils]: 3: Hoare triple {4020#true} assume !(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1; {4020#true} is VALID [2022-02-20 23:47:59,991 INFO L290 TraceCheckUtils]: 4: Hoare triple {4020#true} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_#t~post9#1.base, main_#t~post9#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post9#1.base, 4 + main_#t~post9#1.offset; {4022#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:47:59,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {4022#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(0, main_#t~post9#1.base, main_#t~post9#1.offset, 4); srcloc: L542 {4022#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:47:59,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {4022#(not (<= |#StackHeapBarrier| ~a~0.base))} havoc main_#t~post9#1.base, main_#t~post9#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {4022#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:47:59,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {4022#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !!(foo_~i~0#1 < ~n~0); {4022#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:47:59,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {4022#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L530 {4022#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:47:59,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {4022#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4022#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:47:59,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {4022#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !(foo_~i~0#1 < ~n~0); {4022#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:47:59,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {4022#(not (<= |#StackHeapBarrier| ~a~0.base))} foo_~i~0#1 := 0; {4022#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:47:59,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {4022#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !(foo_~i~0#1 < ~n~0 - 1); {4022#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:47:59,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {4022#(not (<= |#StackHeapBarrier| ~a~0.base))} assume { :end_inline_foo } true; {4022#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:47:59,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {4022#(not (<= |#StackHeapBarrier| ~a~0.base))} SUMMARY for call main_#t~mem10#1 := read~int(~b~0.base, -4 + ~b~0.offset, 4); srcloc: L544 {4022#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:47:59,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {4022#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !(0 != main_#t~mem10#1);havoc main_#t~mem10#1; {4022#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:47:59,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {4022#(not (<= |#StackHeapBarrier| ~a~0.base))} assume 0 == ~a~0.offset; {4022#(not (<= |#StackHeapBarrier| ~a~0.base))} is VALID [2022-02-20 23:47:59,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {4022#(not (<= |#StackHeapBarrier| ~a~0.base))} assume !(~a~0.base < #StackHeapBarrier); {4021#false} is VALID [2022-02-20 23:47:59,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:47:59,996 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:59,996 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827726612] [2022-02-20 23:47:59,996 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827726612] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:59,996 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:59,996 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:59,996 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481846023] [2022-02-20 23:47:59,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:59,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:47:59,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:59,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:00,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:00,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:00,011 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:00,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:00,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:00,012 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:00,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:00,038 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2022-02-20 23:48:00,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:00,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:48:00,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:00,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-02-20 23:48:00,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-02-20 23:48:00,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2022-02-20 23:48:00,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:00,063 INFO L225 Difference]: With dead ends: 66 [2022-02-20 23:48:00,063 INFO L226 Difference]: Without dead ends: 66 [2022-02-20 23:48:00,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:00,064 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:00,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 25 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:00,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-02-20 23:48:00,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-02-20 23:48:00,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:00,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 65 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:00,066 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 65 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:00,067 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 65 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:00,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:00,067 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2022-02-20 23:48:00,068 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2022-02-20 23:48:00,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:00,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:00,068 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 65 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 66 states. [2022-02-20 23:48:00,068 INFO L87 Difference]: Start difference. First operand has 66 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 65 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 66 states. [2022-02-20 23:48:00,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:00,069 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2022-02-20 23:48:00,069 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2022-02-20 23:48:00,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:00,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:00,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:00,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:00,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 65 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:00,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2022-02-20 23:48:00,071 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 18 [2022-02-20 23:48:00,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:00,071 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2022-02-20 23:48:00,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:00,071 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2022-02-20 23:48:00,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:48:00,072 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:00,072 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:00,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 23:48:00,072 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:48:00,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:00,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1897750454, now seen corresponding path program 1 times [2022-02-20 23:48:00,073 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:00,073 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884586195] [2022-02-20 23:48:00,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:00,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:00,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {4289#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {4289#true} is VALID [2022-02-20 23:48:00,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {4289#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post6#1, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~post9#1.base, main_#t~post9#1.offset, main_#t~mem10#1;~n~0 := 1; {4291#(= (+ (- 1) ~n~0) 0)} is VALID [2022-02-20 23:48:00,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {4291#(= (+ (- 1) ~n~0) 0)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {4291#(= (+ (- 1) ~n~0) 0)} is VALID [2022-02-20 23:48:00,180 INFO L290 TraceCheckUtils]: 3: Hoare triple {4291#(= (+ (- 1) ~n~0) 0)} assume !!(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1;main_#t~post6#1 := ~n~0;~n~0 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4292#(<= 2 ~n~0)} is VALID [2022-02-20 23:48:00,181 INFO L290 TraceCheckUtils]: 4: Hoare triple {4292#(<= 2 ~n~0)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {4292#(<= 2 ~n~0)} is VALID [2022-02-20 23:48:00,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {4292#(<= 2 ~n~0)} assume !(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1; {4292#(<= 2 ~n~0)} is VALID [2022-02-20 23:48:00,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {4292#(<= 2 ~n~0)} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_#t~post9#1.base, main_#t~post9#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post9#1.base, 4 + main_#t~post9#1.offset; {4293#(and (<= (+ ~b~0.offset 4) (+ (* ~n~0 4) |ULTIMATE.start_main_#t~post9#1.offset|)) (<= (+ 4 |ULTIMATE.start_main_#t~post9#1.offset|) ~b~0.offset) (= |ULTIMATE.start_main_#t~post9#1.offset| 0) (= (+ (* ~n~0 4) (* (- 1) (select |#length| ~b~0.base))) 0))} is VALID [2022-02-20 23:48:00,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {4293#(and (<= (+ ~b~0.offset 4) (+ (* ~n~0 4) |ULTIMATE.start_main_#t~post9#1.offset|)) (<= (+ 4 |ULTIMATE.start_main_#t~post9#1.offset|) ~b~0.offset) (= |ULTIMATE.start_main_#t~post9#1.offset| 0) (= (+ (* ~n~0 4) (* (- 1) (select |#length| ~b~0.base))) 0))} SUMMARY for call write~int(0, main_#t~post9#1.base, main_#t~post9#1.offset, 4); srcloc: L542 {4294#(and (<= 4 ~b~0.offset) (<= (+ ~b~0.offset 4) (* ~n~0 4)) (= (+ (* ~n~0 4) (* (- 1) (select |#length| ~b~0.base))) 0))} is VALID [2022-02-20 23:48:00,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {4294#(and (<= 4 ~b~0.offset) (<= (+ ~b~0.offset 4) (* ~n~0 4)) (= (+ (* ~n~0 4) (* (- 1) (select |#length| ~b~0.base))) 0))} havoc main_#t~post9#1.base, main_#t~post9#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {4294#(and (<= 4 ~b~0.offset) (<= (+ ~b~0.offset 4) (* ~n~0 4)) (= (+ (* ~n~0 4) (* (- 1) (select |#length| ~b~0.base))) 0))} is VALID [2022-02-20 23:48:00,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {4294#(and (<= 4 ~b~0.offset) (<= (+ ~b~0.offset 4) (* ~n~0 4)) (= (+ (* ~n~0 4) (* (- 1) (select |#length| ~b~0.base))) 0))} assume !!(foo_~i~0#1 < ~n~0); {4294#(and (<= 4 ~b~0.offset) (<= (+ ~b~0.offset 4) (* ~n~0 4)) (= (+ (* ~n~0 4) (* (- 1) (select |#length| ~b~0.base))) 0))} is VALID [2022-02-20 23:48:00,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {4294#(and (<= 4 ~b~0.offset) (<= (+ ~b~0.offset 4) (* ~n~0 4)) (= (+ (* ~n~0 4) (* (- 1) (select |#length| ~b~0.base))) 0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L530 {4294#(and (<= 4 ~b~0.offset) (<= (+ ~b~0.offset 4) (* ~n~0 4)) (= (+ (* ~n~0 4) (* (- 1) (select |#length| ~b~0.base))) 0))} is VALID [2022-02-20 23:48:00,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {4294#(and (<= 4 ~b~0.offset) (<= (+ ~b~0.offset 4) (* ~n~0 4)) (= (+ (* ~n~0 4) (* (- 1) (select |#length| ~b~0.base))) 0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4294#(and (<= 4 ~b~0.offset) (<= (+ ~b~0.offset 4) (* ~n~0 4)) (= (+ (* ~n~0 4) (* (- 1) (select |#length| ~b~0.base))) 0))} is VALID [2022-02-20 23:48:00,189 INFO L290 TraceCheckUtils]: 12: Hoare triple {4294#(and (<= 4 ~b~0.offset) (<= (+ ~b~0.offset 4) (* ~n~0 4)) (= (+ (* ~n~0 4) (* (- 1) (select |#length| ~b~0.base))) 0))} assume !!(foo_~i~0#1 < ~n~0); {4294#(and (<= 4 ~b~0.offset) (<= (+ ~b~0.offset 4) (* ~n~0 4)) (= (+ (* ~n~0 4) (* (- 1) (select |#length| ~b~0.base))) 0))} is VALID [2022-02-20 23:48:00,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {4294#(and (<= 4 ~b~0.offset) (<= (+ ~b~0.offset 4) (* ~n~0 4)) (= (+ (* ~n~0 4) (* (- 1) (select |#length| ~b~0.base))) 0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L530 {4294#(and (<= 4 ~b~0.offset) (<= (+ ~b~0.offset 4) (* ~n~0 4)) (= (+ (* ~n~0 4) (* (- 1) (select |#length| ~b~0.base))) 0))} is VALID [2022-02-20 23:48:00,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {4294#(and (<= 4 ~b~0.offset) (<= (+ ~b~0.offset 4) (* ~n~0 4)) (= (+ (* ~n~0 4) (* (- 1) (select |#length| ~b~0.base))) 0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4294#(and (<= 4 ~b~0.offset) (<= (+ ~b~0.offset 4) (* ~n~0 4)) (= (+ (* ~n~0 4) (* (- 1) (select |#length| ~b~0.base))) 0))} is VALID [2022-02-20 23:48:00,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {4294#(and (<= 4 ~b~0.offset) (<= (+ ~b~0.offset 4) (* ~n~0 4)) (= (+ (* ~n~0 4) (* (- 1) (select |#length| ~b~0.base))) 0))} assume !(foo_~i~0#1 < ~n~0); {4294#(and (<= 4 ~b~0.offset) (<= (+ ~b~0.offset 4) (* ~n~0 4)) (= (+ (* ~n~0 4) (* (- 1) (select |#length| ~b~0.base))) 0))} is VALID [2022-02-20 23:48:00,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {4294#(and (<= 4 ~b~0.offset) (<= (+ ~b~0.offset 4) (* ~n~0 4)) (= (+ (* ~n~0 4) (* (- 1) (select |#length| ~b~0.base))) 0))} foo_~i~0#1 := 0; {4295#(and (<= 4 ~b~0.offset) (<= (+ ~b~0.offset 4) (* ~n~0 4)) (= |ULTIMATE.start_foo_~i~0#1| 0) (= (+ (* ~n~0 4) (* (- 1) (select |#length| ~b~0.base))) 0))} is VALID [2022-02-20 23:48:00,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {4295#(and (<= 4 ~b~0.offset) (<= (+ ~b~0.offset 4) (* ~n~0 4)) (= |ULTIMATE.start_foo_~i~0#1| 0) (= (+ (* ~n~0 4) (* (- 1) (select |#length| ~b~0.base))) 0))} assume !!(foo_~i~0#1 < ~n~0 - 1); {4296#(and (<= 4 ~b~0.offset) (<= (+ ~b~0.offset 4) (select |#length| ~b~0.base)) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:48:00,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {4296#(and (<= 4 ~b~0.offset) (<= (+ ~b~0.offset 4) (select |#length| ~b~0.base)) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume !(4 + (~b~0.offset + 4 * foo_~i~0#1) <= #length[~b~0.base] && 0 <= ~b~0.offset + 4 * foo_~i~0#1); {4290#false} is VALID [2022-02-20 23:48:00,195 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 23:48:00,195 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:00,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884586195] [2022-02-20 23:48:00,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884586195] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:48:00,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537160836] [2022-02-20 23:48:00,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:00,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:48:00,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:48:00,206 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:48:00,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 23:48:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:00,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:48:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:00,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:00,399 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:48:00,400 INFO L390 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-02-20 23:48:00,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {4289#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {4289#true} is VALID [2022-02-20 23:48:00,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {4289#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post6#1, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~post9#1.base, main_#t~post9#1.offset, main_#t~mem10#1;~n~0 := 1; {4303#(<= 1 ~n~0)} is VALID [2022-02-20 23:48:00,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {4303#(<= 1 ~n~0)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {4303#(<= 1 ~n~0)} is VALID [2022-02-20 23:48:00,526 INFO L290 TraceCheckUtils]: 3: Hoare triple {4303#(<= 1 ~n~0)} assume !!(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1;main_#t~post6#1 := ~n~0;~n~0 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4292#(<= 2 ~n~0)} is VALID [2022-02-20 23:48:00,527 INFO L290 TraceCheckUtils]: 4: Hoare triple {4292#(<= 2 ~n~0)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {4292#(<= 2 ~n~0)} is VALID [2022-02-20 23:48:00,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {4292#(<= 2 ~n~0)} assume !(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1; {4292#(<= 2 ~n~0)} is VALID [2022-02-20 23:48:00,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {4292#(<= 2 ~n~0)} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_#t~post9#1.base, main_#t~post9#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post9#1.base, 4 + main_#t~post9#1.offset; {4319#(and (<= 2 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:48:00,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {4319#(and (<= 2 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(0, main_#t~post9#1.base, main_#t~post9#1.offset, 4); srcloc: L542 {4319#(and (<= 2 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:48:00,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {4319#(and (<= 2 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} havoc main_#t~post9#1.base, main_#t~post9#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {4319#(and (<= 2 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:48:00,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {4319#(and (<= 2 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {4319#(and (<= 2 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:48:00,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {4319#(and (<= 2 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L530 {4319#(and (<= 2 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:48:00,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {4319#(and (<= 2 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4319#(and (<= 2 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:48:00,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {4319#(and (<= 2 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !!(foo_~i~0#1 < ~n~0); {4319#(and (<= 2 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:48:00,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {4319#(and (<= 2 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L530 {4319#(and (<= 2 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:48:00,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {4319#(and (<= 2 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4319#(and (<= 2 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:48:00,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {4319#(and (<= 2 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} assume !(foo_~i~0#1 < ~n~0); {4319#(and (<= 2 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} is VALID [2022-02-20 23:48:00,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {4319#(and (<= 2 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4))} foo_~i~0#1 := 0; {4350#(and (<= 2 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:48:00,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {4350#(and (<= 2 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume !!(foo_~i~0#1 < ~n~0 - 1); {4350#(and (<= 2 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:48:00,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {4350#(and (<= 2 (div (select |#length| ~b~0.base) 4)) (= ~b~0.offset 4) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume !(4 + (~b~0.offset + 4 * foo_~i~0#1) <= #length[~b~0.base] && 0 <= ~b~0.offset + 4 * foo_~i~0#1); {4290#false} is VALID [2022-02-20 23:48:00,534 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 23:48:00,534 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:00,534 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537160836] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:00,534 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:48:00,534 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2022-02-20 23:48:00,535 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337433470] [2022-02-20 23:48:00,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:00,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:48:00,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:00,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:00,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:00,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:48:00,552 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:00,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:48:00,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:48:00,552 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:00,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:00,694 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-02-20 23:48:00,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:48:00,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:48:00,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:00,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:00,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-02-20 23:48:00,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:00,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-02-20 23:48:00,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2022-02-20 23:48:00,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:00,736 INFO L225 Difference]: With dead ends: 78 [2022-02-20 23:48:00,736 INFO L226 Difference]: Without dead ends: 78 [2022-02-20 23:48:00,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:48:00,737 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 83 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:00,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 74 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:00,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-20 23:48:00,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 63. [2022-02-20 23:48:00,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:00,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 63 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 62 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:00,739 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 63 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 62 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:00,739 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 63 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 62 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:00,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:00,740 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-02-20 23:48:00,740 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-02-20 23:48:00,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:00,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:00,740 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 62 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 78 states. [2022-02-20 23:48:00,741 INFO L87 Difference]: Start difference. First operand has 63 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 62 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 78 states. [2022-02-20 23:48:00,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:00,741 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-02-20 23:48:00,742 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-02-20 23:48:00,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:00,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:00,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:00,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:00,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 62 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:00,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2022-02-20 23:48:00,743 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 19 [2022-02-20 23:48:00,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:00,743 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2022-02-20 23:48:00,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:00,743 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-02-20 23:48:00,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:48:00,744 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:00,744 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:00,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:48:00,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:48:00,960 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:48:00,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:00,960 INFO L85 PathProgramCache]: Analyzing trace with hash -951175098, now seen corresponding path program 3 times [2022-02-20 23:48:00,960 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:00,960 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148872567] [2022-02-20 23:48:00,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:00,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:01,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {4657#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {4657#true} is VALID [2022-02-20 23:48:01,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {4657#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post6#1, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~post9#1.base, main_#t~post9#1.offset, main_#t~mem10#1;~n~0 := 1; {4659#(= (+ (- 1) ~n~0) 0)} is VALID [2022-02-20 23:48:01,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {4659#(= (+ (- 1) ~n~0) 0)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {4659#(= (+ (- 1) ~n~0) 0)} is VALID [2022-02-20 23:48:01,064 INFO L290 TraceCheckUtils]: 3: Hoare triple {4659#(= (+ (- 1) ~n~0) 0)} assume !!(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1;main_#t~post6#1 := ~n~0;~n~0 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4660#(<= 2 ~n~0)} is VALID [2022-02-20 23:48:01,064 INFO L290 TraceCheckUtils]: 4: Hoare triple {4660#(<= 2 ~n~0)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {4660#(<= 2 ~n~0)} is VALID [2022-02-20 23:48:01,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {4660#(<= 2 ~n~0)} assume !!(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1;main_#t~post6#1 := ~n~0;~n~0 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4661#(<= 3 ~n~0)} is VALID [2022-02-20 23:48:01,065 INFO L290 TraceCheckUtils]: 6: Hoare triple {4661#(<= 3 ~n~0)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {4661#(<= 3 ~n~0)} is VALID [2022-02-20 23:48:01,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {4661#(<= 3 ~n~0)} assume !(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1; {4661#(<= 3 ~n~0)} is VALID [2022-02-20 23:48:01,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {4661#(<= 3 ~n~0)} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_#t~post9#1.base, main_#t~post9#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post9#1.base, 4 + main_#t~post9#1.offset; {4662#(and (= ~a~0.offset 0) (<= 12 (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:48:01,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {4662#(and (= ~a~0.offset 0) (<= 12 (select |#length| ~a~0.base)))} SUMMARY for call write~int(0, main_#t~post9#1.base, main_#t~post9#1.offset, 4); srcloc: L542 {4662#(and (= ~a~0.offset 0) (<= 12 (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:48:01,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {4662#(and (= ~a~0.offset 0) (<= 12 (select |#length| ~a~0.base)))} havoc main_#t~post9#1.base, main_#t~post9#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {4663#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 12 (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:48:01,068 INFO L290 TraceCheckUtils]: 11: Hoare triple {4663#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 12 (select |#length| ~a~0.base)))} assume !!(foo_~i~0#1 < ~n~0); {4663#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 12 (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:48:01,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {4663#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 12 (select |#length| ~a~0.base)))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L530 {4663#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 12 (select |#length| ~a~0.base)))} is VALID [2022-02-20 23:48:01,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {4663#(and (= ~a~0.offset 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 12 (select |#length| ~a~0.base)))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4664#(and (= ~a~0.offset 0) (<= (+ 8 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:48:01,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {4664#(and (= ~a~0.offset 0) (<= (+ 8 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} assume !!(foo_~i~0#1 < ~n~0); {4664#(and (= ~a~0.offset 0) (<= (+ 8 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:48:01,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {4664#(and (= ~a~0.offset 0) (<= (+ 8 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L530 {4664#(and (= ~a~0.offset 0) (<= (+ 8 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:48:01,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {4664#(and (= ~a~0.offset 0) (<= (+ 8 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4665#(and (<= (+ 4 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (= ~a~0.offset 0) (<= 2 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:48:01,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {4665#(and (<= (+ 4 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (= ~a~0.offset 0) (<= 2 |ULTIMATE.start_foo_~i~0#1|))} assume !!(foo_~i~0#1 < ~n~0); {4665#(and (<= (+ 4 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (= ~a~0.offset 0) (<= 2 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:48:01,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {4665#(and (<= (+ 4 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (= ~a~0.offset 0) (<= 2 |ULTIMATE.start_foo_~i~0#1|))} assume !(4 + (~a~0.offset + 4 * foo_~i~0#1) <= #length[~a~0.base] && 0 <= ~a~0.offset + 4 * foo_~i~0#1); {4658#false} is VALID [2022-02-20 23:48:01,073 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:01,073 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:01,073 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148872567] [2022-02-20 23:48:01,073 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148872567] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:48:01,073 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398394522] [2022-02-20 23:48:01,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 23:48:01,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:48:01,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:48:01,075 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:48:01,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 23:48:01,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-20 23:48:01,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:48:01,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 23:48:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:01,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:01,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:01,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-02-20 23:48:01,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-20 23:48:01,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {4657#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {4657#true} is VALID [2022-02-20 23:48:01,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {4657#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post6#1, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~post9#1.base, main_#t~post9#1.offset, main_#t~mem10#1;~n~0 := 1; {4657#true} is VALID [2022-02-20 23:48:01,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {4657#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {4657#true} is VALID [2022-02-20 23:48:01,396 INFO L290 TraceCheckUtils]: 3: Hoare triple {4657#true} assume !!(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1;main_#t~post6#1 := ~n~0;~n~0 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4657#true} is VALID [2022-02-20 23:48:01,396 INFO L290 TraceCheckUtils]: 4: Hoare triple {4657#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {4657#true} is VALID [2022-02-20 23:48:01,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {4657#true} assume !!(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1;main_#t~post6#1 := ~n~0;~n~0 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4657#true} is VALID [2022-02-20 23:48:01,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {4657#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {4657#true} is VALID [2022-02-20 23:48:01,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {4657#true} assume !(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1; {4657#true} is VALID [2022-02-20 23:48:01,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {4657#true} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_#t~post9#1.base, main_#t~post9#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post9#1.base, 4 + main_#t~post9#1.offset; {4693#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (<= ~a~0.offset 0))} is VALID [2022-02-20 23:48:01,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {4693#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (<= ~a~0.offset 0))} SUMMARY for call write~int(0, main_#t~post9#1.base, main_#t~post9#1.offset, 4); srcloc: L542 {4693#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (<= ~a~0.offset 0))} is VALID [2022-02-20 23:48:01,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {4693#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (<= ~a~0.offset 0))} havoc main_#t~post9#1.base, main_#t~post9#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {4693#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (<= ~a~0.offset 0))} is VALID [2022-02-20 23:48:01,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {4693#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (<= ~a~0.offset 0))} assume !!(foo_~i~0#1 < ~n~0); {4693#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (<= ~a~0.offset 0))} is VALID [2022-02-20 23:48:01,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {4693#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (<= ~a~0.offset 0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L530 {4693#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (<= ~a~0.offset 0))} is VALID [2022-02-20 23:48:01,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {4693#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (<= ~a~0.offset 0))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4693#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (<= ~a~0.offset 0))} is VALID [2022-02-20 23:48:01,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {4693#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (<= ~a~0.offset 0))} assume !!(foo_~i~0#1 < ~n~0); {4693#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (<= ~a~0.offset 0))} is VALID [2022-02-20 23:48:01,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {4693#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (<= ~a~0.offset 0))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L530 {4715#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (<= ~a~0.offset 0) (<= 0 (+ ~a~0.offset (* |ULTIMATE.start_foo_~i~0#1| 4))))} is VALID [2022-02-20 23:48:01,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {4715#(and (<= (* ~n~0 4) (select |#length| ~a~0.base)) (<= ~a~0.offset 0) (<= 0 (+ ~a~0.offset (* |ULTIMATE.start_foo_~i~0#1| 4))))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4719#(and (<= (+ (div ~a~0.offset (- 4)) 1) |ULTIMATE.start_foo_~i~0#1|) (<= (* ~n~0 4) (select |#length| ~a~0.base)) (<= ~a~0.offset 0))} is VALID [2022-02-20 23:48:01,403 INFO L290 TraceCheckUtils]: 17: Hoare triple {4719#(and (<= (+ (div ~a~0.offset (- 4)) 1) |ULTIMATE.start_foo_~i~0#1|) (<= (* ~n~0 4) (select |#length| ~a~0.base)) (<= ~a~0.offset 0))} assume !!(foo_~i~0#1 < ~n~0); {4723#(and (<= (+ (div ~a~0.offset (- 4)) 1) |ULTIMATE.start_foo_~i~0#1|) (<= ~a~0.offset 0) (< |ULTIMATE.start_foo_~i~0#1| (div (select |#length| ~a~0.base) 4)))} is VALID [2022-02-20 23:48:01,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {4723#(and (<= (+ (div ~a~0.offset (- 4)) 1) |ULTIMATE.start_foo_~i~0#1|) (<= ~a~0.offset 0) (< |ULTIMATE.start_foo_~i~0#1| (div (select |#length| ~a~0.base) 4)))} assume !(4 + (~a~0.offset + 4 * foo_~i~0#1) <= #length[~a~0.base] && 0 <= ~a~0.offset + 4 * foo_~i~0#1); {4658#false} is VALID [2022-02-20 23:48:01,404 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 23:48:01,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:48:03,038 INFO L290 TraceCheckUtils]: 18: Hoare triple {4727#(and (<= (+ ~a~0.offset 4 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset (* |ULTIMATE.start_foo_~i~0#1| 4))))} assume !(4 + (~a~0.offset + 4 * foo_~i~0#1) <= #length[~a~0.base] && 0 <= ~a~0.offset + 4 * foo_~i~0#1); {4658#false} is VALID [2022-02-20 23:48:03,039 INFO L290 TraceCheckUtils]: 17: Hoare triple {4731#(or (not (< |ULTIMATE.start_foo_~i~0#1| ~n~0)) (and (<= (+ ~a~0.offset 4 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset (* |ULTIMATE.start_foo_~i~0#1| 4)))))} assume !!(foo_~i~0#1 < ~n~0); {4727#(and (<= (+ ~a~0.offset 4 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset (* |ULTIMATE.start_foo_~i~0#1| 4))))} is VALID [2022-02-20 23:48:03,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {4735#(and (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1))) (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (<= (div ~a~0.offset (- 4)) (+ |ULTIMATE.start_foo_~i~0#1| 1))))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4731#(or (not (< |ULTIMATE.start_foo_~i~0#1| ~n~0)) (and (<= (+ ~a~0.offset 4 (* |ULTIMATE.start_foo_~i~0#1| 4)) (select |#length| ~a~0.base)) (<= 0 (+ ~a~0.offset (* |ULTIMATE.start_foo_~i~0#1| 4)))))} is VALID [2022-02-20 23:48:03,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {4739#(or (<= ~n~0 (+ (div ~a~0.offset (- 4)) 1)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1)))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L530 {4735#(and (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1))) (or (<= ~n~0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (<= (div ~a~0.offset (- 4)) (+ |ULTIMATE.start_foo_~i~0#1| 1))))} is VALID [2022-02-20 23:48:03,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {4739#(or (<= ~n~0 (+ (div ~a~0.offset (- 4)) 1)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1)))} assume !!(foo_~i~0#1 < ~n~0); {4739#(or (<= ~n~0 (+ (div ~a~0.offset (- 4)) 1)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1)))} is VALID [2022-02-20 23:48:03,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {4739#(or (<= ~n~0 (+ (div ~a~0.offset (- 4)) 1)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1)))} foo_#t~post3#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post3#1;havoc foo_#t~post3#1; {4739#(or (<= ~n~0 (+ (div ~a~0.offset (- 4)) 1)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1)))} is VALID [2022-02-20 23:48:03,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {4739#(or (<= ~n~0 (+ (div ~a~0.offset (- 4)) 1)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1)))} SUMMARY for call write~int(-1, ~a~0.base, ~a~0.offset + 4 * foo_~i~0#1, 4); srcloc: L530 {4739#(or (<= ~n~0 (+ (div ~a~0.offset (- 4)) 1)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1)))} is VALID [2022-02-20 23:48:03,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {4739#(or (<= ~n~0 (+ (div ~a~0.offset (- 4)) 1)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1)))} assume !!(foo_~i~0#1 < ~n~0); {4739#(or (<= ~n~0 (+ (div ~a~0.offset (- 4)) 1)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1)))} is VALID [2022-02-20 23:48:03,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {4739#(or (<= ~n~0 (+ (div ~a~0.offset (- 4)) 1)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1)))} havoc main_#t~post9#1.base, main_#t~post9#1.offset;assume { :begin_inline_foo } true;havoc foo_#t~post3#1, foo_#t~post4#1, foo_~i~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {4739#(or (<= ~n~0 (+ (div ~a~0.offset (- 4)) 1)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1)))} is VALID [2022-02-20 23:48:03,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {4739#(or (<= ~n~0 (+ (div ~a~0.offset (- 4)) 1)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1)))} SUMMARY for call write~int(0, main_#t~post9#1.base, main_#t~post9#1.offset, 4); srcloc: L542 {4739#(or (<= ~n~0 (+ (div ~a~0.offset (- 4)) 1)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1)))} is VALID [2022-02-20 23:48:03,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {4657#true} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~a~0.base, ~a~0.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * ~n~0);~b~0.base, ~b~0.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_#t~post9#1.base, main_#t~post9#1.offset := ~b~0.base, ~b~0.offset;~b~0.base, ~b~0.offset := main_#t~post9#1.base, 4 + main_#t~post9#1.offset; {4739#(or (<= ~n~0 (+ (div ~a~0.offset (- 4)) 1)) (<= ~n~0 (+ (div (+ (- 4) (select |#length| ~a~0.base) (* (- 1) ~a~0.offset)) 4) 1)))} is VALID [2022-02-20 23:48:03,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {4657#true} assume !(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1; {4657#true} is VALID [2022-02-20 23:48:03,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {4657#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {4657#true} is VALID [2022-02-20 23:48:03,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {4657#true} assume !!(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1;main_#t~post6#1 := ~n~0;~n~0 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4657#true} is VALID [2022-02-20 23:48:03,046 INFO L290 TraceCheckUtils]: 4: Hoare triple {4657#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {4657#true} is VALID [2022-02-20 23:48:03,046 INFO L290 TraceCheckUtils]: 3: Hoare triple {4657#true} assume !!(0 != main_#t~nondet5#1 && ~n~0 < 30);havoc main_#t~nondet5#1;main_#t~post6#1 := ~n~0;~n~0 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4657#true} is VALID [2022-02-20 23:48:03,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {4657#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {4657#true} is VALID [2022-02-20 23:48:03,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {4657#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post6#1, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~post9#1.base, main_#t~post9#1.offset, main_#t~mem10#1;~n~0 := 1; {4657#true} is VALID [2022-02-20 23:48:03,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {4657#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);~a~0.base, ~a~0.offset := 0, 0;~b~0.base, ~b~0.offset := 0, 0;~n~0 := 0; {4657#true} is VALID [2022-02-20 23:48:03,047 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 23:48:03,047 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398394522] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:48:03,047 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:48:03,047 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 16 [2022-02-20 23:48:03,048 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887371837] [2022-02-20 23:48:03,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:48:03,048 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:48:03,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:03,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:03,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:03,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-20 23:48:03,083 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:03,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-20 23:48:03,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:48:03,084 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:04,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:04,420 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2022-02-20 23:48:04,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-20 23:48:04,421 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:48:04,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:04,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:04,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 117 transitions. [2022-02-20 23:48:04,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:04,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 117 transitions. [2022-02-20 23:48:04,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 117 transitions. [2022-02-20 23:48:04,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:04,516 INFO L225 Difference]: With dead ends: 112 [2022-02-20 23:48:04,516 INFO L226 Difference]: Without dead ends: 112 [2022-02-20 23:48:04,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=267, Invalid=789, Unknown=0, NotChecked=0, Total=1056 [2022-02-20 23:48:04,516 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 283 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:04,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 182 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:48:04,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-02-20 23:48:04,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 61. [2022-02-20 23:48:04,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:04,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 61 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:04,518 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 61 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:04,518 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 61 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:04,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:04,528 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2022-02-20 23:48:04,528 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 115 transitions. [2022-02-20 23:48:04,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:04,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:04,529 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 112 states. [2022-02-20 23:48:04,529 INFO L87 Difference]: Start difference. First operand has 61 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 112 states. [2022-02-20 23:48:04,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:04,530 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2022-02-20 23:48:04,530 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 115 transitions. [2022-02-20 23:48:04,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:04,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:04,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:04,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:04,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:04,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2022-02-20 23:48:04,532 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 19 [2022-02-20 23:48:04,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:04,532 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2022-02-20 23:48:04,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:04,532 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-02-20 23:48:04,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:48:04,533 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:04,533 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:04,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:48:04,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:48:04,743 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:48:04,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:04,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1179541311, now seen corresponding path program 1 times [2022-02-20 23:48:04,744 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:04,744 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346604629] [2022-02-20 23:48:04,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:04,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:48:04,757 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:48:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:48:04,777 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 23:48:04,777 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:48:04,778 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (20 of 21 remaining) [2022-02-20 23:48:04,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (19 of 21 remaining) [2022-02-20 23:48:04,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (18 of 21 remaining) [2022-02-20 23:48:04,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (17 of 21 remaining) [2022-02-20 23:48:04,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (16 of 21 remaining) [2022-02-20 23:48:04,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (15 of 21 remaining) [2022-02-20 23:48:04,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (14 of 21 remaining) [2022-02-20 23:48:04,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (13 of 21 remaining) [2022-02-20 23:48:04,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (12 of 21 remaining) [2022-02-20 23:48:04,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (11 of 21 remaining) [2022-02-20 23:48:04,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (10 of 21 remaining) [2022-02-20 23:48:04,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (9 of 21 remaining) [2022-02-20 23:48:04,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (8 of 21 remaining) [2022-02-20 23:48:04,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (7 of 21 remaining) [2022-02-20 23:48:04,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (6 of 21 remaining) [2022-02-20 23:48:04,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE (5 of 21 remaining) [2022-02-20 23:48:04,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE (4 of 21 remaining) [2022-02-20 23:48:04,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2022-02-20 23:48:04,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2022-02-20 23:48:04,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (1 of 21 remaining) [2022-02-20 23:48:04,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (0 of 21 remaining) [2022-02-20 23:48:04,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 23:48:04,785 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:04,788 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:48:04,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:48:04 BoogieIcfgContainer [2022-02-20 23:48:04,806 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:48:04,806 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:48:04,806 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:48:04,806 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:48:04,807 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:47:52" (3/4) ... [2022-02-20 23:48:04,808 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 23:48:04,835 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 23:48:04,836 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:48:04,836 INFO L158 Benchmark]: Toolchain (without parser) took 12761.73ms. Allocated memory was 100.7MB in the beginning and 247.5MB in the end (delta: 146.8MB). Free memory was 61.0MB in the beginning and 205.9MB in the end (delta: -144.9MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2022-02-20 23:48:04,836 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:48:04,837 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.09ms. Allocated memory was 100.7MB in the beginning and 153.1MB in the end (delta: 52.4MB). Free memory was 60.8MB in the beginning and 129.0MB in the end (delta: -68.2MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2022-02-20 23:48:04,837 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.98ms. Allocated memory is still 153.1MB. Free memory was 129.0MB in the beginning and 127.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:48:04,837 INFO L158 Benchmark]: Boogie Preprocessor took 28.53ms. Allocated memory is still 153.1MB. Free memory was 127.0MB in the beginning and 125.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:48:04,837 INFO L158 Benchmark]: RCFGBuilder took 302.34ms. Allocated memory is still 153.1MB. Free memory was 125.0MB in the beginning and 108.8MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-20 23:48:04,837 INFO L158 Benchmark]: TraceAbstraction took 11979.75ms. Allocated memory was 153.1MB in the beginning and 247.5MB in the end (delta: 94.4MB). Free memory was 108.2MB in the beginning and 209.1MB in the end (delta: -100.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:48:04,838 INFO L158 Benchmark]: Witness Printer took 29.54ms. Allocated memory is still 247.5MB. Free memory was 209.1MB in the beginning and 205.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 23:48:04,838 INFO L339 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.19ms. Allocated memory is still 100.7MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.09ms. Allocated memory was 100.7MB in the beginning and 153.1MB in the end (delta: 52.4MB). Free memory was 60.8MB in the beginning and 129.0MB in the end (delta: -68.2MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.98ms. Allocated memory is still 153.1MB. Free memory was 129.0MB in the beginning and 127.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.53ms. Allocated memory is still 153.1MB. Free memory was 127.0MB in the beginning and 125.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 302.34ms. Allocated memory is still 153.1MB. Free memory was 125.0MB in the beginning and 108.8MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11979.75ms. Allocated memory was 153.1MB in the beginning and 247.5MB in the end (delta: 94.4MB). Free memory was 108.2MB in the beginning and 209.1MB in the end (delta: -100.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 29.54ms. Allocated memory is still 247.5MB. Free memory was 209.1MB in the beginning and 205.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 547]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L523] int *a, *b; [L524] int n; VAL [a={0:0}, b={0:0}, n=0] [L536] n = 1 VAL [a={0:0}, b={0:0}, n=1] [L537] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L540] a = malloc(n * sizeof(*a)) [L541] b = malloc(n * sizeof(*b)) [L542] EXPR b++ VAL [a={-3:0}, b={-2:4}, b++={-2:0}, n=1] [L542] *b++ = 0 VAL [a={-3:0}, b={-2:4}, b++={-2:0}, n=1] [L543] CALL foo() [L528] int i; [L529] i = 0 VAL [a={-3:0}, b={-2:4}, i=0, n=1] [L529] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=0, n=1] [L530] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=0, n=1] [L529] i++ VAL [a={-3:0}, b={-2:4}, i=1, n=1] [L529] COND FALSE !(i < n) VAL [a={-3:0}, b={-2:4}, i=1, n=1] [L531] i = 0 VAL [a={-3:0}, b={-2:4}, i=0, n=1] [L531] COND FALSE !(i < n - 1) VAL [a={-3:0}, b={-2:4}, i=0, n=1] [L543] RET foo() [L544] b[-1] VAL [a={-3:0}, b={-2:4}, b[-1]=0, n=1] [L544] COND FALSE !(b[-1]) [L547] free(a) VAL [a={-3:0}, b={-2:4}, n=1] [L547] free(a) VAL [a={-3:0}, b={-2:4}, n=1] [L547] free(a) [L547] free(b) VAL [a={-3:0}, b={-2:4}, n=1] - UnprovableResult [Line: 542]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 542]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 530]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 530]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 544]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 544]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 534]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 54 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 11.9s, OverallIterations: 16, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1454 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1454 mSDsluCounter, 1759 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1077 mSDsCounter, 141 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1364 IncrementalHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 141 mSolverCounterUnsat, 682 mSDtfsCounter, 1364 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 239 GetRequests, 126 SyntacticMatches, 4 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=12, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 353 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 303 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 308 ConstructedInterpolants, 0 QuantifiedInterpolants, 2284 SizeOfPredicates, 22 NumberOfNonLiveVariables, 644 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 25 InterpolantComputations, 12 PerfectInterpolantSequences, 64/107 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 proved your program to be incorrect! [2022-02-20 23:48:04,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free)