./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/sll-token-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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/forester-heap/sll-token-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10f8c5ed101296da8e76853e36294f37ed1d85898917b59e645db1ac667d60a8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:36:57,994 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:36:57,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:36:58,027 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:36:58,027 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:36:58,028 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:36:58,034 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:36:58,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:36:58,040 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:36:58,041 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:36:58,042 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:36:58,043 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:36:58,044 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:36:58,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:36:58,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:36:58,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:36:58,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:36:58,058 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:36:58,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:36:58,064 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:36:58,065 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:36:58,066 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:36:58,067 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:36:58,068 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:36:58,070 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:36:58,070 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:36:58,071 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:36:58,071 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:36:58,072 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:36:58,072 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:36:58,073 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:36:58,073 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:36:58,074 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:36:58,075 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:36:58,075 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:36:58,076 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:36:58,076 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:36:58,077 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:36:58,077 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:36:58,078 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:36:58,078 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:36:58,079 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-02-20 23:36:58,100 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:36:58,100 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:36:58,101 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:36:58,101 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:36:58,101 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:36:58,102 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:36:58,102 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:36:58,103 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:36:58,103 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:36:58,103 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:36:58,103 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:36:58,104 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:36:58,104 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:36:58,104 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:36:58,104 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:36:58,105 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:36:58,105 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:36:58,105 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:36:58,105 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:36:58,105 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:36:58,106 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:36:58,106 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:36:58,106 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:36:58,106 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:36:58,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:36:58,107 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:36:58,107 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:36:58,107 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:36:58,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:36:58,108 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-memcleanup) ) 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 -> 10f8c5ed101296da8e76853e36294f37ed1d85898917b59e645db1ac667d60a8 [2022-02-20 23:36:58,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:36:58,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:36:58,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:36:58,339 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:36:58,340 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:36:58,341 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-token-1.i [2022-02-20 23:36:58,407 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4535cfdc0/2b29b688f6404f9e8876693f8cc454eb/FLAGed78ca0da [2022-02-20 23:36:58,782 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:36:58,783 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i [2022-02-20 23:36:58,800 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4535cfdc0/2b29b688f6404f9e8876693f8cc454eb/FLAGed78ca0da [2022-02-20 23:36:59,148 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4535cfdc0/2b29b688f6404f9e8876693f8cc454eb [2022-02-20 23:36:59,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:36:59,152 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:36:59,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:36:59,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:36:59,157 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:36:59,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:36:59" (1/1) ... [2022-02-20 23:36:59,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73118b91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:59, skipping insertion in model container [2022-02-20 23:36:59,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:36:59" (1/1) ... [2022-02-20 23:36:59,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:36:59,192 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:36:59,453 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22162,22175] [2022-02-20 23:36:59,464 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22311,22324] [2022-02-20 23:36:59,465 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22402,22415] [2022-02-20 23:36:59,467 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22484,22497] [2022-02-20 23:36:59,469 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22562,22575] [2022-02-20 23:36:59,473 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22708,22721] [2022-02-20 23:36:59,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:36:59,492 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:36:59,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22162,22175] [2022-02-20 23:36:59,541 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22311,22324] [2022-02-20 23:36:59,542 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22402,22415] [2022-02-20 23:36:59,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22484,22497] [2022-02-20 23:36:59,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22562,22575] [2022-02-20 23:36:59,545 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22708,22721] [2022-02-20 23:36:59,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:36:59,570 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:36:59,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:59 WrapperNode [2022-02-20 23:36:59,571 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:36:59,572 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:36:59,572 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:36:59,573 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:36:59,578 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:36:59" (1/1) ... [2022-02-20 23:36:59,609 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:36:59" (1/1) ... [2022-02-20 23:36:59,634 INFO L137 Inliner]: procedures = 119, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 132 [2022-02-20 23:36:59,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:36:59,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:36:59,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:36:59,636 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:36:59,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:59" (1/1) ... [2022-02-20 23:36:59,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:59" (1/1) ... [2022-02-20 23:36:59,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:59" (1/1) ... [2022-02-20 23:36:59,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:59" (1/1) ... [2022-02-20 23:36:59,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:59" (1/1) ... [2022-02-20 23:36:59,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:59" (1/1) ... [2022-02-20 23:36:59,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:59" (1/1) ... [2022-02-20 23:36:59,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:36:59,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:36:59,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:36:59,681 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:36:59,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:59" (1/1) ... [2022-02-20 23:36:59,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:36:59,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:36:59,709 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:36:59,711 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:36:59,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:36:59,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:36:59,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:36:59,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:36:59,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:36:59,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:36:59,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:36:59,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:36:59,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:36:59,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:36:59,849 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:36:59,859 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:37:00,221 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:37:00,228 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:37:00,228 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2022-02-20 23:37:00,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:37:00 BoogieIcfgContainer [2022-02-20 23:37:00,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:37:00,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:37:00,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:37:00,233 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:37:00,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:36:59" (1/3) ... [2022-02-20 23:37:00,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@198627a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:37:00, skipping insertion in model container [2022-02-20 23:37:00,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:59" (2/3) ... [2022-02-20 23:37:00,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@198627a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:37:00, skipping insertion in model container [2022-02-20 23:37:00,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:37:00" (3/3) ... [2022-02-20 23:37:00,236 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-token-1.i [2022-02-20 23:37:00,240 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:37:00,243 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2022-02-20 23:37:00,276 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:37:00,282 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:37:00,282 INFO L340 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2022-02-20 23:37:00,297 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 64 states have (on average 2.21875) internal successors, (142), 118 states have internal predecessors, (142), 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:37:00,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:37:00,301 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:00,302 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:37:00,302 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2022-02-20 23:37:00,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:00,307 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:37:00,314 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:00,315 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999013556] [2022-02-20 23:37:00,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:00,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:00,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {122#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(14, 2); {122#true} is VALID [2022-02-20 23:37:00,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {122#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet2#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem7#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem13#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {124#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:37:00,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {124#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} assume !(1 == #valid[main_~head~0#1.base]); {123#false} is VALID [2022-02-20 23:37:00,442 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:37:00,442 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:00,442 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999013556] [2022-02-20 23:37:00,443 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999013556] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:00,443 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:00,443 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:37:00,449 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775779017] [2022-02-20 23:37:00,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:00,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-02-20 23:37:00,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:00,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:37:00,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:00,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:37:00,465 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:00,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:37:00,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:37:00,491 INFO L87 Difference]: Start difference. First operand has 119 states, 64 states have (on average 2.21875) internal successors, (142), 118 states have internal predecessors, (142), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:37:00,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:00,742 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2022-02-20 23:37:00,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:37:00,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-02-20 23:37:00,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:00,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:37:00,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2022-02-20 23:37:00,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:37:00,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2022-02-20 23:37:00,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 167 transitions. [2022-02-20 23:37:00,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:00,936 INFO L225 Difference]: With dead ends: 137 [2022-02-20 23:37:00,937 INFO L226 Difference]: Without dead ends: 135 [2022-02-20 23:37:00,938 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:37:00,941 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 94 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:00,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 97 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:37:00,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-02-20 23:37:00,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 115. [2022-02-20 23:37:00,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:00,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 115 states, 63 states have (on average 1.8571428571428572) internal successors, (117), 114 states have internal predecessors, (117), 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:37:00,970 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 115 states, 63 states have (on average 1.8571428571428572) internal successors, (117), 114 states have internal predecessors, (117), 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:37:00,970 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 115 states, 63 states have (on average 1.8571428571428572) internal successors, (117), 114 states have internal predecessors, (117), 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:37:00,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:00,976 INFO L93 Difference]: Finished difference Result 135 states and 138 transitions. [2022-02-20 23:37:00,977 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 138 transitions. [2022-02-20 23:37:00,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:00,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:00,978 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 63 states have (on average 1.8571428571428572) internal successors, (117), 114 states have internal predecessors, (117), 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 135 states. [2022-02-20 23:37:00,979 INFO L87 Difference]: Start difference. First operand has 115 states, 63 states have (on average 1.8571428571428572) internal successors, (117), 114 states have internal predecessors, (117), 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 135 states. [2022-02-20 23:37:00,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:00,984 INFO L93 Difference]: Finished difference Result 135 states and 138 transitions. [2022-02-20 23:37:00,984 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 138 transitions. [2022-02-20 23:37:00,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:00,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:00,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:00,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:00,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 63 states have (on average 1.8571428571428572) internal successors, (117), 114 states have internal predecessors, (117), 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:37:00,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2022-02-20 23:37:00,990 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 3 [2022-02-20 23:37:00,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:00,990 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2022-02-20 23:37:00,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:37:00,991 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2022-02-20 23:37:00,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:37:00,991 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:00,991 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:37:00,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:37:00,992 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2022-02-20 23:37:00,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:00,993 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:37:00,993 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:00,993 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128510467] [2022-02-20 23:37:00,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:00,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:01,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {649#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(14, 2); {649#true} is VALID [2022-02-20 23:37:01,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {649#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet2#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem7#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem13#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {651#(and (<= 8 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:37:01,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {651#(and (<= 8 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} assume !(4 + main_~head~0#1.offset <= #length[main_~head~0#1.base] && 0 <= main_~head~0#1.offset); {650#false} is VALID [2022-02-20 23:37:01,055 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:37:01,055 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:01,056 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128510467] [2022-02-20 23:37:01,059 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128510467] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:01,059 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:01,059 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:37:01,059 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777991502] [2022-02-20 23:37:01,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:01,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-02-20 23:37:01,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:01,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:37:01,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:01,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:37:01,066 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:01,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:37:01,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:37:01,067 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:37:01,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:01,281 INFO L93 Difference]: Finished difference Result 141 states and 143 transitions. [2022-02-20 23:37:01,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:37:01,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-02-20 23:37:01,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:01,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:37:01,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2022-02-20 23:37:01,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:37:01,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2022-02-20 23:37:01,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 145 transitions. [2022-02-20 23:37:01,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:01,430 INFO L225 Difference]: With dead ends: 141 [2022-02-20 23:37:01,430 INFO L226 Difference]: Without dead ends: 141 [2022-02-20 23:37:01,431 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:37:01,432 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 100 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:01,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 99 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:37:01,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-02-20 23:37:01,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 113. [2022-02-20 23:37:01,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:01,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 113 states, 63 states have (on average 1.8253968253968254) internal successors, (115), 112 states have internal predecessors, (115), 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:37:01,442 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 113 states, 63 states have (on average 1.8253968253968254) internal successors, (115), 112 states have internal predecessors, (115), 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:37:01,451 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 113 states, 63 states have (on average 1.8253968253968254) internal successors, (115), 112 states have internal predecessors, (115), 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:37:01,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:01,456 INFO L93 Difference]: Finished difference Result 141 states and 143 transitions. [2022-02-20 23:37:01,456 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 143 transitions. [2022-02-20 23:37:01,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:01,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:01,462 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 63 states have (on average 1.8253968253968254) internal successors, (115), 112 states have internal predecessors, (115), 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 141 states. [2022-02-20 23:37:01,462 INFO L87 Difference]: Start difference. First operand has 113 states, 63 states have (on average 1.8253968253968254) internal successors, (115), 112 states have internal predecessors, (115), 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 141 states. [2022-02-20 23:37:01,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:01,470 INFO L93 Difference]: Finished difference Result 141 states and 143 transitions. [2022-02-20 23:37:01,470 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 143 transitions. [2022-02-20 23:37:01,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:01,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:01,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:01,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:01,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 63 states have (on average 1.8253968253968254) internal successors, (115), 112 states have internal predecessors, (115), 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:37:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2022-02-20 23:37:01,476 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 3 [2022-02-20 23:37:01,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:01,477 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2022-02-20 23:37:01,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:37:01,478 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2022-02-20 23:37:01,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:37:01,478 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:01,478 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:01,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:37:01,480 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2022-02-20 23:37:01,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:01,481 INFO L85 PathProgramCache]: Analyzing trace with hash 59263631, now seen corresponding path program 1 times [2022-02-20 23:37:01,482 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:01,482 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958603961] [2022-02-20 23:37:01,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:01,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:01,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {1190#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(14, 2); {1190#true} is VALID [2022-02-20 23:37:01,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {1190#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet2#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem7#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem13#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {1190#true} is VALID [2022-02-20 23:37:01,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {1190#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1004 {1192#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:37:01,577 INFO L290 TraceCheckUtils]: 3: Hoare triple {1192#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L1004-1 {1192#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:37:01,577 INFO L290 TraceCheckUtils]: 4: Hoare triple {1192#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {1193#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:37:01,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {1193#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1193#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:37:01,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {1193#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {1193#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:37:01,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {1193#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(1 == #valid[main_~x~0#1.base]); {1191#false} is VALID [2022-02-20 23:37:01,579 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:37:01,579 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:01,579 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958603961] [2022-02-20 23:37:01,579 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958603961] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:01,580 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:01,580 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:37:01,582 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859986618] [2022-02-20 23:37:01,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:01,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:37:01,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:01,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:37:01,591 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:37:01,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:37:01,594 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:01,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:37:01,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:37:01,596 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:37:01,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:01,840 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2022-02-20 23:37:01,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:37:01,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:37:01,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:01,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:37:01,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2022-02-20 23:37:01,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:37:01,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2022-02-20 23:37:01,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 139 transitions. [2022-02-20 23:37:01,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:01,963 INFO L225 Difference]: With dead ends: 119 [2022-02-20 23:37:01,963 INFO L226 Difference]: Without dead ends: 119 [2022-02-20 23:37:01,963 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:37:01,964 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 165 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:01,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 68 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:37:01,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-02-20 23:37:01,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 102. [2022-02-20 23:37:01,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:01,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 102 states, 65 states have (on average 1.6307692307692307) internal successors, (106), 101 states have internal predecessors, (106), 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:37:01,969 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 102 states, 65 states have (on average 1.6307692307692307) internal successors, (106), 101 states have internal predecessors, (106), 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:37:01,969 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 102 states, 65 states have (on average 1.6307692307692307) internal successors, (106), 101 states have internal predecessors, (106), 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:37:01,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:01,972 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2022-02-20 23:37:01,972 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2022-02-20 23:37:01,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:01,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:01,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 65 states have (on average 1.6307692307692307) internal successors, (106), 101 states have internal predecessors, (106), 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 119 states. [2022-02-20 23:37:01,973 INFO L87 Difference]: Start difference. First operand has 102 states, 65 states have (on average 1.6307692307692307) internal successors, (106), 101 states have internal predecessors, (106), 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 119 states. [2022-02-20 23:37:01,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:01,976 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2022-02-20 23:37:01,976 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2022-02-20 23:37:01,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:01,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:01,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:01,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:01,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 65 states have (on average 1.6307692307692307) internal successors, (106), 101 states have internal predecessors, (106), 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:37:01,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2022-02-20 23:37:01,979 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 8 [2022-02-20 23:37:01,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:01,979 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2022-02-20 23:37:01,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:37:01,979 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2022-02-20 23:37:01,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:37:01,980 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:01,980 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:01,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:37:01,980 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2022-02-20 23:37:01,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:01,981 INFO L85 PathProgramCache]: Analyzing trace with hash 59263632, now seen corresponding path program 1 times [2022-02-20 23:37:01,981 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:01,981 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103805773] [2022-02-20 23:37:01,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:01,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:02,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {1657#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(14, 2); {1657#true} is VALID [2022-02-20 23:37:02,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {1657#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet2#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem7#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem13#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {1659#(and (<= 8 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:37:02,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {1659#(and (<= 8 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1004 {1659#(and (<= 8 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:37:02,062 INFO L290 TraceCheckUtils]: 3: Hoare triple {1659#(and (<= 8 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L1004-1 {1659#(and (<= 8 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:37:02,063 INFO L290 TraceCheckUtils]: 4: Hoare triple {1659#(and (<= 8 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {1660#(and (<= 8 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} is VALID [2022-02-20 23:37:02,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {1660#(and (<= 8 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1660#(and (<= 8 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} is VALID [2022-02-20 23:37:02,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {1660#(and (<= 8 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {1660#(and (<= 8 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} is VALID [2022-02-20 23:37:02,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {1660#(and (<= 8 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} assume !(4 + (4 + main_~x~0#1.offset) <= #length[main_~x~0#1.base] && 0 <= 4 + main_~x~0#1.offset); {1658#false} is VALID [2022-02-20 23:37:02,065 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:37:02,065 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:02,065 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103805773] [2022-02-20 23:37:02,065 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103805773] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:02,065 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:02,065 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:37:02,066 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320883109] [2022-02-20 23:37:02,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:02,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:37:02,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:02,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:37:02,073 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:37:02,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:37:02,074 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:02,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:37:02,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:37:02,074 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:37:02,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:02,438 INFO L93 Difference]: Finished difference Result 184 states and 188 transitions. [2022-02-20 23:37:02,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:37:02,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:37:02,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:02,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:37:02,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-02-20 23:37:02,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:37:02,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-02-20 23:37:02,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 204 transitions. [2022-02-20 23:37:02,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:02,614 INFO L225 Difference]: With dead ends: 184 [2022-02-20 23:37:02,614 INFO L226 Difference]: Without dead ends: 184 [2022-02-20 23:37:02,614 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:37:02,615 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 193 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:02,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 104 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:37:02,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-02-20 23:37:02,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 133. [2022-02-20 23:37:02,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:02,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 states. Second operand has 133 states, 96 states have (on average 1.5) internal successors, (144), 132 states have internal predecessors, (144), 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:37:02,620 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand has 133 states, 96 states have (on average 1.5) internal successors, (144), 132 states have internal predecessors, (144), 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:37:02,621 INFO L87 Difference]: Start difference. First operand 184 states. Second operand has 133 states, 96 states have (on average 1.5) internal successors, (144), 132 states have internal predecessors, (144), 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:37:02,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:02,625 INFO L93 Difference]: Finished difference Result 184 states and 188 transitions. [2022-02-20 23:37:02,625 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 188 transitions. [2022-02-20 23:37:02,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:02,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:02,626 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 96 states have (on average 1.5) internal successors, (144), 132 states have internal predecessors, (144), 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 184 states. [2022-02-20 23:37:02,626 INFO L87 Difference]: Start difference. First operand has 133 states, 96 states have (on average 1.5) internal successors, (144), 132 states have internal predecessors, (144), 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 184 states. [2022-02-20 23:37:02,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:02,630 INFO L93 Difference]: Finished difference Result 184 states and 188 transitions. [2022-02-20 23:37:02,630 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 188 transitions. [2022-02-20 23:37:02,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:02,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:02,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:02,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:02,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 96 states have (on average 1.5) internal successors, (144), 132 states have internal predecessors, (144), 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:37:02,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2022-02-20 23:37:02,634 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 8 [2022-02-20 23:37:02,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:02,634 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2022-02-20 23:37:02,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:37:02,634 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2022-02-20 23:37:02,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:37:02,634 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:02,635 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:02,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:37:02,635 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2022-02-20 23:37:02,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:02,635 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2022-02-20 23:37:02,636 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:02,636 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137832683] [2022-02-20 23:37:02,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:02,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:02,707 INFO L290 TraceCheckUtils]: 0: Hoare triple {2350#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(14, 2); {2350#true} is VALID [2022-02-20 23:37:02,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {2350#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet2#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem7#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem13#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {2350#true} is VALID [2022-02-20 23:37:02,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {2350#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1004 {2350#true} is VALID [2022-02-20 23:37:02,708 INFO L290 TraceCheckUtils]: 3: Hoare triple {2350#true} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L1004-1 {2350#true} is VALID [2022-02-20 23:37:02,708 INFO L290 TraceCheckUtils]: 4: Hoare triple {2350#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {2350#true} is VALID [2022-02-20 23:37:02,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {2350#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {2350#true} is VALID [2022-02-20 23:37:02,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {2350#true} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8); {2352#(= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1)} is VALID [2022-02-20 23:37:02,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {2352#(= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1)} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1013 {2353#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:37:02,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {2353#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {2353#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:37:02,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {2353#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1014 {2354#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) 1)} is VALID [2022-02-20 23:37:02,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {2354#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2355#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:37:02,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {2355#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(1 == #valid[main_~x~0#1.base]); {2351#false} is VALID [2022-02-20 23:37:02,713 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:37:02,713 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:02,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137832683] [2022-02-20 23:37:02,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137832683] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:02,716 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:02,716 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:37:02,717 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396249353] [2022-02-20 23:37:02,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:02,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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:37:02,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:02,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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:37:02,726 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:37:02,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:37:02,727 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:02,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:37:02,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:37:02,727 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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:37:03,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:03,165 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2022-02-20 23:37:03,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:37:03,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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:37:03,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:03,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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:37:03,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-02-20 23:37:03,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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:37:03,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-02-20 23:37:03,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 107 transitions. [2022-02-20 23:37:03,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:03,256 INFO L225 Difference]: With dead ends: 132 [2022-02-20 23:37:03,256 INFO L226 Difference]: Without dead ends: 132 [2022-02-20 23:37:03,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:37:03,257 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 64 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:03,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 221 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:37:03,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-02-20 23:37:03,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-02-20 23:37:03,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:03,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 132 states, 96 states have (on average 1.4895833333333333) internal successors, (143), 131 states have internal predecessors, (143), 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:37:03,263 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 132 states, 96 states have (on average 1.4895833333333333) internal successors, (143), 131 states have internal predecessors, (143), 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:37:03,263 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 132 states, 96 states have (on average 1.4895833333333333) internal successors, (143), 131 states have internal predecessors, (143), 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:37:03,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:03,266 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2022-02-20 23:37:03,266 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2022-02-20 23:37:03,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:03,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:03,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 96 states have (on average 1.4895833333333333) internal successors, (143), 131 states have internal predecessors, (143), 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 132 states. [2022-02-20 23:37:03,267 INFO L87 Difference]: Start difference. First operand has 132 states, 96 states have (on average 1.4895833333333333) internal successors, (143), 131 states have internal predecessors, (143), 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 132 states. [2022-02-20 23:37:03,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:03,270 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2022-02-20 23:37:03,270 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2022-02-20 23:37:03,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:03,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:03,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:03,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:03,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 96 states have (on average 1.4895833333333333) internal successors, (143), 131 states have internal predecessors, (143), 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:37:03,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2022-02-20 23:37:03,274 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 12 [2022-02-20 23:37:03,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:03,274 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2022-02-20 23:37:03,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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:37:03,274 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2022-02-20 23:37:03,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:37:03,275 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:03,275 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:03,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:37:03,275 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2022-02-20 23:37:03,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:03,276 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2022-02-20 23:37:03,276 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:03,276 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947125776] [2022-02-20 23:37:03,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:03,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:03,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {2894#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(14, 2); {2894#true} is VALID [2022-02-20 23:37:03,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {2894#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet2#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem7#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem13#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {2894#true} is VALID [2022-02-20 23:37:03,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {2894#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1004 {2894#true} is VALID [2022-02-20 23:37:03,359 INFO L290 TraceCheckUtils]: 3: Hoare triple {2894#true} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L1004-1 {2894#true} is VALID [2022-02-20 23:37:03,359 INFO L290 TraceCheckUtils]: 4: Hoare triple {2894#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {2894#true} is VALID [2022-02-20 23:37:03,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {2894#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {2894#true} is VALID [2022-02-20 23:37:03,360 INFO L290 TraceCheckUtils]: 6: Hoare triple {2894#true} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8); {2896#(and (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) 8))} is VALID [2022-02-20 23:37:03,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {2896#(and (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) 8))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1013 {2897#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} is VALID [2022-02-20 23:37:03,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {2897#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {2897#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} is VALID [2022-02-20 23:37:03,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {2897#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1014 {2898#(and (= 8 (select |#length| |ULTIMATE.start_main_#t~mem4#1.base|)) (= |ULTIMATE.start_main_#t~mem4#1.offset| 0))} is VALID [2022-02-20 23:37:03,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {2898#(and (= 8 (select |#length| |ULTIMATE.start_main_#t~mem4#1.base|)) (= |ULTIMATE.start_main_#t~mem4#1.offset| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2899#(and (= (+ (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} is VALID [2022-02-20 23:37:03,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {2899#(and (= (+ (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} assume !(4 + (4 + main_~x~0#1.offset) <= #length[main_~x~0#1.base] && 0 <= 4 + main_~x~0#1.offset); {2895#false} is VALID [2022-02-20 23:37:03,364 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:37:03,364 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:03,364 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947125776] [2022-02-20 23:37:03,364 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947125776] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:03,364 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:03,365 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:37:03,365 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513223258] [2022-02-20 23:37:03,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:03,365 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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:37:03,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:03,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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:37:03,375 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:37:03,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:37:03,375 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:03,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:37:03,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:37:03,376 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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:37:03,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:03,914 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2022-02-20 23:37:03,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:37:03,914 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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:37:03,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:03,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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:37:03,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-02-20 23:37:03,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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:37:03,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-02-20 23:37:03,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 117 transitions. [2022-02-20 23:37:04,002 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:37:04,003 INFO L225 Difference]: With dead ends: 131 [2022-02-20 23:37:04,003 INFO L226 Difference]: Without dead ends: 131 [2022-02-20 23:37:04,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:37:04,004 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 19 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:04,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 302 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:37:04,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-02-20 23:37:04,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 116. [2022-02-20 23:37:04,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:04,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 116 states, 86 states have (on average 1.4651162790697674) internal successors, (126), 115 states have internal predecessors, (126), 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:37:04,008 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 116 states, 86 states have (on average 1.4651162790697674) internal successors, (126), 115 states have internal predecessors, (126), 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:37:04,008 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 116 states, 86 states have (on average 1.4651162790697674) internal successors, (126), 115 states have internal predecessors, (126), 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:37:04,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:04,011 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2022-02-20 23:37:04,011 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2022-02-20 23:37:04,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:04,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:04,012 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 86 states have (on average 1.4651162790697674) internal successors, (126), 115 states have internal predecessors, (126), 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 131 states. [2022-02-20 23:37:04,012 INFO L87 Difference]: Start difference. First operand has 116 states, 86 states have (on average 1.4651162790697674) internal successors, (126), 115 states have internal predecessors, (126), 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 131 states. [2022-02-20 23:37:04,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:04,015 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2022-02-20 23:37:04,016 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2022-02-20 23:37:04,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:04,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:04,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:04,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:04,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 86 states have (on average 1.4651162790697674) internal successors, (126), 115 states have internal predecessors, (126), 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:37:04,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2022-02-20 23:37:04,019 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 12 [2022-02-20 23:37:04,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:04,019 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 126 transitions. [2022-02-20 23:37:04,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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:37:04,020 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2022-02-20 23:37:04,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:37:04,020 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:04,020 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:04,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:37:04,021 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2022-02-20 23:37:04,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:04,021 INFO L85 PathProgramCache]: Analyzing trace with hash 763856048, now seen corresponding path program 1 times [2022-02-20 23:37:04,021 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:04,021 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066703726] [2022-02-20 23:37:04,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:04,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:04,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {3423#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(14, 2); {3423#true} is VALID [2022-02-20 23:37:04,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {3423#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet2#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem7#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem13#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {3423#true} is VALID [2022-02-20 23:37:04,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {3423#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1004 {3423#true} is VALID [2022-02-20 23:37:04,076 INFO L290 TraceCheckUtils]: 3: Hoare triple {3423#true} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L1004-1 {3423#true} is VALID [2022-02-20 23:37:04,076 INFO L290 TraceCheckUtils]: 4: Hoare triple {3423#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {3423#true} is VALID [2022-02-20 23:37:04,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {3423#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {3423#true} is VALID [2022-02-20 23:37:04,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {3423#true} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {3423#true} is VALID [2022-02-20 23:37:04,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {3423#true} SUMMARY for call write~int(1, main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1010-3 {3423#true} is VALID [2022-02-20 23:37:04,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {3423#true} call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8); {3425#(= 1 (select |#valid| |ULTIMATE.start_main_#t~malloc5#1.base|))} is VALID [2022-02-20 23:37:04,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {3425#(= 1 (select |#valid| |ULTIMATE.start_main_#t~malloc5#1.base|))} SUMMARY for call write~$Pointer$(main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1019 {3426#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:37:04,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {3426#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset; {3426#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:37:04,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {3426#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1020 {3427#(= (select |#valid| |ULTIMATE.start_main_#t~mem6#1.base|) 1)} is VALID [2022-02-20 23:37:04,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {3427#(= (select |#valid| |ULTIMATE.start_main_#t~mem6#1.base|) 1)} assume !(1 == #valid[main_#t~mem6#1.base]); {3424#false} is VALID [2022-02-20 23:37:04,082 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:37:04,082 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:04,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066703726] [2022-02-20 23:37:04,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066703726] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:04,083 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:04,083 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:37:04,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215600173] [2022-02-20 23:37:04,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:04,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2022-02-20 23:37:04,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:04,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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:37:04,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:04,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:37:04,096 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:04,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:37:04,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:37:04,097 INFO L87 Difference]: Start difference. First operand 116 states and 126 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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:37:04,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:04,335 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2022-02-20 23:37:04,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:37:04,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2022-02-20 23:37:04,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:04,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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:37:04,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-02-20 23:37:04,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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:37:04,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-02-20 23:37:04,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 95 transitions. [2022-02-20 23:37:04,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:04,420 INFO L225 Difference]: With dead ends: 115 [2022-02-20 23:37:04,420 INFO L226 Difference]: Without dead ends: 115 [2022-02-20 23:37:04,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:37:04,422 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 4 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:04,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 244 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:37:04,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-02-20 23:37:04,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-02-20 23:37:04,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:04,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 115 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 114 states have internal predecessors, (125), 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:37:04,431 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 115 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 114 states have internal predecessors, (125), 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:37:04,431 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 115 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 114 states have internal predecessors, (125), 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:37:04,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:04,434 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2022-02-20 23:37:04,434 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2022-02-20 23:37:04,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:04,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:04,435 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 114 states have internal predecessors, (125), 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 115 states. [2022-02-20 23:37:04,435 INFO L87 Difference]: Start difference. First operand has 115 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 114 states have internal predecessors, (125), 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 115 states. [2022-02-20 23:37:04,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:04,437 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2022-02-20 23:37:04,438 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2022-02-20 23:37:04,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:04,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:04,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:04,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:04,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 114 states have internal predecessors, (125), 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:37:04,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2022-02-20 23:37:04,441 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 13 [2022-02-20 23:37:04,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:04,441 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2022-02-20 23:37:04,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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:37:04,441 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2022-02-20 23:37:04,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:37:04,442 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:04,442 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:04,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:37:04,442 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2022-02-20 23:37:04,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:04,443 INFO L85 PathProgramCache]: Analyzing trace with hash 763856049, now seen corresponding path program 1 times [2022-02-20 23:37:04,443 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:04,443 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961624792] [2022-02-20 23:37:04,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:04,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:04,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {3894#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(14, 2); {3894#true} is VALID [2022-02-20 23:37:04,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {3894#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet2#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem7#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem13#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {3894#true} is VALID [2022-02-20 23:37:04,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {3894#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1004 {3894#true} is VALID [2022-02-20 23:37:04,514 INFO L290 TraceCheckUtils]: 3: Hoare triple {3894#true} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L1004-1 {3894#true} is VALID [2022-02-20 23:37:04,514 INFO L290 TraceCheckUtils]: 4: Hoare triple {3894#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {3894#true} is VALID [2022-02-20 23:37:04,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {3894#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {3894#true} is VALID [2022-02-20 23:37:04,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {3894#true} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {3894#true} is VALID [2022-02-20 23:37:04,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {3894#true} SUMMARY for call write~int(1, main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1010-3 {3894#true} is VALID [2022-02-20 23:37:04,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {3894#true} call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8); {3896#(and (= |ULTIMATE.start_main_#t~malloc5#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc5#1.base|) 8))} is VALID [2022-02-20 23:37:04,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {3896#(and (= |ULTIMATE.start_main_#t~malloc5#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc5#1.base|) 8))} SUMMARY for call write~$Pointer$(main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1019 {3897#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} is VALID [2022-02-20 23:37:04,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {3897#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset; {3897#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} is VALID [2022-02-20 23:37:04,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {3897#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1020 {3898#(and (= (+ (select |#length| |ULTIMATE.start_main_#t~mem6#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_#t~mem6#1.offset| 0))} is VALID [2022-02-20 23:37:04,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {3898#(and (= (+ (select |#length| |ULTIMATE.start_main_#t~mem6#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_#t~mem6#1.offset| 0))} assume !(4 + (4 + main_#t~mem6#1.offset) <= #length[main_#t~mem6#1.base] && 0 <= 4 + main_#t~mem6#1.offset); {3895#false} is VALID [2022-02-20 23:37:04,518 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:37:04,518 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:04,518 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961624792] [2022-02-20 23:37:04,518 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961624792] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:04,518 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:04,518 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:37:04,518 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483314383] [2022-02-20 23:37:04,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:04,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2022-02-20 23:37:04,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:04,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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:37:04,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:04,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:37:04,529 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:04,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:37:04,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:37:04,530 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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:37:04,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:04,805 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2022-02-20 23:37:04,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:37:04,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2022-02-20 23:37:04,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:04,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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:37:04,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-02-20 23:37:04,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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:37:04,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-02-20 23:37:04,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 94 transitions. [2022-02-20 23:37:04,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:04,868 INFO L225 Difference]: With dead ends: 114 [2022-02-20 23:37:04,869 INFO L226 Difference]: Without dead ends: 114 [2022-02-20 23:37:04,869 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:37:04,869 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 2 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:04,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 246 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:37:04,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-02-20 23:37:04,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-02-20 23:37:04,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:04,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 114 states, 86 states have (on average 1.441860465116279) internal successors, (124), 113 states have internal predecessors, (124), 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:37:04,872 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 114 states, 86 states have (on average 1.441860465116279) internal successors, (124), 113 states have internal predecessors, (124), 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:37:04,873 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 114 states, 86 states have (on average 1.441860465116279) internal successors, (124), 113 states have internal predecessors, (124), 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:37:04,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:04,875 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2022-02-20 23:37:04,875 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2022-02-20 23:37:04,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:04,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:04,876 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 86 states have (on average 1.441860465116279) internal successors, (124), 113 states have internal predecessors, (124), 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 114 states. [2022-02-20 23:37:04,876 INFO L87 Difference]: Start difference. First operand has 114 states, 86 states have (on average 1.441860465116279) internal successors, (124), 113 states have internal predecessors, (124), 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 114 states. [2022-02-20 23:37:04,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:04,878 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2022-02-20 23:37:04,878 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2022-02-20 23:37:04,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:04,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:04,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:04,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:04,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 86 states have (on average 1.441860465116279) internal successors, (124), 113 states have internal predecessors, (124), 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:37:04,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2022-02-20 23:37:04,881 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 13 [2022-02-20 23:37:04,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:04,881 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2022-02-20 23:37:04,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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:37:04,882 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2022-02-20 23:37:04,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:37:04,882 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:04,882 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:04,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:37:04,882 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2022-02-20 23:37:04,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:04,883 INFO L85 PathProgramCache]: Analyzing trace with hash 2113337263, now seen corresponding path program 1 times [2022-02-20 23:37:04,883 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:04,883 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123790400] [2022-02-20 23:37:04,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:04,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:04,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {4361#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(14, 2); {4361#true} is VALID [2022-02-20 23:37:04,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {4361#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet2#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem7#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem13#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {4361#true} is VALID [2022-02-20 23:37:04,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {4361#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1004 {4361#true} is VALID [2022-02-20 23:37:04,933 INFO L290 TraceCheckUtils]: 3: Hoare triple {4361#true} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L1004-1 {4361#true} is VALID [2022-02-20 23:37:04,933 INFO L290 TraceCheckUtils]: 4: Hoare triple {4361#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {4361#true} is VALID [2022-02-20 23:37:04,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {4361#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {4361#true} is VALID [2022-02-20 23:37:04,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {4361#true} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8); {4363#(not (= |ULTIMATE.start_main_#t~malloc3#1.base| 0))} is VALID [2022-02-20 23:37:04,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {4363#(not (= |ULTIMATE.start_main_#t~malloc3#1.base| 0))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1013 {4364#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:37:04,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {4364#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {4364#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:37:04,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {4364#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1014 {4365#(not (= |ULTIMATE.start_main_#t~mem4#1.base| 0))} is VALID [2022-02-20 23:37:04,936 INFO L290 TraceCheckUtils]: 10: Hoare triple {4365#(not (= |ULTIMATE.start_main_#t~mem4#1.base| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {4366#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 23:37:04,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {4366#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} SUMMARY for call write~int(0, main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1015 {4366#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 23:37:04,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {4366#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {4362#false} is VALID [2022-02-20 23:37:04,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {4362#false} assume !false; {4362#false} is VALID [2022-02-20 23:37:04,937 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:37:04,937 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:04,937 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123790400] [2022-02-20 23:37:04,938 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123790400] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:04,938 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:04,938 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:37:04,938 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418979928] [2022-02-20 23:37:04,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:04,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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:37:04,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:04,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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:37:04,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:04,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:37:04,949 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:04,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:37:04,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:37:04,949 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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:37:05,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:05,289 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2022-02-20 23:37:05,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:37:05,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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:37:05,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:05,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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:37:05,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2022-02-20 23:37:05,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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:37:05,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2022-02-20 23:37:05,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 106 transitions. [2022-02-20 23:37:05,357 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:37:05,358 INFO L225 Difference]: With dead ends: 125 [2022-02-20 23:37:05,358 INFO L226 Difference]: Without dead ends: 125 [2022-02-20 23:37:05,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:37:05,359 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 16 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:05,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 366 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:37:05,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-02-20 23:37:05,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 112. [2022-02-20 23:37:05,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:05,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 112 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 111 states have internal predecessors, (122), 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:37:05,362 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 112 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 111 states have internal predecessors, (122), 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:37:05,362 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 112 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 111 states have internal predecessors, (122), 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:37:05,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:05,364 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2022-02-20 23:37:05,364 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2022-02-20 23:37:05,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:05,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:05,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 111 states have internal predecessors, (122), 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 125 states. [2022-02-20 23:37:05,365 INFO L87 Difference]: Start difference. First operand has 112 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 111 states have internal predecessors, (122), 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 125 states. [2022-02-20 23:37:05,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:05,370 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2022-02-20 23:37:05,370 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2022-02-20 23:37:05,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:05,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:05,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:05,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:05,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 111 states have internal predecessors, (122), 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:37:05,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2022-02-20 23:37:05,373 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 14 [2022-02-20 23:37:05,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:05,374 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2022-02-20 23:37:05,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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:37:05,374 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2022-02-20 23:37:05,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:37:05,374 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:05,375 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:05,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:37:05,375 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2022-02-20 23:37:05,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:05,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1298827700, now seen corresponding path program 1 times [2022-02-20 23:37:05,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:05,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548596997] [2022-02-20 23:37:05,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:05,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:05,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {4868#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(14, 2); {4868#true} is VALID [2022-02-20 23:37:05,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {4868#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet2#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem7#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem13#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(8);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {4870#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:37:05,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {4870#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1004 {4870#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:37:05,419 INFO L290 TraceCheckUtils]: 3: Hoare triple {4870#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L1004-1 {4870#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:37:05,419 INFO L290 TraceCheckUtils]: 4: Hoare triple {4870#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {4870#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:37:05,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {4870#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {4870#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:37:05,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {4870#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {4870#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:37:05,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {4870#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} SUMMARY for call write~int(1, main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1010-3 {4870#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:37:05,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {4870#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8); {4870#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:37:05,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {4870#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} SUMMARY for call write~$Pointer$(main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1019 {4870#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:37:05,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {4870#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset; {4870#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:37:05,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {4870#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1020 {4870#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:37:05,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {4870#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} SUMMARY for call write~int(2, main_#t~mem6#1.base, 4 + main_#t~mem6#1.offset, 4); srcloc: L1020-1 {4870#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:37:05,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {4870#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {4871#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 23:37:05,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {4871#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {4869#false} is VALID [2022-02-20 23:37:05,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {4869#false} assume !false; {4869#false} is VALID [2022-02-20 23:37:05,424 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:37:05,424 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:37:05,424 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548596997] [2022-02-20 23:37:05,424 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548596997] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:05,424 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:05,424 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:37:05,424 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976332208] [2022-02-20 23:37:05,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:05,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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 16 [2022-02-20 23:37:05,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:05,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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:37:05,437 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:37:05,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:37:05,437 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:05,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:37:05,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:37:05,438 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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:37:05,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:05,618 INFO L93 Difference]: Finished difference Result 168 states and 173 transitions. [2022-02-20 23:37:05,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:37:05,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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 16 [2022-02-20 23:37:05,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:05,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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:37:05,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 174 transitions. [2022-02-20 23:37:05,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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:37:05,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 174 transitions. [2022-02-20 23:37:05,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 174 transitions. [2022-02-20 23:37:05,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:05,746 INFO L225 Difference]: With dead ends: 168 [2022-02-20 23:37:05,747 INFO L226 Difference]: Without dead ends: 168 [2022-02-20 23:37:05,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:37:05,747 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 165 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:05,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 131 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:37:05,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-02-20 23:37:05,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 110. [2022-02-20 23:37:05,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:05,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand has 110 states, 84 states have (on average 1.4285714285714286) internal successors, (120), 109 states have internal predecessors, (120), 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:37:05,750 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand has 110 states, 84 states have (on average 1.4285714285714286) internal successors, (120), 109 states have internal predecessors, (120), 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:37:05,751 INFO L87 Difference]: Start difference. First operand 168 states. Second operand has 110 states, 84 states have (on average 1.4285714285714286) internal successors, (120), 109 states have internal predecessors, (120), 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:37:05,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:05,754 INFO L93 Difference]: Finished difference Result 168 states and 173 transitions. [2022-02-20 23:37:05,754 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 173 transitions. [2022-02-20 23:37:05,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:05,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:05,754 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 84 states have (on average 1.4285714285714286) internal successors, (120), 109 states have internal predecessors, (120), 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 168 states. [2022-02-20 23:37:05,755 INFO L87 Difference]: Start difference. First operand has 110 states, 84 states have (on average 1.4285714285714286) internal successors, (120), 109 states have internal predecessors, (120), 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 168 states. [2022-02-20 23:37:05,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:05,760 INFO L93 Difference]: Finished difference Result 168 states and 173 transitions. [2022-02-20 23:37:05,761 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 173 transitions. [2022-02-20 23:37:05,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:05,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:05,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:05,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:05,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 84 states have (on average 1.4285714285714286) internal successors, (120), 109 states have internal predecessors, (120), 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:37:05,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2022-02-20 23:37:05,770 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 16 [2022-02-20 23:37:05,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:05,770 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2022-02-20 23:37:05,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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:37:05,771 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2022-02-20 23:37:05,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:37:05,771 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:05,771 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, 1] [2022-02-20 23:37:05,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:37:05,772 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2022-02-20 23:37:05,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:05,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1685750883, now seen corresponding path program 1 times [2022-02-20 23:37:05,772 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:37:05,773 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937343003] [2022-02-20 23:37:05,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:05,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:37:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:37:05,840 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:37:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:37:05,892 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 23:37:05,892 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:37:05,892 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK (53 of 54 remaining) [2022-02-20 23:37:05,895 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (52 of 54 remaining) [2022-02-20 23:37:05,896 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (51 of 54 remaining) [2022-02-20 23:37:05,896 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (50 of 54 remaining) [2022-02-20 23:37:05,896 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (49 of 54 remaining) [2022-02-20 23:37:05,896 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (48 of 54 remaining) [2022-02-20 23:37:05,896 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (47 of 54 remaining) [2022-02-20 23:37:05,896 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (46 of 54 remaining) [2022-02-20 23:37:05,896 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (45 of 54 remaining) [2022-02-20 23:37:05,896 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (44 of 54 remaining) [2022-02-20 23:37:05,896 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (43 of 54 remaining) [2022-02-20 23:37:05,897 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (42 of 54 remaining) [2022-02-20 23:37:05,897 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (41 of 54 remaining) [2022-02-20 23:37:05,897 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (40 of 54 remaining) [2022-02-20 23:37:05,897 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (39 of 54 remaining) [2022-02-20 23:37:05,897 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (38 of 54 remaining) [2022-02-20 23:37:05,897 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (37 of 54 remaining) [2022-02-20 23:37:05,897 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (36 of 54 remaining) [2022-02-20 23:37:05,897 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (35 of 54 remaining) [2022-02-20 23:37:05,897 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (34 of 54 remaining) [2022-02-20 23:37:05,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (33 of 54 remaining) [2022-02-20 23:37:05,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (32 of 54 remaining) [2022-02-20 23:37:05,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (31 of 54 remaining) [2022-02-20 23:37:05,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (30 of 54 remaining) [2022-02-20 23:37:05,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (29 of 54 remaining) [2022-02-20 23:37:05,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (28 of 54 remaining) [2022-02-20 23:37:05,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (27 of 54 remaining) [2022-02-20 23:37:05,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (26 of 54 remaining) [2022-02-20 23:37:05,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (25 of 54 remaining) [2022-02-20 23:37:05,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (24 of 54 remaining) [2022-02-20 23:37:05,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (23 of 54 remaining) [2022-02-20 23:37:05,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (22 of 54 remaining) [2022-02-20 23:37:05,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (21 of 54 remaining) [2022-02-20 23:37:05,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (20 of 54 remaining) [2022-02-20 23:37:05,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (19 of 54 remaining) [2022-02-20 23:37:05,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (18 of 54 remaining) [2022-02-20 23:37:05,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (17 of 54 remaining) [2022-02-20 23:37:05,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (16 of 54 remaining) [2022-02-20 23:37:05,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (15 of 54 remaining) [2022-02-20 23:37:05,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE (14 of 54 remaining) [2022-02-20 23:37:05,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE (13 of 54 remaining) [2022-02-20 23:37:05,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (12 of 54 remaining) [2022-02-20 23:37:05,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION (11 of 54 remaining) [2022-02-20 23:37:05,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION (10 of 54 remaining) [2022-02-20 23:37:05,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (9 of 54 remaining) [2022-02-20 23:37:05,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION (8 of 54 remaining) [2022-02-20 23:37:05,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION (7 of 54 remaining) [2022-02-20 23:37:05,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE (6 of 54 remaining) [2022-02-20 23:37:05,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE (5 of 54 remaining) [2022-02-20 23:37:05,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE (4 of 54 remaining) [2022-02-20 23:37:05,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE (3 of 54 remaining) [2022-02-20 23:37:05,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE (2 of 54 remaining) [2022-02-20 23:37:05,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE (1 of 54 remaining) [2022-02-20 23:37:05,902 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK (0 of 54 remaining) [2022-02-20 23:37:05,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 23:37:05,906 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:05,908 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:37:05,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:37:05 BoogieIcfgContainer [2022-02-20 23:37:05,928 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:37:05,929 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:37:05,929 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:37:05,929 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:37:05,929 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:37:00" (3/4) ... [2022-02-20 23:37:05,931 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 23:37:05,961 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 23:37:05,962 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:37:05,963 INFO L158 Benchmark]: Toolchain (without parser) took 6810.84ms. Allocated memory was 86.0MB in the beginning and 134.2MB in the end (delta: 48.2MB). Free memory was 51.0MB in the beginning and 84.6MB in the end (delta: -33.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 23:37:05,963 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 86.0MB. Free memory was 56.3MB in the beginning and 56.3MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:37:05,963 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.65ms. Allocated memory was 86.0MB in the beginning and 111.1MB in the end (delta: 25.2MB). Free memory was 50.8MB in the beginning and 80.0MB in the end (delta: -29.2MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2022-02-20 23:37:05,963 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.07ms. Allocated memory is still 111.1MB. Free memory was 80.0MB in the beginning and 77.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:37:05,964 INFO L158 Benchmark]: Boogie Preprocessor took 44.13ms. Allocated memory is still 111.1MB. Free memory was 77.5MB in the beginning and 75.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:37:05,964 INFO L158 Benchmark]: RCFGBuilder took 549.04ms. Allocated memory is still 111.1MB. Free memory was 75.4MB in the beginning and 78.4MB in the end (delta: -3.0MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2022-02-20 23:37:05,964 INFO L158 Benchmark]: TraceAbstraction took 5697.98ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 77.7MB in the beginning and 87.7MB in the end (delta: -10.0MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2022-02-20 23:37:05,964 INFO L158 Benchmark]: Witness Printer took 32.83ms. Allocated memory is still 134.2MB. Free memory was 87.7MB in the beginning and 84.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:37:05,966 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.18ms. Allocated memory is still 86.0MB. Free memory was 56.3MB in the beginning and 56.3MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 417.65ms. Allocated memory was 86.0MB in the beginning and 111.1MB in the end (delta: 25.2MB). Free memory was 50.8MB in the beginning and 80.0MB in the end (delta: -29.2MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.07ms. Allocated memory is still 111.1MB. Free memory was 80.0MB in the beginning and 77.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.13ms. Allocated memory is still 111.1MB. Free memory was 77.5MB in the beginning and 75.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 549.04ms. Allocated memory is still 111.1MB. Free memory was 75.4MB in the beginning and 78.4MB in the end (delta: -3.0MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5697.98ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 77.7MB in the beginning and 87.7MB in the end (delta: -10.0MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * Witness Printer took 32.83ms. Allocated memory is still 134.2MB. Free memory was 87.7MB in the beginning and 84.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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: 1031]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1003] SLL* head = malloc(sizeof(SLL)); [L1004] head->next = ((void*)0) VAL [head={-1:0}] [L1005] head->data = 0 VAL [head={-1:0}] [L1007] SLL* x = head; VAL [head={-1:0}, x={-1:0}] [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1018] x->data = 1 VAL [head={-1:0}, x={-1:0}] [L1019] x->next = malloc(sizeof(SLL)) VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}] [L1020] EXPR x->next VAL [head={-1:0}, x={-1:0}, x->next={-2:0}] [L1020] x->next->data = 2 VAL [head={-1:0}, x={-1:0}, x->next={-2:0}] [L1022] x = head VAL [head={-1:0}, x={-1:0}] [L1024] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, x={-1:0}] [L1026] EXPR x->data VAL [head={-1:0}, x={-1:0}, x->data=1] [L1026] COND FALSE !(1 != x->data) [L1031] EXPR x->data VAL [head={-1:0}, x={-1:0}, x->data=1] [L1031] COND TRUE !(2 == x->data) [L1031] reach_error() VAL [head={-1:0}, x={-1:0}] - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: 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, 119 locations, 54 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 822 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 822 mSDsluCounter, 1878 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1127 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1231 IncrementalHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 751 mSDtfsCounter, 1231 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=4, InterpolantAutomatonStates: 64, 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, 10 MinimizatonAttempts, 202 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 397 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 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:37:06,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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-memcleanup)