./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/dll-token-2.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/dll-token-2.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 820401b0140b0bfb9dffe62418c7fb9ec2170c8bc6edd71581a88d2ffbcfa1c6 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:36:31,261 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:36:31,263 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:36:31,294 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:36:31,294 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:36:31,297 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:36:31,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:36:31,302 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:36:31,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:36:31,306 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:36:31,307 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:36:31,308 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:36:31,308 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:36:31,310 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:36:31,310 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:36:31,313 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:36:31,314 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:36:31,314 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:36:31,316 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:36:31,320 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:36:31,321 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:36:31,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:36:31,322 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:36:31,323 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:36:31,327 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:36:31,328 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:36:31,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:36:31,329 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:36:31,329 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:36:31,330 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:36:31,330 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:36:31,331 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:36:31,332 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:36:31,333 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:36:31,334 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:36:31,334 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:36:31,334 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:36:31,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:36:31,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:36:31,335 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:36:31,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:36:31,337 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:31,358 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:36:31,359 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:36:31,359 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:36:31,359 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:36:31,360 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:36:31,360 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:36:31,360 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:36:31,361 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:36:31,361 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:36:31,361 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:36:31,361 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:36:31,362 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:36:31,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:36:31,362 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:36:31,362 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:36:31,362 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:36:31,362 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:36:31,362 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:36:31,363 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:36:31,363 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:36:31,363 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:36:31,363 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:36:31,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:36:31,363 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:36:31,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:36:31,364 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:36:31,364 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:36:31,364 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:36:31,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:36:31,365 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 -> 820401b0140b0bfb9dffe62418c7fb9ec2170c8bc6edd71581a88d2ffbcfa1c6 [2022-02-20 23:36:31,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:36:31,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:36:31,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:36:31,566 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:36:31,567 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:36:31,568 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-token-2.i [2022-02-20 23:36:31,655 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3e5be2b5/1890d1f288a64438b51f5914cd74853a/FLAGc58ea7e3b [2022-02-20 23:36:31,975 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:36:31,975 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-2.i [2022-02-20 23:36:31,983 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3e5be2b5/1890d1f288a64438b51f5914cd74853a/FLAGc58ea7e3b [2022-02-20 23:36:32,381 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3e5be2b5/1890d1f288a64438b51f5914cd74853a [2022-02-20 23:36:32,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:36:32,386 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:36:32,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:36:32,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:36:32,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:36:32,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:36:32" (1/1) ... [2022-02-20 23:36:32,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d4dfb83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:32, skipping insertion in model container [2022-02-20 23:36:32,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:36:32" (1/1) ... [2022-02-20 23:36:32,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:36:32,436 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:36:32,652 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/dll-token-2.i[22229,22242] [2022-02-20 23:36:32,658 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/dll-token-2.i[22398,22411] [2022-02-20 23:36:32,659 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/dll-token-2.i[22489,22502] [2022-02-20 23:36:32,659 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/dll-token-2.i[22571,22584] [2022-02-20 23:36:32,660 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/dll-token-2.i[22649,22662] [2022-02-20 23:36:32,662 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/dll-token-2.i[22795,22808] [2022-02-20 23:36:32,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:36:32,674 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:36:32,706 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/dll-token-2.i[22229,22242] [2022-02-20 23:36:32,721 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/dll-token-2.i[22398,22411] [2022-02-20 23:36:32,722 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/dll-token-2.i[22489,22502] [2022-02-20 23:36:32,728 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/dll-token-2.i[22571,22584] [2022-02-20 23:36:32,728 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/dll-token-2.i[22649,22662] [2022-02-20 23:36:32,737 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/dll-token-2.i[22795,22808] [2022-02-20 23:36:32,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:36:32,763 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:36:32,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:32 WrapperNode [2022-02-20 23:36:32,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:36:32,764 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:36:32,765 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:36:32,765 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:36:32,770 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:32" (1/1) ... [2022-02-20 23:36:32,796 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:32" (1/1) ... [2022-02-20 23:36:32,819 INFO L137 Inliner]: procedures = 119, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 139 [2022-02-20 23:36:32,819 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:36:32,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:36:32,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:36:32,820 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:36:32,826 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:32" (1/1) ... [2022-02-20 23:36:32,827 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:32" (1/1) ... [2022-02-20 23:36:32,832 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:32" (1/1) ... [2022-02-20 23:36:32,834 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:32" (1/1) ... [2022-02-20 23:36:32,846 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:32" (1/1) ... [2022-02-20 23:36:32,857 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:32" (1/1) ... [2022-02-20 23:36:32,859 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:32" (1/1) ... [2022-02-20 23:36:32,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:36:32,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:36:32,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:36:32,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:36:32,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:32" (1/1) ... [2022-02-20 23:36:32,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:36:32,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:36:32,914 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:32,919 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:32,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:36:32,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:36:32,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:36:32,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:36:32,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:36:32,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:36:32,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:36:32,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:36:32,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:36:32,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:36:33,025 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:36:33,026 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:36:33,520 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:36:33,526 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:36:33,529 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2022-02-20 23:36:33,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:36:33 BoogieIcfgContainer [2022-02-20 23:36:33,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:36:33,534 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:36:33,534 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:36:33,537 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:36:33,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:36:32" (1/3) ... [2022-02-20 23:36:33,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5edac02c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:36:33, skipping insertion in model container [2022-02-20 23:36:33,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:32" (2/3) ... [2022-02-20 23:36:33,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5edac02c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:36:33, skipping insertion in model container [2022-02-20 23:36:33,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:36:33" (3/3) ... [2022-02-20 23:36:33,540 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-token-2.i [2022-02-20 23:36:33,544 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:36:33,544 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2022-02-20 23:36:33,578 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:36:33,582 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:36:33,582 INFO L340 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2022-02-20 23:36:33,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 71 states have (on average 2.23943661971831) internal successors, (159), 135 states have internal predecessors, (159), 0 states have call successors, (0), 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:36:33,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:36:33,599 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:33,600 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:36:33,600 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2022-02-20 23:36:33,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:33,603 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:36:33,610 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:33,610 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011569046] [2022-02-20 23:36:33,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:33,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:33,758 INFO L290 TraceCheckUtils]: 0: Hoare triple {139#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); {139#true} is VALID [2022-02-20 23:36:33,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {139#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~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem9#1, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#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(12);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; {141#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:33,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} assume !(1 == #valid[main_~head~0#1.base]); {140#false} is VALID [2022-02-20 23:36:33,763 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:36:33,763 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:33,763 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011569046] [2022-02-20 23:36:33,764 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011569046] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:33,765 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:33,765 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:36:33,766 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428811528] [2022-02-20 23:36:33,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:33,771 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:36:33,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:33,774 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:36:33,794 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:36:33,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:36:33,795 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:33,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:36:33,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:33,818 INFO L87 Difference]: Start difference. First operand has 136 states, 71 states have (on average 2.23943661971831) internal successors, (159), 135 states have internal predecessors, (159), 0 states have call successors, (0), 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:36:34,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:34,112 INFO L93 Difference]: Finished difference Result 153 states and 156 transitions. [2022-02-20 23:36:34,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:36:34,113 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:36:34,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:34,114 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:36:34,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 184 transitions. [2022-02-20 23:36:34,120 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:36:34,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 184 transitions. [2022-02-20 23:36:34,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 184 transitions. [2022-02-20 23:36:34,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:34,261 INFO L225 Difference]: With dead ends: 153 [2022-02-20 23:36:34,261 INFO L226 Difference]: Without dead ends: 151 [2022-02-20 23:36:34,262 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:36:34,287 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 110 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:34,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 103 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:34,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-02-20 23:36:34,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 131. [2022-02-20 23:36:34,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:34,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand has 131 states, 70 states have (on average 1.9) internal successors, (133), 130 states have internal predecessors, (133), 0 states have call successors, (0), 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:36:34,331 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand has 131 states, 70 states have (on average 1.9) internal successors, (133), 130 states have internal predecessors, (133), 0 states have call successors, (0), 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:36:34,332 INFO L87 Difference]: Start difference. First operand 151 states. Second operand has 131 states, 70 states have (on average 1.9) internal successors, (133), 130 states have internal predecessors, (133), 0 states have call successors, (0), 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:36:34,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:34,337 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2022-02-20 23:36:34,338 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 154 transitions. [2022-02-20 23:36:34,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:34,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:34,339 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 70 states have (on average 1.9) internal successors, (133), 130 states have internal predecessors, (133), 0 states have call successors, (0), 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 151 states. [2022-02-20 23:36:34,340 INFO L87 Difference]: Start difference. First operand has 131 states, 70 states have (on average 1.9) internal successors, (133), 130 states have internal predecessors, (133), 0 states have call successors, (0), 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 151 states. [2022-02-20 23:36:34,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:34,344 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2022-02-20 23:36:34,345 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 154 transitions. [2022-02-20 23:36:34,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:34,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:34,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:34,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:34,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 70 states have (on average 1.9) internal successors, (133), 130 states have internal predecessors, (133), 0 states have call successors, (0), 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:36:34,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2022-02-20 23:36:34,350 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 3 [2022-02-20 23:36:34,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:34,351 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2022-02-20 23:36:34,351 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:36:34,351 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2022-02-20 23:36:34,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:36:34,352 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:34,352 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:36:34,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:36:34,352 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2022-02-20 23:36:34,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:34,353 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:36:34,353 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:34,353 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964030260] [2022-02-20 23:36:34,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:34,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:34,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {730#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); {730#true} is VALID [2022-02-20 23:36:34,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {730#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~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem9#1, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#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(12);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; {732#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:36:34,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {732#(and (<= 12 (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); {731#false} is VALID [2022-02-20 23:36:34,389 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:36:34,389 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:34,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964030260] [2022-02-20 23:36:34,390 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964030260] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:34,390 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:34,390 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:36:34,390 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261443072] [2022-02-20 23:36:34,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:34,392 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:36:34,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:34,392 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:36:34,395 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:36:34,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:36:34,395 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:34,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:36:34,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:34,396 INFO L87 Difference]: Start difference. First operand 131 states and 133 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:36:34,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:34,570 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2022-02-20 23:36:34,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:36:34,570 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:36:34,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:34,571 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:36:34,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2022-02-20 23:36:34,573 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:36:34,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2022-02-20 23:36:34,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 161 transitions. [2022-02-20 23:36:34,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:34,697 INFO L225 Difference]: With dead ends: 156 [2022-02-20 23:36:34,697 INFO L226 Difference]: Without dead ends: 156 [2022-02-20 23:36:34,698 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:36:34,698 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 115 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:34,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 105 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:36:34,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-02-20 23:36:34,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 128. [2022-02-20 23:36:34,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:34,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand has 128 states, 70 states have (on average 1.8571428571428572) internal successors, (130), 127 states have internal predecessors, (130), 0 states have call successors, (0), 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:36:34,704 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand has 128 states, 70 states have (on average 1.8571428571428572) internal successors, (130), 127 states have internal predecessors, (130), 0 states have call successors, (0), 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:36:34,704 INFO L87 Difference]: Start difference. First operand 156 states. Second operand has 128 states, 70 states have (on average 1.8571428571428572) internal successors, (130), 127 states have internal predecessors, (130), 0 states have call successors, (0), 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:36:34,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:34,708 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2022-02-20 23:36:34,708 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 158 transitions. [2022-02-20 23:36:34,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:34,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:34,709 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 70 states have (on average 1.8571428571428572) internal successors, (130), 127 states have internal predecessors, (130), 0 states have call successors, (0), 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 156 states. [2022-02-20 23:36:34,710 INFO L87 Difference]: Start difference. First operand has 128 states, 70 states have (on average 1.8571428571428572) internal successors, (130), 127 states have internal predecessors, (130), 0 states have call successors, (0), 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 156 states. [2022-02-20 23:36:34,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:34,713 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2022-02-20 23:36:34,714 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 158 transitions. [2022-02-20 23:36:34,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:34,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:34,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:34,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:34,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 70 states have (on average 1.8571428571428572) internal successors, (130), 127 states have internal predecessors, (130), 0 states have call successors, (0), 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:36:34,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2022-02-20 23:36:34,718 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 3 [2022-02-20 23:36:34,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:34,718 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2022-02-20 23:36:34,718 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:36:34,719 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2022-02-20 23:36:34,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:36:34,719 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:34,719 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:34,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:36:34,719 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2022-02-20 23:36:34,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:34,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112020, now seen corresponding path program 1 times [2022-02-20 23:36:34,720 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:34,720 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991135797] [2022-02-20 23:36:34,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:34,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:34,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {1331#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); {1331#true} is VALID [2022-02-20 23:36:34,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {1331#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~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem9#1, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#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(12);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; {1333#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:36:34,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {1333#(and (<= 12 (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: L1005 {1333#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:36:34,791 INFO L290 TraceCheckUtils]: 3: Hoare triple {1333#(and (<= 12 (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, 4 + main_~head~0#1.offset, 4); srcloc: L1005-1 {1333#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:36:34,791 INFO L290 TraceCheckUtils]: 4: Hoare triple {1333#(and (<= 12 (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, 8 + main_~head~0#1.offset, 4); srcloc: L1006 {1333#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:36:34,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {1333#(and (<= 12 (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; {1334#(and (<= 12 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} is VALID [2022-02-20 23:36:34,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {1334#(and (<= 12 (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; {1334#(and (<= 12 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} is VALID [2022-02-20 23:36:34,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {1334#(and (<= 12 (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; {1334#(and (<= 12 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} is VALID [2022-02-20 23:36:34,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {1334#(and (<= 12 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} assume !(4 + (8 + main_~x~0#1.offset) <= #length[main_~x~0#1.base] && 0 <= 8 + main_~x~0#1.offset); {1332#false} is VALID [2022-02-20 23:36:34,793 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:36:34,794 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:34,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991135797] [2022-02-20 23:36:34,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991135797] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:34,794 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:34,794 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:36:34,794 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804115852] [2022-02-20 23:36:34,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:34,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:36:34,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:34,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:34,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:34,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:36:34,803 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:34,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:36:34,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:36:34,804 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:35,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:35,224 INFO L93 Difference]: Finished difference Result 241 states and 245 transitions. [2022-02-20 23:36:35,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:36:35,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:36:35,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:35,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:35,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 263 transitions. [2022-02-20 23:36:35,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:35,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 263 transitions. [2022-02-20 23:36:35,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 263 transitions. [2022-02-20 23:36:35,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 263 edges. 263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:35,417 INFO L225 Difference]: With dead ends: 241 [2022-02-20 23:36:35,417 INFO L226 Difference]: Without dead ends: 241 [2022-02-20 23:36:35,418 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:36:35,420 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 271 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:35,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 113 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:35,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-02-20 23:36:35,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 167. [2022-02-20 23:36:35,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:35,434 INFO L82 GeneralOperation]: Start isEquivalent. First operand 241 states. Second operand has 167 states, 109 states have (on average 1.81651376146789) internal successors, (198), 166 states have internal predecessors, (198), 0 states have call successors, (0), 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:36:35,437 INFO L74 IsIncluded]: Start isIncluded. First operand 241 states. Second operand has 167 states, 109 states have (on average 1.81651376146789) internal successors, (198), 166 states have internal predecessors, (198), 0 states have call successors, (0), 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:36:35,438 INFO L87 Difference]: Start difference. First operand 241 states. Second operand has 167 states, 109 states have (on average 1.81651376146789) internal successors, (198), 166 states have internal predecessors, (198), 0 states have call successors, (0), 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:36:35,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:35,446 INFO L93 Difference]: Finished difference Result 241 states and 245 transitions. [2022-02-20 23:36:35,447 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 245 transitions. [2022-02-20 23:36:35,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:35,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:35,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 109 states have (on average 1.81651376146789) internal successors, (198), 166 states have internal predecessors, (198), 0 states have call successors, (0), 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 241 states. [2022-02-20 23:36:35,453 INFO L87 Difference]: Start difference. First operand has 167 states, 109 states have (on average 1.81651376146789) internal successors, (198), 166 states have internal predecessors, (198), 0 states have call successors, (0), 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 241 states. [2022-02-20 23:36:35,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:35,463 INFO L93 Difference]: Finished difference Result 241 states and 245 transitions. [2022-02-20 23:36:35,464 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 245 transitions. [2022-02-20 23:36:35,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:35,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:35,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:35,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:35,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 109 states have (on average 1.81651376146789) internal successors, (198), 166 states have internal predecessors, (198), 0 states have call successors, (0), 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:36:35,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 198 transitions. [2022-02-20 23:36:35,469 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 198 transitions. Word has length 9 [2022-02-20 23:36:35,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:35,469 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 198 transitions. [2022-02-20 23:36:35,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:35,470 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 198 transitions. [2022-02-20 23:36:35,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:36:35,470 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:35,470 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:35,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:36:35,471 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2022-02-20 23:36:35,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:35,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112019, now seen corresponding path program 1 times [2022-02-20 23:36:35,472 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:35,472 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458033786] [2022-02-20 23:36:35,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:35,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:35,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {2229#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); {2229#true} is VALID [2022-02-20 23:36:35,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {2229#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~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem9#1, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#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(12);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; {2229#true} is VALID [2022-02-20 23:36:35,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {2229#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1005 {2231#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:35,576 INFO L290 TraceCheckUtils]: 3: Hoare triple {2231#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L1005-1 {2231#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:35,576 INFO L290 TraceCheckUtils]: 4: Hoare triple {2231#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L1006 {2231#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:35,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {2231#(= (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; {2232#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:36:35,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {2232#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {2232#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:36:35,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {2232#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {2232#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:36:35,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {2232#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(1 == #valid[main_~x~0#1.base]); {2230#false} is VALID [2022-02-20 23:36:35,578 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:36:35,578 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:35,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458033786] [2022-02-20 23:36:35,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458033786] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:35,579 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:35,579 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:36:35,579 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381079473] [2022-02-20 23:36:35,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:35,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:36:35,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:35,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:35,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:35,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:36:35,587 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:35,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:36:35,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:36:35,587 INFO L87 Difference]: Start difference. First operand 167 states and 198 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:35,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:35,830 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2022-02-20 23:36:35,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:36:35,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:36:35,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:35,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:35,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2022-02-20 23:36:35,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:35,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2022-02-20 23:36:35,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 150 transitions. [2022-02-20 23:36:35,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:35,945 INFO L225 Difference]: With dead ends: 157 [2022-02-20 23:36:35,945 INFO L226 Difference]: Without dead ends: 157 [2022-02-20 23:36:35,945 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:36:35,946 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 181 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:35,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 74 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:35,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-02-20 23:36:35,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 152. [2022-02-20 23:36:35,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:35,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 152 states, 109 states have (on average 1.5321100917431192) internal successors, (167), 151 states have internal predecessors, (167), 0 states have call successors, (0), 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:36:35,952 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 152 states, 109 states have (on average 1.5321100917431192) internal successors, (167), 151 states have internal predecessors, (167), 0 states have call successors, (0), 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:36:35,952 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 152 states, 109 states have (on average 1.5321100917431192) internal successors, (167), 151 states have internal predecessors, (167), 0 states have call successors, (0), 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:36:35,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:35,956 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2022-02-20 23:36:35,956 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 168 transitions. [2022-02-20 23:36:35,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:35,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:35,957 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 109 states have (on average 1.5321100917431192) internal successors, (167), 151 states have internal predecessors, (167), 0 states have call successors, (0), 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 157 states. [2022-02-20 23:36:35,957 INFO L87 Difference]: Start difference. First operand has 152 states, 109 states have (on average 1.5321100917431192) internal successors, (167), 151 states have internal predecessors, (167), 0 states have call successors, (0), 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 157 states. [2022-02-20 23:36:35,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:35,960 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2022-02-20 23:36:35,961 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 168 transitions. [2022-02-20 23:36:35,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:35,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:35,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:35,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:35,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 109 states have (on average 1.5321100917431192) internal successors, (167), 151 states have internal predecessors, (167), 0 states have call successors, (0), 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:36:35,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 167 transitions. [2022-02-20 23:36:35,965 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 167 transitions. Word has length 9 [2022-02-20 23:36:35,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:35,965 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 167 transitions. [2022-02-20 23:36:35,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:35,966 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2022-02-20 23:36:35,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:36:35,966 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:35,966 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:35,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:36:35,967 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2022-02-20 23:36:35,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:35,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2022-02-20 23:36:35,968 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:35,968 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678968836] [2022-02-20 23:36:35,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:35,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:36,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {2860#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); {2860#true} is VALID [2022-02-20 23:36:36,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {2860#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~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem9#1, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#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(12);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; {2860#true} is VALID [2022-02-20 23:36:36,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {2860#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1005 {2860#true} is VALID [2022-02-20 23:36:36,033 INFO L290 TraceCheckUtils]: 3: Hoare triple {2860#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L1005-1 {2860#true} is VALID [2022-02-20 23:36:36,033 INFO L290 TraceCheckUtils]: 4: Hoare triple {2860#true} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L1006 {2860#true} is VALID [2022-02-20 23:36:36,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {2860#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {2860#true} is VALID [2022-02-20 23:36:36,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {2860#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {2860#true} is VALID [2022-02-20 23:36:36,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {2860#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(12); {2862#(and (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) 12))} is VALID [2022-02-20 23:36:36,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {2862#(and (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) 12))} 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: L1015 {2863#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:36,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {2863#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |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; {2863#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:36,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {2863#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |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: L1016 {2864#(and (= |ULTIMATE.start_main_#t~mem4#1.offset| 0) (= (+ (- 12) (select |#length| |ULTIMATE.start_main_#t~mem4#1.base|)) 0))} is VALID [2022-02-20 23:36:36,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {2864#(and (= |ULTIMATE.start_main_#t~mem4#1.offset| 0) (= (+ (- 12) (select |#length| |ULTIMATE.start_main_#t~mem4#1.base|)) 0))} assume !(4 + (4 + main_#t~mem4#1.offset) <= #length[main_#t~mem4#1.base] && 0 <= 4 + main_#t~mem4#1.offset); {2861#false} is VALID [2022-02-20 23:36:36,038 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:36:36,038 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:36,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678968836] [2022-02-20 23:36:36,039 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678968836] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:36,039 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:36,039 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:36:36,039 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516049006] [2022-02-20 23:36:36,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:36,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:36:36,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:36,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:36,050 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:36:36,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:36:36,050 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:36,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:36:36,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:36:36,051 INFO L87 Difference]: Start difference. First operand 152 states and 167 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:36,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:36,364 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2022-02-20 23:36:36,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:36:36,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:36:36,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:36,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:36,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2022-02-20 23:36:36,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:36,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2022-02-20 23:36:36,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 115 transitions. [2022-02-20 23:36:36,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:36,436 INFO L225 Difference]: With dead ends: 151 [2022-02-20 23:36:36,436 INFO L226 Difference]: Without dead ends: 151 [2022-02-20 23:36:36,437 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:36:36,437 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 6 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:36,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 278 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:36,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-02-20 23:36:36,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-02-20 23:36:36,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:36,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand has 151 states, 109 states have (on average 1.5137614678899083) internal successors, (165), 150 states have internal predecessors, (165), 0 states have call successors, (0), 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:36:36,441 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand has 151 states, 109 states have (on average 1.5137614678899083) internal successors, (165), 150 states have internal predecessors, (165), 0 states have call successors, (0), 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:36:36,441 INFO L87 Difference]: Start difference. First operand 151 states. Second operand has 151 states, 109 states have (on average 1.5137614678899083) internal successors, (165), 150 states have internal predecessors, (165), 0 states have call successors, (0), 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:36:36,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:36,444 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2022-02-20 23:36:36,444 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2022-02-20 23:36:36,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:36,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:36,445 INFO L74 IsIncluded]: Start isIncluded. First operand has 151 states, 109 states have (on average 1.5137614678899083) internal successors, (165), 150 states have internal predecessors, (165), 0 states have call successors, (0), 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 151 states. [2022-02-20 23:36:36,445 INFO L87 Difference]: Start difference. First operand has 151 states, 109 states have (on average 1.5137614678899083) internal successors, (165), 150 states have internal predecessors, (165), 0 states have call successors, (0), 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 151 states. [2022-02-20 23:36:36,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:36,447 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2022-02-20 23:36:36,447 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2022-02-20 23:36:36,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:36,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:36,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:36,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:36,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 109 states have (on average 1.5137614678899083) internal successors, (165), 150 states have internal predecessors, (165), 0 states have call successors, (0), 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:36:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 165 transitions. [2022-02-20 23:36:36,451 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 165 transitions. Word has length 12 [2022-02-20 23:36:36,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:36,451 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 165 transitions. [2022-02-20 23:36:36,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:36,451 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2022-02-20 23:36:36,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:36:36,452 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:36,452 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:36,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:36:36,452 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2022-02-20 23:36:36,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:36,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2022-02-20 23:36:36,453 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:36,453 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868448345] [2022-02-20 23:36:36,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:36,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:36,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {3475#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); {3475#true} is VALID [2022-02-20 23:36:36,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {3475#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~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem9#1, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#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(12);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; {3475#true} is VALID [2022-02-20 23:36:36,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {3475#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1005 {3475#true} is VALID [2022-02-20 23:36:36,496 INFO L290 TraceCheckUtils]: 3: Hoare triple {3475#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L1005-1 {3475#true} is VALID [2022-02-20 23:36:36,496 INFO L290 TraceCheckUtils]: 4: Hoare triple {3475#true} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L1006 {3475#true} is VALID [2022-02-20 23:36:36,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {3475#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {3475#true} is VALID [2022-02-20 23:36:36,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {3475#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {3475#true} is VALID [2022-02-20 23:36:36,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {3475#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(12); {3477#(= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1)} is VALID [2022-02-20 23:36:36,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {3477#(= (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: L1015 {3478#(= (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:36:36,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {3478#(= (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; {3478#(= (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:36:36,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {3478#(= (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: L1016 {3479#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) 1)} is VALID [2022-02-20 23:36:36,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {3479#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) 1)} assume !(1 == #valid[main_#t~mem4#1.base]); {3476#false} is VALID [2022-02-20 23:36:36,499 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:36:36,499 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:36,500 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868448345] [2022-02-20 23:36:36,500 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868448345] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:36,500 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:36,500 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:36:36,500 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581059538] [2022-02-20 23:36:36,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:36,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:36:36,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:36,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:36,509 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:36:36,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:36:36,509 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:36,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:36:36,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:36:36,510 INFO L87 Difference]: Start difference. First operand 151 states and 165 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:36,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:36,786 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2022-02-20 23:36:36,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:36:36,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:36:36,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:36,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:36,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2022-02-20 23:36:36,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:36,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2022-02-20 23:36:36,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 114 transitions. [2022-02-20 23:36:36,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:36,855 INFO L225 Difference]: With dead ends: 150 [2022-02-20 23:36:36,856 INFO L226 Difference]: Without dead ends: 150 [2022-02-20 23:36:36,856 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:36:36,856 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 7 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:36,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 283 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:36,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-02-20 23:36:36,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-02-20 23:36:36,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:36,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 150 states, 109 states have (on average 1.4954128440366972) internal successors, (163), 149 states have internal predecessors, (163), 0 states have call successors, (0), 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:36:36,860 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 150 states, 109 states have (on average 1.4954128440366972) internal successors, (163), 149 states have internal predecessors, (163), 0 states have call successors, (0), 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:36:36,860 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 150 states, 109 states have (on average 1.4954128440366972) internal successors, (163), 149 states have internal predecessors, (163), 0 states have call successors, (0), 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:36:36,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:36,862 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2022-02-20 23:36:36,862 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 163 transitions. [2022-02-20 23:36:36,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:36,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:36,863 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 109 states have (on average 1.4954128440366972) internal successors, (163), 149 states have internal predecessors, (163), 0 states have call successors, (0), 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 150 states. [2022-02-20 23:36:36,863 INFO L87 Difference]: Start difference. First operand has 150 states, 109 states have (on average 1.4954128440366972) internal successors, (163), 149 states have internal predecessors, (163), 0 states have call successors, (0), 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 150 states. [2022-02-20 23:36:36,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:36,866 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2022-02-20 23:36:36,866 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 163 transitions. [2022-02-20 23:36:36,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:36,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:36,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:36,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:36,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 109 states have (on average 1.4954128440366972) internal successors, (163), 149 states have internal predecessors, (163), 0 states have call successors, (0), 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:36:36,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 163 transitions. [2022-02-20 23:36:36,869 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 163 transitions. Word has length 12 [2022-02-20 23:36:36,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:36,869 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 163 transitions. [2022-02-20 23:36:36,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:36,869 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 163 transitions. [2022-02-20 23:36:36,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:36:36,870 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:36,870 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:36,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:36:36,870 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2022-02-20 23:36:36,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:36,870 INFO L85 PathProgramCache]: Analyzing trace with hash -896738186, now seen corresponding path program 1 times [2022-02-20 23:36:36,871 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:36,871 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939686020] [2022-02-20 23:36:36,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:36,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:36,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {4086#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); {4086#true} is VALID [2022-02-20 23:36:36,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {4086#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~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem9#1, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#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(12);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; {4086#true} is VALID [2022-02-20 23:36:36,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {4086#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1005 {4086#true} is VALID [2022-02-20 23:36:36,914 INFO L290 TraceCheckUtils]: 3: Hoare triple {4086#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L1005-1 {4086#true} is VALID [2022-02-20 23:36:36,914 INFO L290 TraceCheckUtils]: 4: Hoare triple {4086#true} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L1006 {4086#true} is VALID [2022-02-20 23:36:36,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {4086#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {4086#true} is VALID [2022-02-20 23:36:36,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {4086#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {4086#true} is VALID [2022-02-20 23:36:36,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {4086#true} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {4086#true} is VALID [2022-02-20 23:36:36,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {4086#true} SUMMARY for call write~int(1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1012-3 {4086#true} is VALID [2022-02-20 23:36:36,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {4086#true} call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(12); {4088#(= (select |#valid| |ULTIMATE.start_main_#t~malloc6#1.base|) 1)} is VALID [2022-02-20 23:36:36,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {4088#(= (select |#valid| |ULTIMATE.start_main_#t~malloc6#1.base|) 1)} SUMMARY for call write~$Pointer$(main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1022 {4089#(= (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:36:36,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {4089#(= (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~malloc6#1.base, main_#t~malloc6#1.offset; {4089#(= (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:36:36,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {4089#(= (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~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1023 {4090#(= (select |#valid| |ULTIMATE.start_main_#t~mem7#1.base|) 1)} is VALID [2022-02-20 23:36:36,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {4090#(= (select |#valid| |ULTIMATE.start_main_#t~mem7#1.base|) 1)} assume !(1 == #valid[main_#t~mem7#1.base]); {4087#false} is VALID [2022-02-20 23:36:36,917 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:36:36,917 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:36,918 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939686020] [2022-02-20 23:36:36,918 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939686020] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:36,918 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:36,918 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:36:36,918 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699868074] [2022-02-20 23:36:36,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:36,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:36:36,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:36,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:36:36,928 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:36:36,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:36:36,928 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:36,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:36:36,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:36:36,929 INFO L87 Difference]: Start difference. First operand 150 states and 163 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:36:37,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:37,207 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2022-02-20 23:36:37,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:36:37,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:36:37,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:37,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:36:37,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-02-20 23:36:37,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:36:37,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-02-20 23:36:37,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 113 transitions. [2022-02-20 23:36:37,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:37,277 INFO L225 Difference]: With dead ends: 149 [2022-02-20 23:36:37,277 INFO L226 Difference]: Without dead ends: 149 [2022-02-20 23:36:37,277 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:36:37,278 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 11 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:37,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 275 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:37,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-02-20 23:36:37,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-02-20 23:36:37,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:37,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 149 states, 109 states have (on average 1.4770642201834863) internal successors, (161), 148 states have internal predecessors, (161), 0 states have call successors, (0), 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:36:37,281 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 149 states, 109 states have (on average 1.4770642201834863) internal successors, (161), 148 states have internal predecessors, (161), 0 states have call successors, (0), 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:36:37,281 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 149 states, 109 states have (on average 1.4770642201834863) internal successors, (161), 148 states have internal predecessors, (161), 0 states have call successors, (0), 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:36:37,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:37,288 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2022-02-20 23:36:37,288 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2022-02-20 23:36:37,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:37,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:37,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 109 states have (on average 1.4770642201834863) internal successors, (161), 148 states have internal predecessors, (161), 0 states have call successors, (0), 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 149 states. [2022-02-20 23:36:37,289 INFO L87 Difference]: Start difference. First operand has 149 states, 109 states have (on average 1.4770642201834863) internal successors, (161), 148 states have internal predecessors, (161), 0 states have call successors, (0), 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 149 states. [2022-02-20 23:36:37,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:37,291 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2022-02-20 23:36:37,296 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2022-02-20 23:36:37,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:37,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:37,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:37,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:37,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 109 states have (on average 1.4770642201834863) internal successors, (161), 148 states have internal predecessors, (161), 0 states have call successors, (0), 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:36:37,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2022-02-20 23:36:37,299 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 14 [2022-02-20 23:36:37,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:37,299 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2022-02-20 23:36:37,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:36:37,299 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2022-02-20 23:36:37,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:36:37,300 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:37,300 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:37,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:36:37,300 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2022-02-20 23:36:37,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:37,301 INFO L85 PathProgramCache]: Analyzing trace with hash -896738185, now seen corresponding path program 1 times [2022-02-20 23:36:37,301 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:37,301 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399220295] [2022-02-20 23:36:37,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:37,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:37,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {4693#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); {4693#true} is VALID [2022-02-20 23:36:37,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {4693#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~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem9#1, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#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(12);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; {4693#true} is VALID [2022-02-20 23:36:37,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {4693#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1005 {4693#true} is VALID [2022-02-20 23:36:37,387 INFO L290 TraceCheckUtils]: 3: Hoare triple {4693#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L1005-1 {4693#true} is VALID [2022-02-20 23:36:37,387 INFO L290 TraceCheckUtils]: 4: Hoare triple {4693#true} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L1006 {4693#true} is VALID [2022-02-20 23:36:37,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {4693#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {4693#true} is VALID [2022-02-20 23:36:37,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {4693#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {4693#true} is VALID [2022-02-20 23:36:37,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {4693#true} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {4693#true} is VALID [2022-02-20 23:36:37,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {4693#true} SUMMARY for call write~int(1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1012-3 {4693#true} is VALID [2022-02-20 23:36:37,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {4693#true} call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(12); {4695#(and (= |ULTIMATE.start_main_#t~malloc6#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc6#1.base|) 12))} is VALID [2022-02-20 23:36:37,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {4695#(and (= |ULTIMATE.start_main_#t~malloc6#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc6#1.base|) 12))} SUMMARY for call write~$Pointer$(main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1022 {4696#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:37,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {4696#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {4696#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:37,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {4696#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1023 {4697#(and (= (+ (- 12) (select |#length| |ULTIMATE.start_main_#t~mem7#1.base|)) 0) (= |ULTIMATE.start_main_#t~mem7#1.offset| 0))} is VALID [2022-02-20 23:36:37,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {4697#(and (= (+ (- 12) (select |#length| |ULTIMATE.start_main_#t~mem7#1.base|)) 0) (= |ULTIMATE.start_main_#t~mem7#1.offset| 0))} assume !(4 + (4 + main_#t~mem7#1.offset) <= #length[main_#t~mem7#1.base] && 0 <= 4 + main_#t~mem7#1.offset); {4694#false} is VALID [2022-02-20 23:36:37,391 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:36:37,391 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:37,391 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399220295] [2022-02-20 23:36:37,392 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399220295] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:37,392 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:37,392 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:36:37,392 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876417284] [2022-02-20 23:36:37,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:37,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:36:37,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:37,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:36:37,402 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:36:37,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:36:37,402 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:37,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:36:37,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:36:37,403 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:36:37,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:37,711 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2022-02-20 23:36:37,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:36:37,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:36:37,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:37,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:36:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2022-02-20 23:36:37,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:36:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2022-02-20 23:36:37,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 112 transitions. [2022-02-20 23:36:37,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:37,781 INFO L225 Difference]: With dead ends: 148 [2022-02-20 23:36:37,781 INFO L226 Difference]: Without dead ends: 148 [2022-02-20 23:36:37,782 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:36:37,782 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 4 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:37,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 273 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:37,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-02-20 23:36:37,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-02-20 23:36:37,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:37,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand has 148 states, 109 states have (on average 1.4587155963302751) internal successors, (159), 147 states have internal predecessors, (159), 0 states have call successors, (0), 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:36:37,785 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand has 148 states, 109 states have (on average 1.4587155963302751) internal successors, (159), 147 states have internal predecessors, (159), 0 states have call successors, (0), 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:36:37,785 INFO L87 Difference]: Start difference. First operand 148 states. Second operand has 148 states, 109 states have (on average 1.4587155963302751) internal successors, (159), 147 states have internal predecessors, (159), 0 states have call successors, (0), 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:36:37,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:37,786 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2022-02-20 23:36:37,786 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2022-02-20 23:36:37,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:37,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:37,787 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 109 states have (on average 1.4587155963302751) internal successors, (159), 147 states have internal predecessors, (159), 0 states have call successors, (0), 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 148 states. [2022-02-20 23:36:37,787 INFO L87 Difference]: Start difference. First operand has 148 states, 109 states have (on average 1.4587155963302751) internal successors, (159), 147 states have internal predecessors, (159), 0 states have call successors, (0), 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 148 states. [2022-02-20 23:36:37,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:37,789 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2022-02-20 23:36:37,789 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2022-02-20 23:36:37,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:37,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:37,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:37,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:37,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 109 states have (on average 1.4587155963302751) internal successors, (159), 147 states have internal predecessors, (159), 0 states have call successors, (0), 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:36:37,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2022-02-20 23:36:37,792 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 159 transitions. Word has length 14 [2022-02-20 23:36:37,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:37,792 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 159 transitions. [2022-02-20 23:36:37,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:36:37,792 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2022-02-20 23:36:37,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:36:37,793 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:37,793 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:36:37,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:36:37,793 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2022-02-20 23:36:37,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:37,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2022-02-20 23:36:37,794 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:37,794 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352716691] [2022-02-20 23:36:37,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:37,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:37,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {5296#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); {5296#true} is VALID [2022-02-20 23:36:37,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {5296#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~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem9#1, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#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(12);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; {5296#true} is VALID [2022-02-20 23:36:37,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {5296#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1005 {5298#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:37,892 INFO L290 TraceCheckUtils]: 3: Hoare triple {5298#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L1005-1 {5298#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:37,893 INFO L290 TraceCheckUtils]: 4: Hoare triple {5298#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L1006 {5298#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:37,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {5298#(= (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; {5299#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:36:37,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {5299#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {5299#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:36:37,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {5299#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {5300#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|)))} is VALID [2022-02-20 23:36:37,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {5300#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|)))} 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: L1015 {5301#(and (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:36:37,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {5301#(and (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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; {5301#(and (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:36:37,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {5301#(and (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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: L1016 {5302#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= (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:36:37,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {5302#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= (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 write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4); srcloc: L1016-1 {5303#(= (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:36:37,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {5303#(= (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~mem4#1.base, main_#t~mem4#1.offset; {5303#(= (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:36:37,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {5303#(= (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~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1017 {5304#(= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) 1)} is VALID [2022-02-20 23:36:37,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {5304#(= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {5299#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:36:37,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {5299#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(1 == #valid[main_~x~0#1.base]); {5297#false} is VALID [2022-02-20 23:36:37,898 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:36:37,898 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:37,899 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352716691] [2022-02-20 23:36:37,899 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352716691] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:37,899 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:37,899 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:36:37,899 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191133905] [2022-02-20 23:36:37,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:37,900 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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:36:37,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:37,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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:36:37,912 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:36:37,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:36:37,912 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:37,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:36:37,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:36:37,913 INFO L87 Difference]: Start difference. First operand 148 states and 159 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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:36:38,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:38,673 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2022-02-20 23:36:38,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:36:38,674 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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:36:38,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:38,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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:36:38,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2022-02-20 23:36:38,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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:36:38,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2022-02-20 23:36:38,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 127 transitions. [2022-02-20 23:36:38,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:38,760 INFO L225 Difference]: With dead ends: 152 [2022-02-20 23:36:38,760 INFO L226 Difference]: Without dead ends: 152 [2022-02-20 23:36:38,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:36:38,764 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 180 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:38,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 256 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:36:38,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-02-20 23:36:38,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147. [2022-02-20 23:36:38,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:38,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 147 states, 109 states have (on average 1.4495412844036697) internal successors, (158), 146 states have internal predecessors, (158), 0 states have call successors, (0), 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:36:38,768 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 147 states, 109 states have (on average 1.4495412844036697) internal successors, (158), 146 states have internal predecessors, (158), 0 states have call successors, (0), 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:36:38,769 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 147 states, 109 states have (on average 1.4495412844036697) internal successors, (158), 146 states have internal predecessors, (158), 0 states have call successors, (0), 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:36:38,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:38,770 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2022-02-20 23:36:38,770 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 159 transitions. [2022-02-20 23:36:38,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:38,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:38,771 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 109 states have (on average 1.4495412844036697) internal successors, (158), 146 states have internal predecessors, (158), 0 states have call successors, (0), 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 152 states. [2022-02-20 23:36:38,771 INFO L87 Difference]: Start difference. First operand has 147 states, 109 states have (on average 1.4495412844036697) internal successors, (158), 146 states have internal predecessors, (158), 0 states have call successors, (0), 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 152 states. [2022-02-20 23:36:38,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:38,773 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2022-02-20 23:36:38,773 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 159 transitions. [2022-02-20 23:36:38,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:38,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:38,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:38,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:38,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 109 states have (on average 1.4495412844036697) internal successors, (158), 146 states have internal predecessors, (158), 0 states have call successors, (0), 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:36:38,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2022-02-20 23:36:38,775 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 16 [2022-02-20 23:36:38,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:38,776 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2022-02-20 23:36:38,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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:36:38,776 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2022-02-20 23:36:38,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:36:38,777 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:38,777 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:36:38,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:36:38,777 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2022-02-20 23:36:38,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:38,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2022-02-20 23:36:38,777 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:38,778 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206465245] [2022-02-20 23:36:38,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:38,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:38,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {5922#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); {5922#true} is VALID [2022-02-20 23:36:38,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {5922#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~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem9#1, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#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(12);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; {5922#true} is VALID [2022-02-20 23:36:38,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {5922#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1005 {5924#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:38,958 INFO L290 TraceCheckUtils]: 3: Hoare triple {5924#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L1005-1 {5924#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:38,959 INFO L290 TraceCheckUtils]: 4: Hoare triple {5924#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L1006 {5924#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:38,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {5924#(= (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; {5925#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:36:38,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {5925#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {5925#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:36:38,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {5925#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {5926#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|)))} is VALID [2022-02-20 23:36:38,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {5926#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|)))} 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: L1015 {5927#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:38,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {5927#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |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; {5927#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:38,962 INFO L290 TraceCheckUtils]: 10: Hoare triple {5927#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |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: L1016 {5928#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:38,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {5928#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4); srcloc: L1016-1 {5929#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:38,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {5929#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {5929#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:38,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {5929#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1017 {5930#(and (= |ULTIMATE.start_main_#t~mem5#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_#t~mem5#1.base|)))} is VALID [2022-02-20 23:36:38,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {5930#(and (= |ULTIMATE.start_main_#t~mem5#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_#t~mem5#1.base|)))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {5931#(and (<= 12 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} is VALID [2022-02-20 23:36:38,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {5931#(and (<= 12 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} assume !(4 + (8 + main_~x~0#1.offset) <= #length[main_~x~0#1.base] && 0 <= 8 + main_~x~0#1.offset); {5923#false} is VALID [2022-02-20 23:36:38,967 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:36:38,967 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:38,967 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206465245] [2022-02-20 23:36:38,967 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206465245] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:38,967 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:38,967 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:36:38,967 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997049129] [2022-02-20 23:36:38,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:38,968 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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:36:38,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:38,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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:36:38,983 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:36:38,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:36:38,984 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:38,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:36:38,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:36:38,985 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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:36:40,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:40,024 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2022-02-20 23:36:40,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 23:36:40,024 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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:36:40,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:40,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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:36:40,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 148 transitions. [2022-02-20 23:36:40,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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:36:40,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 148 transitions. [2022-02-20 23:36:40,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 148 transitions. [2022-02-20 23:36:40,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:40,139 INFO L225 Difference]: With dead ends: 149 [2022-02-20 23:36:40,139 INFO L226 Difference]: Without dead ends: 149 [2022-02-20 23:36:40,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:36:40,140 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 182 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:40,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 320 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:36:40,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-02-20 23:36:40,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 123. [2022-02-20 23:36:40,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:40,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 123 states, 93 states have (on average 1.4301075268817205) internal successors, (133), 122 states have internal predecessors, (133), 0 states have call successors, (0), 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:36:40,142 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 123 states, 93 states have (on average 1.4301075268817205) internal successors, (133), 122 states have internal predecessors, (133), 0 states have call successors, (0), 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:36:40,142 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 123 states, 93 states have (on average 1.4301075268817205) internal successors, (133), 122 states have internal predecessors, (133), 0 states have call successors, (0), 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:36:40,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:40,145 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2022-02-20 23:36:40,145 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 156 transitions. [2022-02-20 23:36:40,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:40,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:40,145 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 93 states have (on average 1.4301075268817205) internal successors, (133), 122 states have internal predecessors, (133), 0 states have call successors, (0), 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 149 states. [2022-02-20 23:36:40,146 INFO L87 Difference]: Start difference. First operand has 123 states, 93 states have (on average 1.4301075268817205) internal successors, (133), 122 states have internal predecessors, (133), 0 states have call successors, (0), 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 149 states. [2022-02-20 23:36:40,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:40,147 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2022-02-20 23:36:40,147 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 156 transitions. [2022-02-20 23:36:40,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:40,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:40,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:40,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:40,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 93 states have (on average 1.4301075268817205) internal successors, (133), 122 states have internal predecessors, (133), 0 states have call successors, (0), 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:36:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2022-02-20 23:36:40,149 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 16 [2022-02-20 23:36:40,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:40,150 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2022-02-20 23:36:40,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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:36:40,150 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2022-02-20 23:36:40,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:36:40,150 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:40,150 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:40,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:36:40,151 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2022-02-20 23:36:40,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:40,151 INFO L85 PathProgramCache]: Analyzing trace with hash -30672293, now seen corresponding path program 1 times [2022-02-20 23:36:40,151 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:40,151 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255338835] [2022-02-20 23:36:40,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:40,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:40,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {6530#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); {6530#true} is VALID [2022-02-20 23:36:40,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {6530#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~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem9#1, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#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(12);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; {6530#true} is VALID [2022-02-20 23:36:40,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {6530#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1005 {6530#true} is VALID [2022-02-20 23:36:40,230 INFO L290 TraceCheckUtils]: 3: Hoare triple {6530#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L1005-1 {6530#true} is VALID [2022-02-20 23:36:40,230 INFO L290 TraceCheckUtils]: 4: Hoare triple {6530#true} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L1006 {6530#true} is VALID [2022-02-20 23:36:40,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {6530#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {6530#true} is VALID [2022-02-20 23:36:40,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {6530#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {6530#true} is VALID [2022-02-20 23:36:40,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {6530#true} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {6530#true} is VALID [2022-02-20 23:36:40,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {6530#true} SUMMARY for call write~int(1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1012-3 {6532#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:36:40,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {6532#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(12); {6533#(and (not (= |ULTIMATE.start_main_#t~malloc6#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc6#1.base|) 1))} is VALID [2022-02-20 23:36:40,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {6533#(and (not (= |ULTIMATE.start_main_#t~malloc6#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc6#1.base|) 1))} SUMMARY for call write~$Pointer$(main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1022 {6534#(and (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:36:40,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {6534#(and (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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~malloc6#1.base, main_#t~malloc6#1.offset; {6534#(and (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:36:40,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {6534#(and (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1023 {6535#(and (not (= |ULTIMATE.start_main_#t~mem7#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= (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:36:40,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {6535#(and (not (= |ULTIMATE.start_main_#t~mem7#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= (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 write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem7#1.base, 4 + main_#t~mem7#1.offset, 4); srcloc: L1023-1 {6536#(= (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:36:40,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {6536#(= (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~mem7#1.base, main_#t~mem7#1.offset; {6536#(= (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:36:40,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {6536#(= (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~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1024 {6537#(= (select |#valid| |ULTIMATE.start_main_#t~mem8#1.base|) 1)} is VALID [2022-02-20 23:36:40,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {6537#(= (select |#valid| |ULTIMATE.start_main_#t~mem8#1.base|) 1)} assume !(1 == #valid[main_#t~mem8#1.base]); {6531#false} is VALID [2022-02-20 23:36:40,245 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:36:40,245 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:40,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255338835] [2022-02-20 23:36:40,245 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255338835] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:40,246 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:40,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:36:40,246 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440879801] [2022-02-20 23:36:40,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:40,246 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:36:40,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:40,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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:36:40,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:40,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:36:40,258 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:40,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:36:40,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:36:40,259 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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:36:40,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:40,739 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2022-02-20 23:36:40,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:36:40,739 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:36:40,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:40,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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:36:40,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2022-02-20 23:36:40,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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:36:40,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2022-02-20 23:36:40,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 107 transitions. [2022-02-20 23:36:40,807 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:36:40,808 INFO L225 Difference]: With dead ends: 126 [2022-02-20 23:36:40,808 INFO L226 Difference]: Without dead ends: 126 [2022-02-20 23:36:40,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:36:40,809 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 66 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:40,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 253 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:36:40,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-02-20 23:36:40,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2022-02-20 23:36:40,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:40,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 122 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 121 states have internal predecessors, (132), 0 states have call successors, (0), 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:36:40,811 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 122 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 121 states have internal predecessors, (132), 0 states have call successors, (0), 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:36:40,812 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 122 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 121 states have internal predecessors, (132), 0 states have call successors, (0), 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:36:40,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:40,813 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2022-02-20 23:36:40,813 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2022-02-20 23:36:40,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:40,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:40,814 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 121 states have internal predecessors, (132), 0 states have call successors, (0), 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 126 states. [2022-02-20 23:36:40,814 INFO L87 Difference]: Start difference. First operand has 122 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 121 states have internal predecessors, (132), 0 states have call successors, (0), 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 126 states. [2022-02-20 23:36:40,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:40,816 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2022-02-20 23:36:40,816 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2022-02-20 23:36:40,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:40,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:40,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:40,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:40,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 121 states have internal predecessors, (132), 0 states have call successors, (0), 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:36:40,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2022-02-20 23:36:40,818 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 17 [2022-02-20 23:36:40,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:40,818 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2022-02-20 23:36:40,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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:36:40,818 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2022-02-20 23:36:40,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:36:40,819 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:40,819 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:40,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 23:36:40,819 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2022-02-20 23:36:40,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:40,820 INFO L85 PathProgramCache]: Analyzing trace with hash -30672292, now seen corresponding path program 1 times [2022-02-20 23:36:40,820 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:40,820 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124525493] [2022-02-20 23:36:40,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:40,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:40,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {7052#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); {7052#true} is VALID [2022-02-20 23:36:40,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {7052#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~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem9#1, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#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(12);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; {7052#true} is VALID [2022-02-20 23:36:40,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {7052#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1005 {7052#true} is VALID [2022-02-20 23:36:40,917 INFO L290 TraceCheckUtils]: 3: Hoare triple {7052#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L1005-1 {7052#true} is VALID [2022-02-20 23:36:40,917 INFO L290 TraceCheckUtils]: 4: Hoare triple {7052#true} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L1006 {7052#true} is VALID [2022-02-20 23:36:40,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {7052#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {7052#true} is VALID [2022-02-20 23:36:40,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {7052#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {7052#true} is VALID [2022-02-20 23:36:40,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {7052#true} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {7052#true} is VALID [2022-02-20 23:36:40,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {7052#true} SUMMARY for call write~int(1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1012-3 {7054#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:36:40,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {7054#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(12); {7055#(and (not (= |ULTIMATE.start_main_#t~malloc6#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_#t~malloc6#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc6#1.base|) 12))} is VALID [2022-02-20 23:36:40,919 INFO L290 TraceCheckUtils]: 10: Hoare triple {7055#(and (not (= |ULTIMATE.start_main_#t~malloc6#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_#t~malloc6#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc6#1.base|) 12))} SUMMARY for call write~$Pointer$(main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1022 {7056#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:40,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {7056#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {7056#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:40,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {7056#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1023 {7057#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_#t~mem7#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:40,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {7057#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_#t~mem7#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem7#1.base, 4 + main_#t~mem7#1.offset, 4); srcloc: L1023-1 {7058#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:40,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {7058#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {7058#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:40,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {7058#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1024 {7059#(and (= |ULTIMATE.start_main_#t~mem8#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~mem8#1.base|) 12))} is VALID [2022-02-20 23:36:40,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {7059#(and (= |ULTIMATE.start_main_#t~mem8#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~mem8#1.base|) 12))} assume !(4 + (8 + main_#t~mem8#1.offset) <= #length[main_#t~mem8#1.base] && 0 <= 8 + main_#t~mem8#1.offset); {7053#false} is VALID [2022-02-20 23:36:40,923 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:36:40,923 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:40,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124525493] [2022-02-20 23:36:40,923 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124525493] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:40,924 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:40,924 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:36:40,924 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147743713] [2022-02-20 23:36:40,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:40,924 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:36:40,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:40,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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:36:40,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:40,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:36:40,940 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:40,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:36:40,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:36:40,941 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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:36:41,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:41,432 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2022-02-20 23:36:41,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:36:41,432 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:36:41,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:41,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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:36:41,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2022-02-20 23:36:41,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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:36:41,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2022-02-20 23:36:41,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 106 transitions. [2022-02-20 23:36:41,497 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:36:41,498 INFO L225 Difference]: With dead ends: 125 [2022-02-20 23:36:41,498 INFO L226 Difference]: Without dead ends: 125 [2022-02-20 23:36:41,498 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:36:41,499 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 60 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:41,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 263 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:36:41,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-02-20 23:36:41,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2022-02-20 23:36:41,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:41,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 121 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 120 states have internal predecessors, (131), 0 states have call successors, (0), 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:36:41,501 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 121 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 120 states have internal predecessors, (131), 0 states have call successors, (0), 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:36:41,501 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 121 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 120 states have internal predecessors, (131), 0 states have call successors, (0), 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:36:41,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:41,502 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2022-02-20 23:36:41,502 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2022-02-20 23:36:41,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:41,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:41,503 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 120 states have internal predecessors, (131), 0 states have call successors, (0), 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:36:41,503 INFO L87 Difference]: Start difference. First operand has 121 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 120 states have internal predecessors, (131), 0 states have call successors, (0), 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:36:41,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:41,504 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2022-02-20 23:36:41,504 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2022-02-20 23:36:41,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:41,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:41,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:41,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:41,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 120 states have internal predecessors, (131), 0 states have call successors, (0), 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:36:41,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2022-02-20 23:36:41,508 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 17 [2022-02-20 23:36:41,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:41,508 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2022-02-20 23:36:41,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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:36:41,508 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2022-02-20 23:36:41,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:36:41,509 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:41,509 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:41,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 23:36:41,509 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2022-02-20 23:36:41,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:41,510 INFO L85 PathProgramCache]: Analyzing trace with hash -3964873, now seen corresponding path program 1 times [2022-02-20 23:36:41,510 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:41,510 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045960256] [2022-02-20 23:36:41,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:41,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:41,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {7570#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); {7572#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:41,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {7572#(= (select |#valid| 0) 0)} 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~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem9#1, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#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(12);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; {7572#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:41,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {7572#(= (select |#valid| 0) 0)} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1005 {7572#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:41,580 INFO L290 TraceCheckUtils]: 3: Hoare triple {7572#(= (select |#valid| 0) 0)} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L1005-1 {7572#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:41,581 INFO L290 TraceCheckUtils]: 4: Hoare triple {7572#(= (select |#valid| 0) 0)} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L1006 {7572#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:41,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {7572#(= (select |#valid| 0) 0)} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {7572#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:41,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {7572#(= (select |#valid| 0) 0)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {7572#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:41,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {7572#(= (select |#valid| 0) 0)} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {7573#(and (= (select |#valid| 0) 0) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| 0)))} is VALID [2022-02-20 23:36:41,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {7573#(and (= (select |#valid| 0) 0) (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: L1015 {7572#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:41,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {7572#(= (select |#valid| 0) 0)} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {7572#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:41,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {7572#(= (select |#valid| 0) 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: L1016 {7572#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:41,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {7572#(= (select |#valid| 0) 0)} SUMMARY for call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4); srcloc: L1016-1 {7572#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:41,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {7572#(= (select |#valid| 0) 0)} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {7572#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:41,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {7572#(= (select |#valid| 0) 0)} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1017 {7572#(= (select |#valid| 0) 0)} is VALID [2022-02-20 23:36:41,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {7572#(= (select |#valid| 0) 0)} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {7574#(or (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 0) (not (= |ULTIMATE.start_main_~x~0#1.base| 0)))} is VALID [2022-02-20 23:36:41,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {7574#(or (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 0) (not (= |ULTIMATE.start_main_~x~0#1.base| 0)))} SUMMARY for call write~int(0, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1018 {7575#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 23:36:41,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {7575#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {7571#false} is VALID [2022-02-20 23:36:41,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {7571#false} assume !false; {7571#false} is VALID [2022-02-20 23:36:41,585 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:36:41,585 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:41,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045960256] [2022-02-20 23:36:41,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045960256] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:41,586 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:41,586 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:36:41,586 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026123154] [2022-02-20 23:36:41,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:41,586 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:36:41,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:41,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:41,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:41,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:36:41,597 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:41,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:36:41,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:36:41,598 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:41,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:41,869 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2022-02-20 23:36:41,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:36:41,869 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:36:41,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:41,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:41,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-02-20 23:36:41,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:41,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-02-20 23:36:41,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 104 transitions. [2022-02-20 23:36:41,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:41,945 INFO L225 Difference]: With dead ends: 123 [2022-02-20 23:36:41,945 INFO L226 Difference]: Without dead ends: 123 [2022-02-20 23:36:41,946 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:36:41,946 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 152 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:41,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 113 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:41,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-02-20 23:36:41,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2022-02-20 23:36:41,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:41,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 119 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 118 states have internal predecessors, (129), 0 states have call successors, (0), 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:36:41,949 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 119 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 118 states have internal predecessors, (129), 0 states have call successors, (0), 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:36:41,949 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 119 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 118 states have internal predecessors, (129), 0 states have call successors, (0), 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:36:41,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:41,951 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2022-02-20 23:36:41,951 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2022-02-20 23:36:41,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:41,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:41,952 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 118 states have internal predecessors, (129), 0 states have call successors, (0), 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 123 states. [2022-02-20 23:36:41,955 INFO L87 Difference]: Start difference. First operand has 119 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 118 states have internal predecessors, (129), 0 states have call successors, (0), 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 123 states. [2022-02-20 23:36:41,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:41,956 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2022-02-20 23:36:41,957 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2022-02-20 23:36:41,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:41,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:41,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:41,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:41,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 118 states have internal predecessors, (129), 0 states have call successors, (0), 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:36:41,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2022-02-20 23:36:41,959 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 18 [2022-02-20 23:36:41,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:41,959 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2022-02-20 23:36:41,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:41,959 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2022-02-20 23:36:41,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:36:41,959 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:41,959 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:41,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 23:36:41,960 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2022-02-20 23:36:41,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:41,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1069806106, now seen corresponding path program 1 times [2022-02-20 23:36:41,960 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:41,960 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692762029] [2022-02-20 23:36:41,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:41,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:42,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {8070#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); {8070#true} is VALID [2022-02-20 23:36:42,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {8070#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~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem9#1, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#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(12);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; {8072#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:42,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {8072#(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: L1005 {8072#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:42,002 INFO L290 TraceCheckUtils]: 3: Hoare triple {8072#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L1005-1 {8072#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:42,003 INFO L290 TraceCheckUtils]: 4: Hoare triple {8072#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L1006 {8072#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:42,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {8072#(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; {8072#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:42,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {8072#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {8072#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:42,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {8072#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {8072#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:42,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {8072#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} SUMMARY for call write~int(1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1012-3 {8072#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:42,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {8072#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(12); {8072#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:42,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {8072#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} SUMMARY for call write~$Pointer$(main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1022 {8072#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:42,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {8072#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {8072#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:42,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {8072#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1023 {8072#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:42,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {8072#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} SUMMARY for call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem7#1.base, 4 + main_#t~mem7#1.offset, 4); srcloc: L1023-1 {8072#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:42,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {8072#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {8072#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:42,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {8072#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1024 {8072#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:42,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {8072#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} SUMMARY for call write~int(2, main_#t~mem8#1.base, 8 + main_#t~mem8#1.offset, 4); srcloc: L1024-1 {8072#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:42,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {8072#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {8073#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 23:36:42,011 INFO L290 TraceCheckUtils]: 18: Hoare triple {8073#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {8071#false} is VALID [2022-02-20 23:36:42,011 INFO L290 TraceCheckUtils]: 19: Hoare triple {8071#false} assume !false; {8071#false} is VALID [2022-02-20 23:36:42,012 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:36:42,012 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:42,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692762029] [2022-02-20 23:36:42,012 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692762029] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:42,012 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:42,012 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:36:42,012 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937858074] [2022-02-20 23:36:42,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:42,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-02-20 23:36:42,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:42,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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:36:42,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:42,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:36:42,024 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:42,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:36:42,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:36:42,025 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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:36:42,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:42,231 INFO L93 Difference]: Finished difference Result 181 states and 186 transitions. [2022-02-20 23:36:42,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:36:42,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-02-20 23:36:42,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:42,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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:36:42,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2022-02-20 23:36:42,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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:36:42,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2022-02-20 23:36:42,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 187 transitions. [2022-02-20 23:36:42,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:42,358 INFO L225 Difference]: With dead ends: 181 [2022-02-20 23:36:42,358 INFO L226 Difference]: Without dead ends: 181 [2022-02-20 23:36:42,359 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:36:42,359 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 177 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:42,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 135 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:36:42,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-02-20 23:36:42,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 117. [2022-02-20 23:36:42,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:42,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 117 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 116 states have internal predecessors, (127), 0 states have call successors, (0), 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:36:42,362 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 117 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 116 states have internal predecessors, (127), 0 states have call successors, (0), 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:36:42,362 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 117 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 116 states have internal predecessors, (127), 0 states have call successors, (0), 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:36:42,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:42,364 INFO L93 Difference]: Finished difference Result 181 states and 186 transitions. [2022-02-20 23:36:42,364 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 186 transitions. [2022-02-20 23:36:42,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:42,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:42,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 116 states have internal predecessors, (127), 0 states have call successors, (0), 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 181 states. [2022-02-20 23:36:42,365 INFO L87 Difference]: Start difference. First operand has 117 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 116 states have internal predecessors, (127), 0 states have call successors, (0), 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 181 states. [2022-02-20 23:36:42,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:42,367 INFO L93 Difference]: Finished difference Result 181 states and 186 transitions. [2022-02-20 23:36:42,367 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 186 transitions. [2022-02-20 23:36:42,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:42,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:42,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:42,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:42,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 116 states have internal predecessors, (127), 0 states have call successors, (0), 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:36:42,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2022-02-20 23:36:42,369 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 20 [2022-02-20 23:36:42,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:42,369 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2022-02-20 23:36:42,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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:36:42,369 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2022-02-20 23:36:42,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:36:42,370 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:42,370 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, 1, 1, 1, 1] [2022-02-20 23:36:42,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 23:36:42,370 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2022-02-20 23:36:42,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:42,370 INFO L85 PathProgramCache]: Analyzing trace with hash 684226449, now seen corresponding path program 1 times [2022-02-20 23:36:42,371 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:42,371 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496778326] [2022-02-20 23:36:42,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:42,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:42,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {8738#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); {8738#true} is VALID [2022-02-20 23:36:42,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {8738#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~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem9#1, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#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(12);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; {8740#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} is VALID [2022-02-20 23:36:42,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {8740#(= |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: L1005 {8740#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} is VALID [2022-02-20 23:36:42,625 INFO L290 TraceCheckUtils]: 3: Hoare triple {8740#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L1005-1 {8740#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} is VALID [2022-02-20 23:36:42,625 INFO L290 TraceCheckUtils]: 4: Hoare triple {8740#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L1006 {8740#(= |ULTIMATE.start_main_~head~0#1.offset| 0)} is VALID [2022-02-20 23:36:42,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {8740#(= |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; {8741#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:36:42,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {8741#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {8741#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:36:42,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {8741#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {8741#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:36:42,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {8741#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} SUMMARY for call write~int(1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1012-3 {8742#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))} is VALID [2022-02-20 23:36:42,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {8742#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))} call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(12); {8743#(and (not (= |ULTIMATE.start_main_#t~malloc6#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:36:42,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {8743#(and (not (= |ULTIMATE.start_main_#t~malloc6#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1022 {8744#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:36:42,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {8744#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {8744#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:36:42,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {8744#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1023 {8745#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_#t~mem7#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:36:42,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {8745#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_#t~mem7#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} SUMMARY for call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem7#1.base, 4 + main_#t~mem7#1.offset, 4); srcloc: L1023-1 {8744#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:36:42,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {8744#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {8744#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:36:42,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {8744#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1024 {8746#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_#t~mem8#1.base| |ULTIMATE.start_main_~head~0#1.base|)))} is VALID [2022-02-20 23:36:42,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {8746#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_#t~mem8#1.base| |ULTIMATE.start_main_~head~0#1.base|)))} SUMMARY for call write~int(2, main_#t~mem8#1.base, 8 + main_#t~mem8#1.offset, 4); srcloc: L1024-1 {8747#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8))) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:36:42,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {8747#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8))) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {8748#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} is VALID [2022-02-20 23:36:42,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {8748#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {8748#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} is VALID [2022-02-20 23:36:42,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {8748#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} goto; {8748#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} is VALID [2022-02-20 23:36:42,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {8748#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} SUMMARY for call main_#t~mem9#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1030-2 {8749#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem9#1| 1))} is VALID [2022-02-20 23:36:42,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {8749#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem9#1| 1))} assume !!(1 != main_#t~mem9#1);havoc main_#t~mem9#1; {8739#false} is VALID [2022-02-20 23:36:42,635 INFO L290 TraceCheckUtils]: 22: Hoare triple {8739#false} SUMMARY for call main_#t~mem10#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1032-5 {8739#false} is VALID [2022-02-20 23:36:42,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {8739#false} assume !(0 == main_#t~mem10#1);havoc main_#t~mem10#1; {8739#false} is VALID [2022-02-20 23:36:42,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {8739#false} assume !false; {8739#false} is VALID [2022-02-20 23:36:42,638 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:36:42,638 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:42,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496778326] [2022-02-20 23:36:42,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496778326] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:42,638 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:42,639 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 23:36:42,639 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394225820] [2022-02-20 23:36:42,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:42,639 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-02-20 23:36:42,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:42,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 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:36:42,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:42,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:36:42,656 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:42,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:36:42,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:36:42,656 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 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:36:43,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:43,519 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2022-02-20 23:36:43,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:36:43,520 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-02-20 23:36:43,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:43,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 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:36:43,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 230 transitions. [2022-02-20 23:36:43,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 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:36:43,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 230 transitions. [2022-02-20 23:36:43,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 230 transitions. [2022-02-20 23:36:43,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:43,671 INFO L225 Difference]: With dead ends: 225 [2022-02-20 23:36:43,671 INFO L226 Difference]: Without dead ends: 225 [2022-02-20 23:36:43,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2022-02-20 23:36:43,671 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 275 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:43,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 325 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:36:43,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-02-20 23:36:43,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 133. [2022-02-20 23:36:43,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:43,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 225 states. Second operand has 133 states, 107 states have (on average 1.3457943925233644) 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:36:43,674 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand has 133 states, 107 states have (on average 1.3457943925233644) 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:36:43,674 INFO L87 Difference]: Start difference. First operand 225 states. Second operand has 133 states, 107 states have (on average 1.3457943925233644) 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:36:43,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:43,679 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2022-02-20 23:36:43,680 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 229 transitions. [2022-02-20 23:36:43,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:43,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:43,680 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 107 states have (on average 1.3457943925233644) 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 225 states. [2022-02-20 23:36:43,681 INFO L87 Difference]: Start difference. First operand has 133 states, 107 states have (on average 1.3457943925233644) 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 225 states. [2022-02-20 23:36:43,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:43,683 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2022-02-20 23:36:43,683 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 229 transitions. [2022-02-20 23:36:43,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:43,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:43,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:43,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:43,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 107 states have (on average 1.3457943925233644) 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:36:43,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2022-02-20 23:36:43,685 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 25 [2022-02-20 23:36:43,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:43,686 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2022-02-20 23:36:43,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 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:36:43,686 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2022-02-20 23:36:43,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:36:43,687 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:43,687 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, 1, 1, 1, 1] [2022-02-20 23:36:43,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 23:36:43,688 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2022-02-20 23:36:43,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:43,688 INFO L85 PathProgramCache]: Analyzing trace with hash 684193678, now seen corresponding path program 1 times [2022-02-20 23:36:43,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:43,689 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442712451] [2022-02-20 23:36:43,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:43,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:43,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {9574#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); {9574#true} is VALID [2022-02-20 23:36:43,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {9574#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~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem9#1, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#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(12);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; {9574#true} is VALID [2022-02-20 23:36:43,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {9574#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1005 {9574#true} is VALID [2022-02-20 23:36:43,746 INFO L290 TraceCheckUtils]: 3: Hoare triple {9574#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L1005-1 {9574#true} is VALID [2022-02-20 23:36:43,746 INFO L290 TraceCheckUtils]: 4: Hoare triple {9574#true} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L1006 {9574#true} is VALID [2022-02-20 23:36:43,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {9574#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {9574#true} is VALID [2022-02-20 23:36:43,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {9574#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {9574#true} is VALID [2022-02-20 23:36:43,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {9574#true} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {9574#true} is VALID [2022-02-20 23:36:43,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {9574#true} SUMMARY for call write~int(1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1012-3 {9574#true} is VALID [2022-02-20 23:36:43,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {9574#true} call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(12); {9574#true} is VALID [2022-02-20 23:36:43,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {9574#true} SUMMARY for call write~$Pointer$(main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1022 {9574#true} is VALID [2022-02-20 23:36:43,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {9574#true} havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {9574#true} is VALID [2022-02-20 23:36:43,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {9574#true} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1023 {9574#true} is VALID [2022-02-20 23:36:43,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {9574#true} SUMMARY for call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem7#1.base, 4 + main_#t~mem7#1.offset, 4); srcloc: L1023-1 {9574#true} is VALID [2022-02-20 23:36:43,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {9574#true} havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {9574#true} is VALID [2022-02-20 23:36:43,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {9574#true} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1024 {9574#true} is VALID [2022-02-20 23:36:43,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {9574#true} SUMMARY for call write~int(2, main_#t~mem8#1.base, 8 + main_#t~mem8#1.offset, 4); srcloc: L1024-1 {9574#true} is VALID [2022-02-20 23:36:43,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {9574#true} havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {9574#true} is VALID [2022-02-20 23:36:43,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {9574#true} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {9574#true} is VALID [2022-02-20 23:36:43,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {9574#true} goto; {9574#true} is VALID [2022-02-20 23:36:43,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {9574#true} SUMMARY for call main_#t~mem9#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1030-2 {9576#(= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-20 23:36:43,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {9576#(= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)))} assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1; {9577#(= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:43,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {9577#(= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1)} SUMMARY for call main_#t~mem12#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1035-4 {9578#(= |ULTIMATE.start_main_#t~mem12#1| 1)} is VALID [2022-02-20 23:36:43,750 INFO L290 TraceCheckUtils]: 23: Hoare triple {9578#(= |ULTIMATE.start_main_#t~mem12#1| 1)} assume !(1 == main_#t~mem12#1);havoc main_#t~mem12#1; {9575#false} is VALID [2022-02-20 23:36:43,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {9575#false} assume !false; {9575#false} is VALID [2022-02-20 23:36:43,752 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:36:43,752 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:43,752 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442712451] [2022-02-20 23:36:43,753 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442712451] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:43,753 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:43,754 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:36:43,754 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110759951] [2022-02-20 23:36:43,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:43,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-02-20 23:36:43,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:43,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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:36:43,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:43,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:36:43,769 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:43,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:36:43,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:36:43,770 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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:36:43,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:43,984 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2022-02-20 23:36:43,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:36:43,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-02-20 23:36:43,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:43,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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:36:43,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2022-02-20 23:36:43,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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:36:43,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2022-02-20 23:36:43,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 95 transitions. [2022-02-20 23:36:44,038 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:36:44,039 INFO L225 Difference]: With dead ends: 131 [2022-02-20 23:36:44,039 INFO L226 Difference]: Without dead ends: 131 [2022-02-20 23:36:44,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:36:44,040 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 8 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:44,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 236 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:44,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-02-20 23:36:44,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-02-20 23:36:44,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:44,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 131 states, 106 states have (on average 1.330188679245283) internal successors, (141), 130 states have internal predecessors, (141), 0 states have call successors, (0), 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:36:44,042 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 131 states, 106 states have (on average 1.330188679245283) internal successors, (141), 130 states have internal predecessors, (141), 0 states have call successors, (0), 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:36:44,042 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 131 states, 106 states have (on average 1.330188679245283) internal successors, (141), 130 states have internal predecessors, (141), 0 states have call successors, (0), 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:36:44,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:44,043 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2022-02-20 23:36:44,043 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2022-02-20 23:36:44,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:44,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:44,043 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 106 states have (on average 1.330188679245283) internal successors, (141), 130 states have internal predecessors, (141), 0 states have call successors, (0), 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:36:44,044 INFO L87 Difference]: Start difference. First operand has 131 states, 106 states have (on average 1.330188679245283) internal successors, (141), 130 states have internal predecessors, (141), 0 states have call successors, (0), 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:36:44,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:44,051 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2022-02-20 23:36:44,051 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2022-02-20 23:36:44,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:44,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:44,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:44,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:44,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 106 states have (on average 1.330188679245283) internal successors, (141), 130 states have internal predecessors, (141), 0 states have call successors, (0), 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:36:44,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2022-02-20 23:36:44,053 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 25 [2022-02-20 23:36:44,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:44,053 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2022-02-20 23:36:44,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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:36:44,053 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2022-02-20 23:36:44,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 23:36:44,054 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:44,054 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, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:44,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 23:36:44,054 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2022-02-20 23:36:44,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:44,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1096862923, now seen corresponding path program 1 times [2022-02-20 23:36:44,055 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:44,055 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840353682] [2022-02-20 23:36:44,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:44,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:44,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {10107#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); {10107#true} is VALID [2022-02-20 23:36:44,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {10107#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~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem9#1, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#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(12);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; {10107#true} is VALID [2022-02-20 23:36:44,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {10107#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1005 {10107#true} is VALID [2022-02-20 23:36:44,194 INFO L290 TraceCheckUtils]: 3: Hoare triple {10107#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L1005-1 {10107#true} is VALID [2022-02-20 23:36:44,194 INFO L290 TraceCheckUtils]: 4: Hoare triple {10107#true} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L1006 {10107#true} is VALID [2022-02-20 23:36:44,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {10107#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {10109#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))} is VALID [2022-02-20 23:36:44,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {10109#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {10109#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))} is VALID [2022-02-20 23:36:44,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {10109#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {10109#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))} is VALID [2022-02-20 23:36:44,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {10109#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))} SUMMARY for call write~int(1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1012-3 {10110#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))} is VALID [2022-02-20 23:36:44,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {10110#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))} call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(12); {10111#(and (not (= |ULTIMATE.start_main_#t~malloc6#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_#t~malloc6#1.base|) 1))} is VALID [2022-02-20 23:36:44,197 INFO L290 TraceCheckUtils]: 10: Hoare triple {10111#(and (not (= |ULTIMATE.start_main_#t~malloc6#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_#t~malloc6#1.base|) 1))} SUMMARY for call write~$Pointer$(main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1022 {10112#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:36:44,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {10112#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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~malloc6#1.base, main_#t~malloc6#1.offset; {10112#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:36:44,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {10112#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1023 {10113#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_#t~mem7#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:36:44,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {10113#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_#t~mem7#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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 write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem7#1.base, 4 + main_#t~mem7#1.offset, 4); srcloc: L1023-1 {10112#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:36:44,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {10112#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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~mem7#1.base, main_#t~mem7#1.offset; {10112#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:36:44,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {10112#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1024 {10114#(and (not (= |ULTIMATE.start_main_#t~mem8#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:36:44,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {10114#(and (not (= |ULTIMATE.start_main_#t~mem8#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} SUMMARY for call write~int(2, main_#t~mem8#1.base, 8 + main_#t~mem8#1.offset, 4); srcloc: L1024-1 {10115#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:44,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {10115#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {10116#(= (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:36:44,201 INFO L290 TraceCheckUtils]: 18: Hoare triple {10116#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {10116#(= (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:36:44,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {10116#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} goto; {10116#(= (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:36:44,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {10116#(= (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~mem9#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1030-2 {10116#(= (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:36:44,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {10116#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1; {10116#(= (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:36:44,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {10116#(= (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~mem12#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1035-4 {10116#(= (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:36:44,205 INFO L290 TraceCheckUtils]: 23: Hoare triple {10116#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} assume !!(1 == main_#t~mem12#1);havoc main_#t~mem12#1; {10116#(= (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:36:44,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {10116#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} goto; {10116#(= (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:36:44,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {10116#(= (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~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1035-5 {10117#(= 1 (select |#valid| |ULTIMATE.start_main_#t~mem13#1.base|))} is VALID [2022-02-20 23:36:44,208 INFO L290 TraceCheckUtils]: 26: Hoare triple {10117#(= 1 (select |#valid| |ULTIMATE.start_main_#t~mem13#1.base|))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {10118#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:36:44,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {10118#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(1 == #valid[main_~x~0#1.base]); {10108#false} is VALID [2022-02-20 23:36:44,209 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:36:44,209 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:44,209 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840353682] [2022-02-20 23:36:44,209 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840353682] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:44,209 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:44,209 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 23:36:44,209 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798635649] [2022-02-20 23:36:44,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:44,210 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-02-20 23:36:44,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:44,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 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:36:44,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:44,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:36:44,230 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:44,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:36:44,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:36:44,230 INFO L87 Difference]: Start difference. First operand 131 states and 141 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 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:36:45,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:45,266 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2022-02-20 23:36:45,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 23:36:45,267 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-02-20 23:36:45,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:45,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 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:36:45,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 188 transitions. [2022-02-20 23:36:45,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 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:36:45,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 188 transitions. [2022-02-20 23:36:45,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 188 transitions. [2022-02-20 23:36:45,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:45,398 INFO L225 Difference]: With dead ends: 185 [2022-02-20 23:36:45,398 INFO L226 Difference]: Without dead ends: 185 [2022-02-20 23:36:45,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2022-02-20 23:36:45,399 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 178 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:45,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 347 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:36:45,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-02-20 23:36:45,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 137. [2022-02-20 23:36:45,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:45,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 137 states, 112 states have (on average 1.3214285714285714) internal successors, (148), 136 states have internal predecessors, (148), 0 states have call successors, (0), 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:36:45,401 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 137 states, 112 states have (on average 1.3214285714285714) internal successors, (148), 136 states have internal predecessors, (148), 0 states have call successors, (0), 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:36:45,401 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 137 states, 112 states have (on average 1.3214285714285714) internal successors, (148), 136 states have internal predecessors, (148), 0 states have call successors, (0), 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:36:45,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:45,406 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2022-02-20 23:36:45,406 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 190 transitions. [2022-02-20 23:36:45,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:45,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:45,407 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 112 states have (on average 1.3214285714285714) internal successors, (148), 136 states have internal predecessors, (148), 0 states have call successors, (0), 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 185 states. [2022-02-20 23:36:45,407 INFO L87 Difference]: Start difference. First operand has 137 states, 112 states have (on average 1.3214285714285714) internal successors, (148), 136 states have internal predecessors, (148), 0 states have call successors, (0), 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 185 states. [2022-02-20 23:36:45,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:45,409 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2022-02-20 23:36:45,409 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 190 transitions. [2022-02-20 23:36:45,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:45,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:45,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:45,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:45,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 112 states have (on average 1.3214285714285714) internal successors, (148), 136 states have internal predecessors, (148), 0 states have call successors, (0), 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:36:45,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2022-02-20 23:36:45,412 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 28 [2022-02-20 23:36:45,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:45,412 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2022-02-20 23:36:45,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 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:36:45,413 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2022-02-20 23:36:45,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 23:36:45,413 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:45,414 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, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:45,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-20 23:36:45,414 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2022-02-20 23:36:45,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:45,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1096862922, now seen corresponding path program 1 times [2022-02-20 23:36:45,414 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:45,415 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019150984] [2022-02-20 23:36:45,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:45,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:45,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {10831#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); {10831#true} is VALID [2022-02-20 23:36:45,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {10831#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~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem9#1, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#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(12);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; {10831#true} is VALID [2022-02-20 23:36:45,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {10831#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L1005 {10831#true} is VALID [2022-02-20 23:36:45,626 INFO L290 TraceCheckUtils]: 3: Hoare triple {10831#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L1005-1 {10831#true} is VALID [2022-02-20 23:36:45,626 INFO L290 TraceCheckUtils]: 4: Hoare triple {10831#true} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L1006 {10831#true} is VALID [2022-02-20 23:36:45,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {10831#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {10833#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))} is VALID [2022-02-20 23:36:45,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {10833#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {10833#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))} is VALID [2022-02-20 23:36:45,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {10833#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {10833#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))} is VALID [2022-02-20 23:36:45,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {10833#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))} SUMMARY for call write~int(1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1012-3 {10834#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))} is VALID [2022-02-20 23:36:45,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {10834#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))} call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(12); {10835#(and (not (= |ULTIMATE.start_main_#t~malloc6#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (<= 12 (select |#length| |ULTIMATE.start_main_#t~malloc6#1.base|)) (= |ULTIMATE.start_main_#t~malloc6#1.offset| 0))} is VALID [2022-02-20 23:36:45,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {10835#(and (not (= |ULTIMATE.start_main_#t~malloc6#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (<= 12 (select |#length| |ULTIMATE.start_main_#t~malloc6#1.base|)) (= |ULTIMATE.start_main_#t~malloc6#1.offset| 0))} SUMMARY for call write~$Pointer$(main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1022 {10836#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:45,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {10836#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {10836#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:45,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {10836#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1023 {10837#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_#t~mem7#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:45,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {10837#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_#t~mem7#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem7#1.base, 4 + main_#t~mem7#1.offset, 4); srcloc: L1023-1 {10836#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:45,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {10836#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {10836#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:45,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {10836#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1024 {10838#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (not (= |ULTIMATE.start_main_#t~mem8#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:36:45,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {10838#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (not (= |ULTIMATE.start_main_#t~mem8#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call write~int(2, main_#t~mem8#1.base, 8 + main_#t~mem8#1.offset, 4); srcloc: L1024-1 {10839#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:36:45,634 INFO L290 TraceCheckUtils]: 17: Hoare triple {10839#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {10840#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:45,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {10840#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {10840#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:45,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {10840#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} goto; {10840#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:45,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {10840#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call main_#t~mem9#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1030-2 {10840#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:45,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {10840#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1; {10840#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:45,637 INFO L290 TraceCheckUtils]: 22: Hoare triple {10840#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call main_#t~mem12#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1035-4 {10840#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:45,637 INFO L290 TraceCheckUtils]: 23: Hoare triple {10840#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} assume !!(1 == main_#t~mem12#1);havoc main_#t~mem12#1; {10840#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:45,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {10840#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} goto; {10840#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:45,638 INFO L290 TraceCheckUtils]: 25: Hoare triple {10840#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1035-5 {10841#(and (<= 12 (select |#length| |ULTIMATE.start_main_#t~mem13#1.base|)) (= |ULTIMATE.start_main_#t~mem13#1.offset| 0))} is VALID [2022-02-20 23:36:45,639 INFO L290 TraceCheckUtils]: 26: Hoare triple {10841#(and (<= 12 (select |#length| |ULTIMATE.start_main_#t~mem13#1.base|)) (= |ULTIMATE.start_main_#t~mem13#1.offset| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {10842#(and (<= 12 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} is VALID [2022-02-20 23:36:45,640 INFO L290 TraceCheckUtils]: 27: Hoare triple {10842#(and (<= 12 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} assume !(4 + (8 + main_~x~0#1.offset) <= #length[main_~x~0#1.base] && 0 <= 8 + main_~x~0#1.offset); {10832#false} is VALID [2022-02-20 23:36:45,641 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:36:45,641 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:45,641 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019150984] [2022-02-20 23:36:45,641 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019150984] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:45,641 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:45,641 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 23:36:45,642 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928612458] [2022-02-20 23:36:45,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:45,642 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-02-20 23:36:45,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:45,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 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:36:45,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:45,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:36:45,660 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:45,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:36:45,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:36:45,661 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 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:36:46,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:46,773 INFO L93 Difference]: Finished difference Result 217 states and 221 transitions. [2022-02-20 23:36:46,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 23:36:46,773 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-02-20 23:36:46,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:46,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 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:36:46,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 220 transitions. [2022-02-20 23:36:46,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 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:36:46,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 220 transitions. [2022-02-20 23:36:46,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 220 transitions. [2022-02-20 23:36:46,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:46,922 INFO L225 Difference]: With dead ends: 217 [2022-02-20 23:36:46,923 INFO L226 Difference]: Without dead ends: 217 [2022-02-20 23:36:46,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-02-20 23:36:46,923 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 227 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:46,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 334 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:36:46,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-02-20 23:36:46,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 137. [2022-02-20 23:36:46,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:46,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 217 states. Second operand has 137 states, 112 states have (on average 1.3125) internal successors, (147), 136 states have internal predecessors, (147), 0 states have call successors, (0), 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:36:46,925 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand has 137 states, 112 states have (on average 1.3125) internal successors, (147), 136 states have internal predecessors, (147), 0 states have call successors, (0), 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:36:46,926 INFO L87 Difference]: Start difference. First operand 217 states. Second operand has 137 states, 112 states have (on average 1.3125) internal successors, (147), 136 states have internal predecessors, (147), 0 states have call successors, (0), 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:36:46,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:46,928 INFO L93 Difference]: Finished difference Result 217 states and 221 transitions. [2022-02-20 23:36:46,928 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 221 transitions. [2022-02-20 23:36:46,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:46,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:46,929 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 112 states have (on average 1.3125) internal successors, (147), 136 states have internal predecessors, (147), 0 states have call successors, (0), 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 217 states. [2022-02-20 23:36:46,929 INFO L87 Difference]: Start difference. First operand has 137 states, 112 states have (on average 1.3125) internal successors, (147), 136 states have internal predecessors, (147), 0 states have call successors, (0), 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 217 states. [2022-02-20 23:36:46,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:46,932 INFO L93 Difference]: Finished difference Result 217 states and 221 transitions. [2022-02-20 23:36:46,932 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 221 transitions. [2022-02-20 23:36:46,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:46,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:46,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:46,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:46,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 112 states have (on average 1.3125) internal successors, (147), 136 states have internal predecessors, (147), 0 states have call successors, (0), 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:36:46,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 147 transitions. [2022-02-20 23:36:46,935 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 147 transitions. Word has length 28 [2022-02-20 23:36:46,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:46,935 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 147 transitions. [2022-02-20 23:36:46,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 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:36:46,935 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 147 transitions. [2022-02-20 23:36:46,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:36:46,936 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:46,936 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:46,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-20 23:36:46,936 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2022-02-20 23:36:46,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:46,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1818276907, now seen corresponding path program 1 times [2022-02-20 23:36:46,937 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:46,937 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179528803] [2022-02-20 23:36:46,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:46,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:36:46,962 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:36:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:36:46,993 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 23:36:46,994 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:36:46,994 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (63 of 64 remaining) [2022-02-20 23:36:46,996 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (62 of 64 remaining) [2022-02-20 23:36:46,996 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (61 of 64 remaining) [2022-02-20 23:36:46,996 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (60 of 64 remaining) [2022-02-20 23:36:46,996 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (59 of 64 remaining) [2022-02-20 23:36:46,997 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (58 of 64 remaining) [2022-02-20 23:36:46,997 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (57 of 64 remaining) [2022-02-20 23:36:46,997 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (56 of 64 remaining) [2022-02-20 23:36:46,997 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (55 of 64 remaining) [2022-02-20 23:36:46,997 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (54 of 64 remaining) [2022-02-20 23:36:46,997 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (53 of 64 remaining) [2022-02-20 23:36:46,997 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (52 of 64 remaining) [2022-02-20 23:36:46,998 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (51 of 64 remaining) [2022-02-20 23:36:46,998 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (50 of 64 remaining) [2022-02-20 23:36:46,998 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (49 of 64 remaining) [2022-02-20 23:36:46,998 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (48 of 64 remaining) [2022-02-20 23:36:46,998 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (47 of 64 remaining) [2022-02-20 23:36:46,998 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (46 of 64 remaining) [2022-02-20 23:36:46,998 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (45 of 64 remaining) [2022-02-20 23:36:46,999 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (44 of 64 remaining) [2022-02-20 23:36:46,999 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (43 of 64 remaining) [2022-02-20 23:36:46,999 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (42 of 64 remaining) [2022-02-20 23:36:46,999 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (41 of 64 remaining) [2022-02-20 23:36:46,999 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (40 of 64 remaining) [2022-02-20 23:36:46,999 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (39 of 64 remaining) [2022-02-20 23:36:46,999 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (38 of 64 remaining) [2022-02-20 23:36:47,000 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (37 of 64 remaining) [2022-02-20 23:36:47,000 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (36 of 64 remaining) [2022-02-20 23:36:47,000 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (35 of 64 remaining) [2022-02-20 23:36:47,000 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (34 of 64 remaining) [2022-02-20 23:36:47,000 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK (33 of 64 remaining) [2022-02-20 23:36:47,000 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (32 of 64 remaining) [2022-02-20 23:36:47,000 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (31 of 64 remaining) [2022-02-20 23:36:47,001 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (30 of 64 remaining) [2022-02-20 23:36:47,001 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (29 of 64 remaining) [2022-02-20 23:36:47,001 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (28 of 64 remaining) [2022-02-20 23:36:47,001 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (27 of 64 remaining) [2022-02-20 23:36:47,001 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (26 of 64 remaining) [2022-02-20 23:36:47,001 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (25 of 64 remaining) [2022-02-20 23:36:47,001 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (24 of 64 remaining) [2022-02-20 23:36:47,001 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK (23 of 64 remaining) [2022-02-20 23:36:47,002 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION (22 of 64 remaining) [2022-02-20 23:36:47,002 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION (21 of 64 remaining) [2022-02-20 23:36:47,002 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION (20 of 64 remaining) [2022-02-20 23:36:47,002 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION (19 of 64 remaining) [2022-02-20 23:36:47,002 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION (18 of 64 remaining) [2022-02-20 23:36:47,002 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION (17 of 64 remaining) [2022-02-20 23:36:47,002 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION (16 of 64 remaining) [2022-02-20 23:36:47,002 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION (15 of 64 remaining) [2022-02-20 23:36:47,003 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE (14 of 64 remaining) [2022-02-20 23:36:47,003 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE (13 of 64 remaining) [2022-02-20 23:36:47,003 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE (12 of 64 remaining) [2022-02-20 23:36:47,003 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION (11 of 64 remaining) [2022-02-20 23:36:47,003 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION (10 of 64 remaining) [2022-02-20 23:36:47,003 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK (9 of 64 remaining) [2022-02-20 23:36:47,003 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION (8 of 64 remaining) [2022-02-20 23:36:47,004 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION (7 of 64 remaining) [2022-02-20 23:36:47,004 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE (6 of 64 remaining) [2022-02-20 23:36:47,004 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE (5 of 64 remaining) [2022-02-20 23:36:47,004 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE (4 of 64 remaining) [2022-02-20 23:36:47,004 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE (3 of 64 remaining) [2022-02-20 23:36:47,004 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE (2 of 64 remaining) [2022-02-20 23:36:47,004 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE (1 of 64 remaining) [2022-02-20 23:36:47,005 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK (0 of 64 remaining) [2022-02-20 23:36:47,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-20 23:36:47,007 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:47,009 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:36:47,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:36:47 BoogieIcfgContainer [2022-02-20 23:36:47,028 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:36:47,028 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:36:47,028 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:36:47,028 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:36:47,029 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:36:33" (3/4) ... [2022-02-20 23:36:47,030 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 23:36:47,081 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 23:36:47,081 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:36:47,082 INFO L158 Benchmark]: Toolchain (without parser) took 14696.33ms. Allocated memory was 88.1MB in the beginning and 157.3MB in the end (delta: 69.2MB). Free memory was 53.0MB in the beginning and 119.8MB in the end (delta: -66.8MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2022-02-20 23:36:47,082 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 73.4MB. Free memory was 51.9MB in the beginning and 51.9MB in the end (delta: 49.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:36:47,082 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.92ms. Allocated memory is still 88.1MB. Free memory was 52.8MB in the beginning and 63.5MB in the end (delta: -10.6MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2022-02-20 23:36:47,082 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.09ms. Allocated memory is still 88.1MB. Free memory was 63.5MB in the beginning and 61.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:36:47,083 INFO L158 Benchmark]: Boogie Preprocessor took 48.75ms. Allocated memory is still 88.1MB. Free memory was 61.0MB in the beginning and 58.6MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 23:36:47,083 INFO L158 Benchmark]: RCFGBuilder took 663.50ms. Allocated memory is still 88.1MB. Free memory was 58.6MB in the beginning and 63.0MB in the end (delta: -4.5MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2022-02-20 23:36:47,083 INFO L158 Benchmark]: TraceAbstraction took 13493.73ms. Allocated memory was 88.1MB in the beginning and 157.3MB in the end (delta: 69.2MB). Free memory was 62.6MB in the beginning and 124.0MB in the end (delta: -61.4MB). Peak memory consumption was 92.5MB. Max. memory is 16.1GB. [2022-02-20 23:36:47,083 INFO L158 Benchmark]: Witness Printer took 53.18ms. Allocated memory is still 157.3MB. Free memory was 124.0MB in the beginning and 119.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 23:36:47,086 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.13ms. Allocated memory is still 73.4MB. Free memory was 51.9MB in the beginning and 51.9MB in the end (delta: 49.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.92ms. Allocated memory is still 88.1MB. Free memory was 52.8MB in the beginning and 63.5MB in the end (delta: -10.6MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.09ms. Allocated memory is still 88.1MB. Free memory was 63.5MB in the beginning and 61.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.75ms. Allocated memory is still 88.1MB. Free memory was 61.0MB in the beginning and 58.6MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 663.50ms. Allocated memory is still 88.1MB. Free memory was 58.6MB in the beginning and 63.0MB in the end (delta: -4.5MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. * TraceAbstraction took 13493.73ms. Allocated memory was 88.1MB in the beginning and 157.3MB in the end (delta: 69.2MB). Free memory was 62.6MB in the beginning and 124.0MB in the end (delta: -61.4MB). Peak memory consumption was 92.5MB. Max. memory is 16.1GB. * Witness Printer took 53.18ms. Allocated memory is still 157.3MB. Free memory was 124.0MB in the beginning and 119.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1037]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1004] SLL* head = malloc(sizeof(SLL)); [L1005] head->next = ((void*)0) VAL [head={-1:0}] [L1006] head->prev = ((void*)0) VAL [head={-1:0}] [L1007] head->data = 0 VAL [head={-1:0}] [L1009] SLL* x = head; VAL [head={-1:0}, x={-1:0}] [L1012] COND FALSE !(__VERIFIER_nondet_int()) [L1021] x->data = 1 VAL [head={-1:0}, x={-1:0}] [L1022] x->next = malloc(sizeof(SLL)) VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}] [L1023] EXPR x->next VAL [head={-1:0}, x={-1:0}, x->next={-2:0}] [L1023] x->next->prev = x VAL [head={-1:0}, x={-1:0}, x->next={-2:0}] [L1024] EXPR x->next VAL [head={-1:0}, x={-1:0}, x->next={-2:0}] [L1024] x->next->data = 2 VAL [head={-1:0}, x={-1:0}, x->next={-2:0}] [L1026] x = head VAL [head={-1:0}, x={-1:0}] [L1028] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, x={-1:0}] [L1030] EXPR x->data VAL [head={-1:0}, x={-1:0}, x->data=1] [L1030] COND FALSE !(1 != x->data) [L1035] EXPR x->data VAL [head={-1:0}, x={-1:0}, x->data=1] [L1035] COND FALSE !(!(1 == x->data)) [L1036] EXPR x->next VAL [head={-1:0}, x={-1:0}, x->next={-2:0}] [L1036] x = x->next [L1037] EXPR x->data VAL [head={-1:0}, x={-2:0}, x->data=2] [L1037] COND TRUE !(2 != x->data) [L1037] reach_error() VAL [head={-1:0}, x={-2:0}] - 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: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: 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: 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 all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1024]: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1024]: 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: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: 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: 1032]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: 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: 1037]: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: 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 pointer dereference always succeeds Unable to prove that pointer dereference 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: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: 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, 136 locations, 64 error locations. Started 1 CEGAR loops. OverallTime: 13.4s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2210 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2210 mSDsluCounter, 4086 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2774 mSDsCounter, 286 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4440 IncrementalHoareTripleChecker+Invalid, 4726 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 286 mSolverCounterUnsat, 1312 mSDtfsCounter, 4440 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=3, InterpolantAutomatonStates: 144, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 454 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 316 NumberOfCodeBlocks, 316 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 268 ConstructedInterpolants, 0 QuantifiedInterpolants, 2023 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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:36:47,120 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)