./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_9.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_9.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 00:02:39,236 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 00:02:39,237 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 00:02:39,267 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 00:02:39,268 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 00:02:39,270 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 00:02:39,275 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 00:02:39,277 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 00:02:39,279 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 00:02:39,282 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 00:02:39,282 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 00:02:39,283 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 00:02:39,283 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 00:02:39,285 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 00:02:39,286 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 00:02:39,288 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 00:02:39,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 00:02:39,289 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 00:02:39,291 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 00:02:39,295 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 00:02:39,295 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 00:02:39,312 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 00:02:39,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 00:02:39,314 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 00:02:39,318 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 00:02:39,318 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 00:02:39,319 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 00:02:39,320 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 00:02:39,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 00:02:39,321 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 00:02:39,321 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 00:02:39,322 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 00:02:39,323 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 00:02:39,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 00:02:39,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 00:02:39,325 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 00:02:39,325 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 00:02:39,325 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 00:02:39,325 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 00:02:39,326 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 00:02:39,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 00:02:39,327 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-21 00:02:39,348 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 00:02:39,348 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 00:02:39,348 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 00:02:39,349 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 00:02:39,349 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 00:02:39,349 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 00:02:39,350 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 00:02:39,350 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 00:02:39,350 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 00:02:39,350 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 00:02:39,351 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 00:02:39,351 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 00:02:39,351 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 00:02:39,351 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 00:02:39,351 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 00:02:39,352 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-21 00:02:39,352 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-21 00:02:39,352 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-21 00:02:39,352 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 00:02:39,352 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-21 00:02:39,352 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 00:02:39,353 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 00:02:39,353 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 00:02:39,353 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 00:02:39,353 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 00:02:39,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:02:39,353 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 00:02:39,354 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 00:02:39,354 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 00:02:39,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 00:02:39,354 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 [2022-02-21 00:02:39,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 00:02:39,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 00:02:39,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 00:02:39,578 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 00:02:39,579 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 00:02:39,579 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_9.c [2022-02-21 00:02:39,646 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8784621ee/e7c9d28b07f14cfe808a756256c24a66/FLAGf94c1a01a [2022-02-21 00:02:40,012 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 00:02:40,013 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c [2022-02-21 00:02:40,020 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8784621ee/e7c9d28b07f14cfe808a756256c24a66/FLAGf94c1a01a [2022-02-21 00:02:40,035 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8784621ee/e7c9d28b07f14cfe808a756256c24a66 [2022-02-21 00:02:40,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 00:02:40,038 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 00:02:40,041 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 00:02:40,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 00:02:40,043 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 00:02:40,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:02:40" (1/1) ... [2022-02-21 00:02:40,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@711a6483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:40, skipping insertion in model container [2022-02-21 00:02:40,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:02:40" (1/1) ... [2022-02-21 00:02:40,049 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 00:02:40,065 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 00:02:40,206 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/locks/test_locks_9.c[3555,3568] [2022-02-21 00:02:40,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:02:40,214 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 00:02:40,229 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/locks/test_locks_9.c[3555,3568] [2022-02-21 00:02:40,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:02:40,239 INFO L208 MainTranslator]: Completed translation [2022-02-21 00:02:40,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:40 WrapperNode [2022-02-21 00:02:40,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 00:02:40,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 00:02:40,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 00:02:40,240 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 00:02:40,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:40" (1/1) ... [2022-02-21 00:02:40,251 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:40" (1/1) ... [2022-02-21 00:02:40,268 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 127 [2022-02-21 00:02:40,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 00:02:40,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 00:02:40,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 00:02:40,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 00:02:40,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:40" (1/1) ... [2022-02-21 00:02:40,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:40" (1/1) ... [2022-02-21 00:02:40,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:40" (1/1) ... [2022-02-21 00:02:40,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:40" (1/1) ... [2022-02-21 00:02:40,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:40" (1/1) ... [2022-02-21 00:02:40,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:40" (1/1) ... [2022-02-21 00:02:40,287 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:40" (1/1) ... [2022-02-21 00:02:40,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 00:02:40,294 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 00:02:40,294 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 00:02:40,294 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 00:02:40,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:40" (1/1) ... [2022-02-21 00:02:40,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:02:40,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:40,316 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-21 00:02:40,331 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-21 00:02:40,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 00:02:40,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 00:02:40,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 00:02:40,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 00:02:40,391 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 00:02:40,392 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 00:02:40,565 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 00:02:40,569 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 00:02:40,569 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 00:02:40,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:40 BoogieIcfgContainer [2022-02-21 00:02:40,571 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 00:02:40,572 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 00:02:40,572 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 00:02:40,577 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 00:02:40,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 12:02:40" (1/3) ... [2022-02-21 00:02:40,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a45870e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:02:40, skipping insertion in model container [2022-02-21 00:02:40,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:40" (2/3) ... [2022-02-21 00:02:40,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a45870e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:02:40, skipping insertion in model container [2022-02-21 00:02:40,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:40" (3/3) ... [2022-02-21 00:02:40,579 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2022-02-21 00:02:40,582 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 00:02:40,582 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-21 00:02:40,609 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 00:02:40,615 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-21 00:02:40,615 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-21 00:02:40,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 37 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:40,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 00:02:40,638 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:40,638 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 00:02:40,639 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:40,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:40,642 INFO L85 PathProgramCache]: Analyzing trace with hash 28702923, now seen corresponding path program 1 times [2022-02-21 00:02:40,648 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:40,648 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166265510] [2022-02-21 00:02:40,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:40,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:40,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {41#true} is VALID [2022-02-21 00:02:40,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; {41#true} is VALID [2022-02-21 00:02:40,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} assume false; {42#false} is VALID [2022-02-21 00:02:40,804 INFO L290 TraceCheckUtils]: 3: Hoare triple {42#false} main_#res#1 := 0; {42#false} is VALID [2022-02-21 00:02:40,805 INFO L290 TraceCheckUtils]: 4: Hoare triple {42#false} assume !(#valid == main_old_#valid#1); {42#false} is VALID [2022-02-21 00:02:40,806 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-21 00:02:40,806 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:40,806 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166265510] [2022-02-21 00:02:40,807 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166265510] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:40,807 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:40,807 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:40,808 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334668966] [2022-02-21 00:02:40,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:40,812 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 00:02:40,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:40,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:40,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:40,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-21 00:02:40,830 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:40,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 00:02:40,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 00:02:40,851 INFO L87 Difference]: Start difference. First operand has 38 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 37 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:40,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:40,910 INFO L93 Difference]: Finished difference Result 38 states and 64 transitions. [2022-02-21 00:02:40,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 00:02:40,911 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 00:02:40,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:40,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:40,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2022-02-21 00:02:40,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:40,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2022-02-21 00:02:40,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 67 transitions. [2022-02-21 00:02:41,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:41,016 INFO L225 Difference]: With dead ends: 38 [2022-02-21 00:02:41,016 INFO L226 Difference]: Without dead ends: 36 [2022-02-21 00:02:41,018 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 00:02:41,020 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:41,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:41,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-21 00:02:41,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-02-21 00:02:41,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:41,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 35 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:41,042 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 35 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:41,043 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 35 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:41,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:41,046 INFO L93 Difference]: Finished difference Result 36 states and 62 transitions. [2022-02-21 00:02:41,046 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 62 transitions. [2022-02-21 00:02:41,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:41,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:41,047 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 35 states have internal predecessors, (62), 0 states have call successors, (0), 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 36 states. [2022-02-21 00:02:41,048 INFO L87 Difference]: Start difference. First operand has 36 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 35 states have internal predecessors, (62), 0 states have call successors, (0), 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 36 states. [2022-02-21 00:02:41,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:41,051 INFO L93 Difference]: Finished difference Result 36 states and 62 transitions. [2022-02-21 00:02:41,051 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 62 transitions. [2022-02-21 00:02:41,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:41,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:41,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:41,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:41,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 35 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:41,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 62 transitions. [2022-02-21 00:02:41,055 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 62 transitions. Word has length 5 [2022-02-21 00:02:41,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:41,056 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 62 transitions. [2022-02-21 00:02:41,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:41,056 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 62 transitions. [2022-02-21 00:02:41,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 00:02:41,057 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:41,057 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 00:02:41,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 00:02:41,057 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:41,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:41,058 INFO L85 PathProgramCache]: Analyzing trace with hash 889697419, now seen corresponding path program 1 times [2022-02-21 00:02:41,059 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:41,059 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738038015] [2022-02-21 00:02:41,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:41,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:41,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {191#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {191#true} is VALID [2022-02-21 00:02:41,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; {193#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:41,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {193#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {193#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:41,096 INFO L290 TraceCheckUtils]: 3: Hoare triple {193#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume 0 == main_~cond~0#1; {193#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:41,096 INFO L290 TraceCheckUtils]: 4: Hoare triple {193#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} main_#res#1 := 0; {193#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:41,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {193#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(#valid == main_old_#valid#1); {192#false} is VALID [2022-02-21 00:02:41,097 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-21 00:02:41,097 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:41,097 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738038015] [2022-02-21 00:02:41,098 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738038015] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:41,098 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:41,098 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:41,098 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191380541] [2022-02-21 00:02:41,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:41,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 00:02:41,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:41,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:41,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:41,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:41,105 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:41,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:41,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:41,106 INFO L87 Difference]: Start difference. First operand 36 states and 62 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:41,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:41,186 INFO L93 Difference]: Finished difference Result 35 states and 61 transitions. [2022-02-21 00:02:41,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:41,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 00:02:41,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:41,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:41,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-02-21 00:02:41,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:41,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-02-21 00:02:41,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2022-02-21 00:02:41,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:41,255 INFO L225 Difference]: With dead ends: 35 [2022-02-21 00:02:41,255 INFO L226 Difference]: Without dead ends: 33 [2022-02-21 00:02:41,256 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-21 00:02:41,257 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:41,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 61 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:41,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-21 00:02:41,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-21 00:02:41,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:41,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:41,264 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:41,266 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:41,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:41,269 INFO L93 Difference]: Finished difference Result 33 states and 59 transitions. [2022-02-21 00:02:41,269 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 59 transitions. [2022-02-21 00:02:41,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:41,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:41,270 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 33 states. [2022-02-21 00:02:41,271 INFO L87 Difference]: Start difference. First operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 33 states. [2022-02-21 00:02:41,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:41,273 INFO L93 Difference]: Finished difference Result 33 states and 59 transitions. [2022-02-21 00:02:41,273 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 59 transitions. [2022-02-21 00:02:41,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:41,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:41,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:41,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:41,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:41,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 59 transitions. [2022-02-21 00:02:41,277 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 59 transitions. Word has length 6 [2022-02-21 00:02:41,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:41,277 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 59 transitions. [2022-02-21 00:02:41,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:41,278 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 59 transitions. [2022-02-21 00:02:41,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-21 00:02:41,279 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:41,279 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:41,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 00:02:41,280 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:41,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:41,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1657621241, now seen corresponding path program 1 times [2022-02-21 00:02:41,280 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:41,281 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877455151] [2022-02-21 00:02:41,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:41,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:41,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {330#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {330#true} is VALID [2022-02-21 00:02:41,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {330#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; {330#true} is VALID [2022-02-21 00:02:41,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {330#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {330#true} is VALID [2022-02-21 00:02:41,373 INFO L290 TraceCheckUtils]: 3: Hoare triple {330#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; {330#true} is VALID [2022-02-21 00:02:41,373 INFO L290 TraceCheckUtils]: 4: Hoare triple {330#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {332#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:41,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {332#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {332#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:41,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {332#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume !(0 != main_~p3~0#1); {332#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:41,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {332#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {332#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:41,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {332#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {332#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:41,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {332#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {332#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:41,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {332#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {332#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:41,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {332#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {332#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:41,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {332#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {332#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:41,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {332#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p1~0#1; {332#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:41,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {332#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 1 != main_~lk1~0#1; {331#false} is VALID [2022-02-21 00:02:41,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {331#false} assume !false; {331#false} is VALID [2022-02-21 00:02:41,377 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-21 00:02:41,378 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:41,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877455151] [2022-02-21 00:02:41,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877455151] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:41,378 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:41,378 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:41,378 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509526635] [2022-02-21 00:02:41,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:41,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-21 00:02:41,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:41,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-21 00:02:41,388 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-21 00:02:41,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:41,389 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:41,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:41,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:41,389 INFO L87 Difference]: Start difference. First operand 33 states and 59 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-21 00:02:41,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:41,456 INFO L93 Difference]: Finished difference Result 63 states and 113 transitions. [2022-02-21 00:02:41,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:41,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-21 00:02:41,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:41,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-21 00:02:41,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2022-02-21 00:02:41,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-21 00:02:41,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2022-02-21 00:02:41,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 114 transitions. [2022-02-21 00:02:41,550 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-21 00:02:41,552 INFO L225 Difference]: With dead ends: 63 [2022-02-21 00:02:41,552 INFO L226 Difference]: Without dead ends: 63 [2022-02-21 00:02:41,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 00:02:41,553 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 43 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:41,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 115 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:41,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-02-21 00:02:41,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 43. [2022-02-21 00:02:41,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:41,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:41,557 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:41,557 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:41,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:41,559 INFO L93 Difference]: Finished difference Result 63 states and 113 transitions. [2022-02-21 00:02:41,560 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 113 transitions. [2022-02-21 00:02:41,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:41,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:41,560 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 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 63 states. [2022-02-21 00:02:41,561 INFO L87 Difference]: Start difference. First operand has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 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 63 states. [2022-02-21 00:02:41,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:41,563 INFO L93 Difference]: Finished difference Result 63 states and 113 transitions. [2022-02-21 00:02:41,563 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 113 transitions. [2022-02-21 00:02:41,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:41,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:41,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:41,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:41,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:41,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 78 transitions. [2022-02-21 00:02:41,565 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 78 transitions. Word has length 16 [2022-02-21 00:02:41,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:41,565 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 78 transitions. [2022-02-21 00:02:41,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-21 00:02:41,566 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 78 transitions. [2022-02-21 00:02:41,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-21 00:02:41,566 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:41,566 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:41,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 00:02:41,567 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:41,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:41,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1399455803, now seen corresponding path program 1 times [2022-02-21 00:02:41,568 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:41,568 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029197398] [2022-02-21 00:02:41,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:41,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:41,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {567#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {567#true} is VALID [2022-02-21 00:02:41,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {567#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; {567#true} is VALID [2022-02-21 00:02:41,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {567#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {567#true} is VALID [2022-02-21 00:02:41,602 INFO L290 TraceCheckUtils]: 3: Hoare triple {567#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; {567#true} is VALID [2022-02-21 00:02:41,602 INFO L290 TraceCheckUtils]: 4: Hoare triple {567#true} assume !(0 != main_~p1~0#1); {569#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:41,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {569#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {569#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:41,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {569#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume !(0 != main_~p3~0#1); {569#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:41,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {569#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {569#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:41,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {569#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {569#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:41,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {569#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {569#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:41,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {569#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {569#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:41,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {569#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {569#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:41,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {569#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {569#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:41,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {569#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p1~0#1; {568#false} is VALID [2022-02-21 00:02:41,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {568#false} assume 1 != main_~lk1~0#1; {568#false} is VALID [2022-02-21 00:02:41,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {568#false} assume !false; {568#false} is VALID [2022-02-21 00:02:41,607 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-21 00:02:41,607 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:41,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029197398] [2022-02-21 00:02:41,607 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029197398] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:41,607 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:41,607 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:41,608 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450014959] [2022-02-21 00:02:41,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:41,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-21 00:02:41,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:41,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-21 00:02:41,619 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-21 00:02:41,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:41,620 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:41,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:41,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:41,621 INFO L87 Difference]: Start difference. First operand 43 states and 78 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-21 00:02:41,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:41,680 INFO L93 Difference]: Finished difference Result 63 states and 111 transitions. [2022-02-21 00:02:41,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:41,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-21 00:02:41,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:41,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-21 00:02:41,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-02-21 00:02:41,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-21 00:02:41,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-02-21 00:02:41,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2022-02-21 00:02:41,754 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-21 00:02:41,756 INFO L225 Difference]: With dead ends: 63 [2022-02-21 00:02:41,756 INFO L226 Difference]: Without dead ends: 63 [2022-02-21 00:02:41,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 00:02:41,757 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 43 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:41,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 129 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:41,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-02-21 00:02:41,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2022-02-21 00:02:41,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:41,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 61 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 60 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:41,761 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 61 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 60 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:41,762 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 61 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 60 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:41,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:41,764 INFO L93 Difference]: Finished difference Result 63 states and 111 transitions. [2022-02-21 00:02:41,764 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 111 transitions. [2022-02-21 00:02:41,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:41,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:41,765 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 60 states have internal predecessors, (110), 0 states have call successors, (0), 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 63 states. [2022-02-21 00:02:41,766 INFO L87 Difference]: Start difference. First operand has 61 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 60 states have internal predecessors, (110), 0 states have call successors, (0), 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 63 states. [2022-02-21 00:02:41,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:41,768 INFO L93 Difference]: Finished difference Result 63 states and 111 transitions. [2022-02-21 00:02:41,768 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 111 transitions. [2022-02-21 00:02:41,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:41,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:41,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:41,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:41,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 60 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:41,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 110 transitions. [2022-02-21 00:02:41,771 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 110 transitions. Word has length 16 [2022-02-21 00:02:41,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:41,772 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 110 transitions. [2022-02-21 00:02:41,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-21 00:02:41,772 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 110 transitions. [2022-02-21 00:02:41,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-21 00:02:41,773 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:41,773 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:41,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 00:02:41,773 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:41,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:41,774 INFO L85 PathProgramCache]: Analyzing trace with hash 153562753, now seen corresponding path program 1 times [2022-02-21 00:02:41,775 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:41,775 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706346525] [2022-02-21 00:02:41,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:41,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:41,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {822#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {822#true} is VALID [2022-02-21 00:02:41,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; {822#true} is VALID [2022-02-21 00:02:41,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {822#true} is VALID [2022-02-21 00:02:41,818 INFO L290 TraceCheckUtils]: 3: Hoare triple {822#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; {822#true} is VALID [2022-02-21 00:02:41,818 INFO L290 TraceCheckUtils]: 4: Hoare triple {822#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {824#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:41,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {824#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {824#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:41,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {824#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p3~0#1); {824#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:41,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {824#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {824#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:41,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {824#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {824#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:41,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {824#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {824#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:41,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {824#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {824#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:41,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {824#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {824#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:41,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {824#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {824#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:41,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {824#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p1~0#1); {823#false} is VALID [2022-02-21 00:02:41,823 INFO L290 TraceCheckUtils]: 14: Hoare triple {823#false} assume 0 != main_~p2~0#1; {823#false} is VALID [2022-02-21 00:02:41,823 INFO L290 TraceCheckUtils]: 15: Hoare triple {823#false} assume 1 != main_~lk2~0#1; {823#false} is VALID [2022-02-21 00:02:41,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-02-21 00:02:41,824 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-21 00:02:41,824 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:41,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706346525] [2022-02-21 00:02:41,825 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706346525] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:41,825 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:41,825 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:41,825 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107384502] [2022-02-21 00:02:41,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:41,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-21 00:02:41,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:41,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-21 00:02:41,839 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-21 00:02:41,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:41,839 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:41,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:41,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:41,840 INFO L87 Difference]: Start difference. First operand 61 states and 110 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-21 00:02:41,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:41,914 INFO L93 Difference]: Finished difference Result 66 states and 113 transitions. [2022-02-21 00:02:41,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:41,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-21 00:02:41,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:41,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-21 00:02:41,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-02-21 00:02:41,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-21 00:02:41,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-02-21 00:02:41,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 112 transitions. [2022-02-21 00:02:41,999 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-21 00:02:42,000 INFO L225 Difference]: With dead ends: 66 [2022-02-21 00:02:42,000 INFO L226 Difference]: Without dead ends: 66 [2022-02-21 00:02:42,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 00:02:42,002 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 45 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:42,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 144 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:42,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-02-21 00:02:42,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-02-21 00:02:42,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:42,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 64 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 63 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,007 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 64 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 63 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,007 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 64 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 63 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:42,009 INFO L93 Difference]: Finished difference Result 66 states and 113 transitions. [2022-02-21 00:02:42,009 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 113 transitions. [2022-02-21 00:02:42,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:42,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:42,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 63 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 66 states. [2022-02-21 00:02:42,010 INFO L87 Difference]: Start difference. First operand has 64 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 63 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 66 states. [2022-02-21 00:02:42,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:42,013 INFO L93 Difference]: Finished difference Result 66 states and 113 transitions. [2022-02-21 00:02:42,013 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 113 transitions. [2022-02-21 00:02:42,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:42,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:42,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:42,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:42,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 63 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 112 transitions. [2022-02-21 00:02:42,016 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 112 transitions. Word has length 17 [2022-02-21 00:02:42,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:42,017 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 112 transitions. [2022-02-21 00:02:42,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-21 00:02:42,017 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 112 transitions. [2022-02-21 00:02:42,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-21 00:02:42,017 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:42,018 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:42,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 00:02:42,018 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:42,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:42,019 INFO L85 PathProgramCache]: Analyzing trace with hash -433243261, now seen corresponding path program 1 times [2022-02-21 00:02:42,019 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:42,019 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121406217] [2022-02-21 00:02:42,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:42,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:42,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {1089#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1089#true} is VALID [2022-02-21 00:02:42,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {1089#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; {1089#true} is VALID [2022-02-21 00:02:42,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {1089#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {1089#true} is VALID [2022-02-21 00:02:42,056 INFO L290 TraceCheckUtils]: 3: Hoare triple {1089#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; {1089#true} is VALID [2022-02-21 00:02:42,056 INFO L290 TraceCheckUtils]: 4: Hoare triple {1089#true} assume !(0 != main_~p1~0#1); {1089#true} is VALID [2022-02-21 00:02:42,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {1089#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {1091#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:42,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {1091#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p3~0#1); {1091#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:42,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {1091#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1091#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:42,058 INFO L290 TraceCheckUtils]: 8: Hoare triple {1091#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1091#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:42,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {1091#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1091#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:42,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {1091#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {1091#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:42,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {1091#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {1091#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:42,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {1091#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {1091#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:42,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {1091#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p1~0#1); {1091#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:42,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {1091#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p2~0#1; {1091#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:42,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {1091#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 1 != main_~lk2~0#1; {1090#false} is VALID [2022-02-21 00:02:42,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {1090#false} assume !false; {1090#false} is VALID [2022-02-21 00:02:42,062 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-21 00:02:42,062 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:42,062 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121406217] [2022-02-21 00:02:42,062 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121406217] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:42,062 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:42,063 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:42,063 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938863570] [2022-02-21 00:02:42,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:42,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-21 00:02:42,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:42,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-21 00:02:42,076 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-21 00:02:42,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:42,076 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:42,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:42,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:42,077 INFO L87 Difference]: Start difference. First operand 64 states and 112 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-21 00:02:42,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:42,135 INFO L93 Difference]: Finished difference Result 119 states and 210 transitions. [2022-02-21 00:02:42,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:42,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-21 00:02:42,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:42,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-21 00:02:42,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-02-21 00:02:42,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-21 00:02:42,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-02-21 00:02:42,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2022-02-21 00:02:42,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:42,222 INFO L225 Difference]: With dead ends: 119 [2022-02-21 00:02:42,222 INFO L226 Difference]: Without dead ends: 119 [2022-02-21 00:02:42,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 00:02:42,223 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 40 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:42,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 113 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:42,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-02-21 00:02:42,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 85. [2022-02-21 00:02:42,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:42,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 85 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 84 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,229 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 85 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 84 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,229 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 85 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 84 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:42,232 INFO L93 Difference]: Finished difference Result 119 states and 210 transitions. [2022-02-21 00:02:42,232 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 210 transitions. [2022-02-21 00:02:42,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:42,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:42,233 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 84 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 119 states. [2022-02-21 00:02:42,234 INFO L87 Difference]: Start difference. First operand has 85 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 84 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 119 states. [2022-02-21 00:02:42,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:42,237 INFO L93 Difference]: Finished difference Result 119 states and 210 transitions. [2022-02-21 00:02:42,237 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 210 transitions. [2022-02-21 00:02:42,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:42,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:42,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:42,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:42,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 84 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 149 transitions. [2022-02-21 00:02:42,240 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 149 transitions. Word has length 17 [2022-02-21 00:02:42,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:42,241 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 149 transitions. [2022-02-21 00:02:42,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-21 00:02:42,241 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 149 transitions. [2022-02-21 00:02:42,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-21 00:02:42,242 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:42,242 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:42,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-21 00:02:42,242 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:42,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:42,243 INFO L85 PathProgramCache]: Analyzing trace with hash -175077823, now seen corresponding path program 1 times [2022-02-21 00:02:42,243 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:42,243 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703380564] [2022-02-21 00:02:42,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:42,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:42,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {1536#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1536#true} is VALID [2022-02-21 00:02:42,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {1536#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; {1536#true} is VALID [2022-02-21 00:02:42,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {1536#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {1536#true} is VALID [2022-02-21 00:02:42,274 INFO L290 TraceCheckUtils]: 3: Hoare triple {1536#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; {1536#true} is VALID [2022-02-21 00:02:42,275 INFO L290 TraceCheckUtils]: 4: Hoare triple {1536#true} assume !(0 != main_~p1~0#1); {1536#true} is VALID [2022-02-21 00:02:42,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {1536#true} assume !(0 != main_~p2~0#1); {1538#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:42,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {1538#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p3~0#1); {1538#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:42,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {1538#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1538#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:42,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {1538#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1538#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:42,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {1538#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1538#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:42,277 INFO L290 TraceCheckUtils]: 10: Hoare triple {1538#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {1538#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:42,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {1538#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {1538#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:42,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {1538#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {1538#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:42,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {1538#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p1~0#1); {1538#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:42,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {1538#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p2~0#1; {1537#false} is VALID [2022-02-21 00:02:42,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {1537#false} assume 1 != main_~lk2~0#1; {1537#false} is VALID [2022-02-21 00:02:42,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {1537#false} assume !false; {1537#false} is VALID [2022-02-21 00:02:42,280 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-21 00:02:42,280 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:42,280 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703380564] [2022-02-21 00:02:42,280 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703380564] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:42,281 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:42,281 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:42,281 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478724192] [2022-02-21 00:02:42,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:42,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-21 00:02:42,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:42,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-21 00:02:42,294 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-21 00:02:42,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:42,294 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:42,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:42,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:42,295 INFO L87 Difference]: Start difference. First operand 85 states and 149 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-21 00:02:42,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:42,360 INFO L93 Difference]: Finished difference Result 121 states and 208 transitions. [2022-02-21 00:02:42,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:42,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-21 00:02:42,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:42,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-21 00:02:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-02-21 00:02:42,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-21 00:02:42,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-02-21 00:02:42,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-02-21 00:02:42,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:42,447 INFO L225 Difference]: With dead ends: 121 [2022-02-21 00:02:42,447 INFO L226 Difference]: Without dead ends: 121 [2022-02-21 00:02:42,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 00:02:42,448 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:42,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 130 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:42,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-02-21 00:02:42,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2022-02-21 00:02:42,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:42,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 119 states, 118 states have (on average 1.7542372881355932) internal successors, (207), 118 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,453 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 119 states, 118 states have (on average 1.7542372881355932) internal successors, (207), 118 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,453 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 119 states, 118 states have (on average 1.7542372881355932) internal successors, (207), 118 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:42,456 INFO L93 Difference]: Finished difference Result 121 states and 208 transitions. [2022-02-21 00:02:42,456 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 208 transitions. [2022-02-21 00:02:42,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:42,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:42,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 118 states have (on average 1.7542372881355932) internal successors, (207), 118 states have internal predecessors, (207), 0 states have call successors, (0), 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 121 states. [2022-02-21 00:02:42,457 INFO L87 Difference]: Start difference. First operand has 119 states, 118 states have (on average 1.7542372881355932) internal successors, (207), 118 states have internal predecessors, (207), 0 states have call successors, (0), 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 121 states. [2022-02-21 00:02:42,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:42,460 INFO L93 Difference]: Finished difference Result 121 states and 208 transitions. [2022-02-21 00:02:42,461 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 208 transitions. [2022-02-21 00:02:42,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:42,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:42,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:42,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:42,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.7542372881355932) internal successors, (207), 118 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 207 transitions. [2022-02-21 00:02:42,464 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 207 transitions. Word has length 17 [2022-02-21 00:02:42,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:42,465 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 207 transitions. [2022-02-21 00:02:42,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-21 00:02:42,465 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 207 transitions. [2022-02-21 00:02:42,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-21 00:02:42,466 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:42,466 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-21 00:02:42,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-21 00:02:42,466 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:42,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:42,467 INFO L85 PathProgramCache]: Analyzing trace with hash -545425190, now seen corresponding path program 1 times [2022-02-21 00:02:42,467 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:42,467 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031508181] [2022-02-21 00:02:42,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:42,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:42,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {2023#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2023#true} is VALID [2022-02-21 00:02:42,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {2023#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; {2023#true} is VALID [2022-02-21 00:02:42,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {2023#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {2023#true} is VALID [2022-02-21 00:02:42,498 INFO L290 TraceCheckUtils]: 3: Hoare triple {2023#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; {2023#true} is VALID [2022-02-21 00:02:42,498 INFO L290 TraceCheckUtils]: 4: Hoare triple {2023#true} assume !(0 != main_~p1~0#1); {2023#true} is VALID [2022-02-21 00:02:42,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {2023#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {2025#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:42,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {2025#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p3~0#1); {2025#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:42,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {2025#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {2025#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:42,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {2025#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {2025#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:42,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {2025#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {2025#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:42,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {2025#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {2025#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:42,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {2025#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {2025#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:42,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {2025#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {2025#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:42,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {2025#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p1~0#1); {2025#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:42,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {2025#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p2~0#1); {2024#false} is VALID [2022-02-21 00:02:42,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {2024#false} assume 0 != main_~p3~0#1; {2024#false} is VALID [2022-02-21 00:02:42,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {2024#false} assume 1 != main_~lk3~0#1; {2024#false} is VALID [2022-02-21 00:02:42,503 INFO L290 TraceCheckUtils]: 17: Hoare triple {2024#false} assume !false; {2024#false} is VALID [2022-02-21 00:02:42,503 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-21 00:02:42,503 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:42,503 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031508181] [2022-02-21 00:02:42,503 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031508181] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:42,503 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:42,504 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:42,504 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421244941] [2022-02-21 00:02:42,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:42,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-21 00:02:42,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:42,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,517 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-21 00:02:42,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:42,518 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:42,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:42,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:42,518 INFO L87 Difference]: Start difference. First operand 119 states and 207 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:42,585 INFO L93 Difference]: Finished difference Result 123 states and 208 transitions. [2022-02-21 00:02:42,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:42,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-21 00:02:42,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:42,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-02-21 00:02:42,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-02-21 00:02:42,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2022-02-21 00:02:42,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:42,713 INFO L225 Difference]: With dead ends: 123 [2022-02-21 00:02:42,713 INFO L226 Difference]: Without dead ends: 123 [2022-02-21 00:02:42,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 00:02:42,714 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 44 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:42,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 140 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:42,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-02-21 00:02:42,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2022-02-21 00:02:42,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:42,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 121 states, 120 states have (on average 1.725) internal successors, (207), 120 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,719 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 121 states, 120 states have (on average 1.725) internal successors, (207), 120 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,719 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 121 states, 120 states have (on average 1.725) internal successors, (207), 120 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:42,722 INFO L93 Difference]: Finished difference Result 123 states and 208 transitions. [2022-02-21 00:02:42,735 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 208 transitions. [2022-02-21 00:02:42,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:42,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:42,736 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 120 states have (on average 1.725) internal successors, (207), 120 states have internal predecessors, (207), 0 states have call successors, (0), 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-21 00:02:42,736 INFO L87 Difference]: Start difference. First operand has 121 states, 120 states have (on average 1.725) internal successors, (207), 120 states have internal predecessors, (207), 0 states have call successors, (0), 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-21 00:02:42,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:42,739 INFO L93 Difference]: Finished difference Result 123 states and 208 transitions. [2022-02-21 00:02:42,740 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 208 transitions. [2022-02-21 00:02:42,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:42,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:42,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:42,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:42,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.725) internal successors, (207), 120 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 207 transitions. [2022-02-21 00:02:42,744 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 207 transitions. Word has length 18 [2022-02-21 00:02:42,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:42,744 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 207 transitions. [2022-02-21 00:02:42,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,744 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 207 transitions. [2022-02-21 00:02:42,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-21 00:02:42,745 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:42,745 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-21 00:02:42,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-21 00:02:42,745 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:42,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:42,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1132231204, now seen corresponding path program 1 times [2022-02-21 00:02:42,746 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:42,746 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024906823] [2022-02-21 00:02:42,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:42,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:42,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {2518#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2518#true} is VALID [2022-02-21 00:02:42,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {2518#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; {2518#true} is VALID [2022-02-21 00:02:42,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {2518#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {2518#true} is VALID [2022-02-21 00:02:42,805 INFO L290 TraceCheckUtils]: 3: Hoare triple {2518#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; {2518#true} is VALID [2022-02-21 00:02:42,805 INFO L290 TraceCheckUtils]: 4: Hoare triple {2518#true} assume !(0 != main_~p1~0#1); {2518#true} is VALID [2022-02-21 00:02:42,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {2518#true} assume !(0 != main_~p2~0#1); {2518#true} is VALID [2022-02-21 00:02:42,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {2518#true} assume !(0 != main_~p3~0#1); {2520#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:42,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {2520#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {2520#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:42,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {2520#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {2520#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:42,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {2520#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {2520#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:42,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {2520#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {2520#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:42,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {2520#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {2520#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:42,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {2520#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {2520#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:42,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {2520#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p1~0#1); {2520#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:42,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {2520#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p2~0#1); {2520#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:42,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {2520#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p3~0#1; {2519#false} is VALID [2022-02-21 00:02:42,809 INFO L290 TraceCheckUtils]: 16: Hoare triple {2519#false} assume 1 != main_~lk3~0#1; {2519#false} is VALID [2022-02-21 00:02:42,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {2519#false} assume !false; {2519#false} is VALID [2022-02-21 00:02:42,809 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-21 00:02:42,809 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:42,809 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024906823] [2022-02-21 00:02:42,810 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024906823] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:42,810 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:42,810 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:42,810 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911280311] [2022-02-21 00:02:42,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:42,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-21 00:02:42,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:42,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,838 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-21 00:02:42,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:42,838 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:42,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:42,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:42,839 INFO L87 Difference]: Start difference. First operand 121 states and 207 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:42,939 INFO L93 Difference]: Finished difference Result 231 states and 388 transitions. [2022-02-21 00:02:42,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:42,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-21 00:02:42,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:42,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-02-21 00:02:42,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-02-21 00:02:42,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2022-02-21 00:02:43,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:43,052 INFO L225 Difference]: With dead ends: 231 [2022-02-21 00:02:43,063 INFO L226 Difference]: Without dead ends: 231 [2022-02-21 00:02:43,063 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 00:02:43,064 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:43,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 115 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:43,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-02-21 00:02:43,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2022-02-21 00:02:43,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:43,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 231 states. Second operand has 229 states, 228 states have (on average 1.6973684210526316) internal successors, (387), 228 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,070 INFO L74 IsIncluded]: Start isIncluded. First operand 231 states. Second operand has 229 states, 228 states have (on average 1.6973684210526316) internal successors, (387), 228 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,070 INFO L87 Difference]: Start difference. First operand 231 states. Second operand has 229 states, 228 states have (on average 1.6973684210526316) internal successors, (387), 228 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:43,095 INFO L93 Difference]: Finished difference Result 231 states and 388 transitions. [2022-02-21 00:02:43,095 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 388 transitions. [2022-02-21 00:02:43,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:43,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:43,096 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 228 states have (on average 1.6973684210526316) internal successors, (387), 228 states have internal predecessors, (387), 0 states have call successors, (0), 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 231 states. [2022-02-21 00:02:43,097 INFO L87 Difference]: Start difference. First operand has 229 states, 228 states have (on average 1.6973684210526316) internal successors, (387), 228 states have internal predecessors, (387), 0 states have call successors, (0), 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 231 states. [2022-02-21 00:02:43,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:43,119 INFO L93 Difference]: Finished difference Result 231 states and 388 transitions. [2022-02-21 00:02:43,119 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 388 transitions. [2022-02-21 00:02:43,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:43,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:43,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:43,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:43,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.6973684210526316) internal successors, (387), 228 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 387 transitions. [2022-02-21 00:02:43,143 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 387 transitions. Word has length 18 [2022-02-21 00:02:43,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:43,143 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 387 transitions. [2022-02-21 00:02:43,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,144 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 387 transitions. [2022-02-21 00:02:43,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-21 00:02:43,144 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:43,145 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-21 00:02:43,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-21 00:02:43,145 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:43,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:43,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1390396642, now seen corresponding path program 1 times [2022-02-21 00:02:43,146 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:43,146 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442372671] [2022-02-21 00:02:43,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:43,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:43,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {3445#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {3445#true} is VALID [2022-02-21 00:02:43,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {3445#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; {3445#true} is VALID [2022-02-21 00:02:43,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {3445#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {3445#true} is VALID [2022-02-21 00:02:43,190 INFO L290 TraceCheckUtils]: 3: Hoare triple {3445#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; {3445#true} is VALID [2022-02-21 00:02:43,190 INFO L290 TraceCheckUtils]: 4: Hoare triple {3445#true} assume !(0 != main_~p1~0#1); {3445#true} is VALID [2022-02-21 00:02:43,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {3445#true} assume !(0 != main_~p2~0#1); {3445#true} is VALID [2022-02-21 00:02:43,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {3445#true} assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; {3447#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:43,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {3447#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {3447#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:43,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {3447#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {3447#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:43,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {3447#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {3447#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:43,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {3447#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {3447#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:43,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {3447#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {3447#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:43,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {3447#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {3447#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:43,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {3447#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p1~0#1); {3447#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:43,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {3447#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p2~0#1); {3447#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:43,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {3447#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p3~0#1; {3447#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:43,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {3447#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 1 != main_~lk3~0#1; {3446#false} is VALID [2022-02-21 00:02:43,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {3446#false} assume !false; {3446#false} is VALID [2022-02-21 00:02:43,195 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-21 00:02:43,195 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:43,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442372671] [2022-02-21 00:02:43,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442372671] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:43,195 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:43,196 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:43,196 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342917076] [2022-02-21 00:02:43,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:43,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-21 00:02:43,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:43,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,208 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-21 00:02:43,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:43,223 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:43,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:43,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:43,224 INFO L87 Difference]: Start difference. First operand 229 states and 387 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:43,335 INFO L93 Difference]: Finished difference Result 287 states and 488 transitions. [2022-02-21 00:02:43,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:43,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-21 00:02:43,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:43,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2022-02-21 00:02:43,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2022-02-21 00:02:43,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 103 transitions. [2022-02-21 00:02:43,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:43,442 INFO L225 Difference]: With dead ends: 287 [2022-02-21 00:02:43,442 INFO L226 Difference]: Without dead ends: 287 [2022-02-21 00:02:43,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 00:02:43,443 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 37 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:43,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 152 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:43,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-02-21 00:02:43,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 229. [2022-02-21 00:02:43,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:43,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 287 states. Second operand has 229 states, 228 states have (on average 1.6798245614035088) internal successors, (383), 228 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,459 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states. Second operand has 229 states, 228 states have (on average 1.6798245614035088) internal successors, (383), 228 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,460 INFO L87 Difference]: Start difference. First operand 287 states. Second operand has 229 states, 228 states have (on average 1.6798245614035088) internal successors, (383), 228 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:43,465 INFO L93 Difference]: Finished difference Result 287 states and 488 transitions. [2022-02-21 00:02:43,465 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 488 transitions. [2022-02-21 00:02:43,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:43,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:43,466 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 228 states have (on average 1.6798245614035088) internal successors, (383), 228 states have internal predecessors, (383), 0 states have call successors, (0), 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 287 states. [2022-02-21 00:02:43,467 INFO L87 Difference]: Start difference. First operand has 229 states, 228 states have (on average 1.6798245614035088) internal successors, (383), 228 states have internal predecessors, (383), 0 states have call successors, (0), 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 287 states. [2022-02-21 00:02:43,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:43,487 INFO L93 Difference]: Finished difference Result 287 states and 488 transitions. [2022-02-21 00:02:43,487 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 488 transitions. [2022-02-21 00:02:43,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:43,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:43,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:43,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:43,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.6798245614035088) internal successors, (383), 228 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 383 transitions. [2022-02-21 00:02:43,493 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 383 transitions. Word has length 18 [2022-02-21 00:02:43,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:43,494 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 383 transitions. [2022-02-21 00:02:43,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,494 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 383 transitions. [2022-02-21 00:02:43,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-21 00:02:43,495 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:43,495 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:43,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-21 00:02:43,495 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:43,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:43,496 INFO L85 PathProgramCache]: Analyzing trace with hash -739214602, now seen corresponding path program 1 times [2022-02-21 00:02:43,496 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:43,496 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188498389] [2022-02-21 00:02:43,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:43,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:43,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {4540#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {4540#true} is VALID [2022-02-21 00:02:43,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {4540#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; {4540#true} is VALID [2022-02-21 00:02:43,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {4540#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {4540#true} is VALID [2022-02-21 00:02:43,523 INFO L290 TraceCheckUtils]: 3: Hoare triple {4540#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; {4540#true} is VALID [2022-02-21 00:02:43,523 INFO L290 TraceCheckUtils]: 4: Hoare triple {4540#true} assume !(0 != main_~p1~0#1); {4540#true} is VALID [2022-02-21 00:02:43,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {4540#true} assume !(0 != main_~p2~0#1); {4540#true} is VALID [2022-02-21 00:02:43,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {4540#true} assume !(0 != main_~p3~0#1); {4540#true} is VALID [2022-02-21 00:02:43,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {4540#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {4542#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:43,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {4542#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {4542#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:43,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {4542#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {4542#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:43,525 INFO L290 TraceCheckUtils]: 10: Hoare triple {4542#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {4542#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:43,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {4542#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {4542#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:43,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {4542#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {4542#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:43,526 INFO L290 TraceCheckUtils]: 13: Hoare triple {4542#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p1~0#1); {4542#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:43,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {4542#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p2~0#1); {4542#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:43,527 INFO L290 TraceCheckUtils]: 15: Hoare triple {4542#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p3~0#1); {4542#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:43,527 INFO L290 TraceCheckUtils]: 16: Hoare triple {4542#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p4~0#1; {4542#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:43,527 INFO L290 TraceCheckUtils]: 17: Hoare triple {4542#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 1 != main_~lk4~0#1; {4541#false} is VALID [2022-02-21 00:02:43,528 INFO L290 TraceCheckUtils]: 18: Hoare triple {4541#false} assume !false; {4541#false} is VALID [2022-02-21 00:02:43,528 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-21 00:02:43,528 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:43,528 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188498389] [2022-02-21 00:02:43,528 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188498389] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:43,528 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:43,528 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:43,529 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402883249] [2022-02-21 00:02:43,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:43,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-21 00:02:43,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:43,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:43,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:43,542 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:43,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:43,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:43,543 INFO L87 Difference]: Start difference. First operand 229 states and 383 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:43,607 INFO L93 Difference]: Finished difference Result 419 states and 704 transitions. [2022-02-21 00:02:43,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:43,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-21 00:02:43,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:43,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2022-02-21 00:02:43,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2022-02-21 00:02:43,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 102 transitions. [2022-02-21 00:02:43,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:43,689 INFO L225 Difference]: With dead ends: 419 [2022-02-21 00:02:43,689 INFO L226 Difference]: Without dead ends: 419 [2022-02-21 00:02:43,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 00:02:43,690 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 34 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:43,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 109 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:43,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-02-21 00:02:43,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 321. [2022-02-21 00:02:43,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:43,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 419 states. Second operand has 321 states, 320 states have (on average 1.646875) internal successors, (527), 320 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,695 INFO L74 IsIncluded]: Start isIncluded. First operand 419 states. Second operand has 321 states, 320 states have (on average 1.646875) internal successors, (527), 320 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,696 INFO L87 Difference]: Start difference. First operand 419 states. Second operand has 321 states, 320 states have (on average 1.646875) internal successors, (527), 320 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:43,705 INFO L93 Difference]: Finished difference Result 419 states and 704 transitions. [2022-02-21 00:02:43,705 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 704 transitions. [2022-02-21 00:02:43,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:43,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:43,706 INFO L74 IsIncluded]: Start isIncluded. First operand has 321 states, 320 states have (on average 1.646875) internal successors, (527), 320 states have internal predecessors, (527), 0 states have call successors, (0), 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 419 states. [2022-02-21 00:02:43,707 INFO L87 Difference]: Start difference. First operand has 321 states, 320 states have (on average 1.646875) internal successors, (527), 320 states have internal predecessors, (527), 0 states have call successors, (0), 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 419 states. [2022-02-21 00:02:43,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:43,717 INFO L93 Difference]: Finished difference Result 419 states and 704 transitions. [2022-02-21 00:02:43,717 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 704 transitions. [2022-02-21 00:02:43,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:43,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:43,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:43,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:43,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 320 states have (on average 1.646875) internal successors, (527), 320 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 527 transitions. [2022-02-21 00:02:43,724 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 527 transitions. Word has length 19 [2022-02-21 00:02:43,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:43,724 INFO L470 AbstractCegarLoop]: Abstraction has 321 states and 527 transitions. [2022-02-21 00:02:43,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,725 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 527 transitions. [2022-02-21 00:02:43,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-21 00:02:43,725 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:43,725 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:43,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-21 00:02:43,726 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:43,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:43,726 INFO L85 PathProgramCache]: Analyzing trace with hash -481049164, now seen corresponding path program 1 times [2022-02-21 00:02:43,726 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:43,726 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200669966] [2022-02-21 00:02:43,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:43,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:43,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {6123#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {6123#true} is VALID [2022-02-21 00:02:43,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {6123#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; {6123#true} is VALID [2022-02-21 00:02:43,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {6123#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {6123#true} is VALID [2022-02-21 00:02:43,755 INFO L290 TraceCheckUtils]: 3: Hoare triple {6123#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; {6123#true} is VALID [2022-02-21 00:02:43,755 INFO L290 TraceCheckUtils]: 4: Hoare triple {6123#true} assume !(0 != main_~p1~0#1); {6123#true} is VALID [2022-02-21 00:02:43,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {6123#true} assume !(0 != main_~p2~0#1); {6123#true} is VALID [2022-02-21 00:02:43,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {6123#true} assume !(0 != main_~p3~0#1); {6123#true} is VALID [2022-02-21 00:02:43,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {6123#true} assume !(0 != main_~p4~0#1); {6125#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:43,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {6125#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {6125#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:43,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {6125#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {6125#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:43,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {6125#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {6125#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:43,757 INFO L290 TraceCheckUtils]: 11: Hoare triple {6125#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {6125#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:43,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {6125#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {6125#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:43,758 INFO L290 TraceCheckUtils]: 13: Hoare triple {6125#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p1~0#1); {6125#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:43,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {6125#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p2~0#1); {6125#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:43,759 INFO L290 TraceCheckUtils]: 15: Hoare triple {6125#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p3~0#1); {6125#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:43,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {6125#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p4~0#1; {6124#false} is VALID [2022-02-21 00:02:43,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {6124#false} assume 1 != main_~lk4~0#1; {6124#false} is VALID [2022-02-21 00:02:43,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {6124#false} assume !false; {6124#false} is VALID [2022-02-21 00:02:43,759 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-21 00:02:43,760 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:43,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200669966] [2022-02-21 00:02:43,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200669966] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:43,760 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:43,760 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:43,760 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728595277] [2022-02-21 00:02:43,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:43,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-21 00:02:43,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:43,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:43,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:43,773 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:43,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:43,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:43,774 INFO L87 Difference]: Start difference. First operand 321 states and 527 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:43,849 INFO L93 Difference]: Finished difference Result 443 states and 716 transitions. [2022-02-21 00:02:43,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:43,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-21 00:02:43,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:43,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2022-02-21 00:02:43,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2022-02-21 00:02:43,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 107 transitions. [2022-02-21 00:02:43,926 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-21 00:02:43,936 INFO L225 Difference]: With dead ends: 443 [2022-02-21 00:02:43,936 INFO L226 Difference]: Without dead ends: 443 [2022-02-21 00:02:43,937 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 00:02:43,937 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 40 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:43,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 132 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:43,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-02-21 00:02:43,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 441. [2022-02-21 00:02:43,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:43,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 443 states. Second operand has 441 states, 440 states have (on average 1.625) internal successors, (715), 440 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,945 INFO L74 IsIncluded]: Start isIncluded. First operand 443 states. Second operand has 441 states, 440 states have (on average 1.625) internal successors, (715), 440 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,946 INFO L87 Difference]: Start difference. First operand 443 states. Second operand has 441 states, 440 states have (on average 1.625) internal successors, (715), 440 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:43,957 INFO L93 Difference]: Finished difference Result 443 states and 716 transitions. [2022-02-21 00:02:43,957 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 716 transitions. [2022-02-21 00:02:43,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:43,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:43,959 INFO L74 IsIncluded]: Start isIncluded. First operand has 441 states, 440 states have (on average 1.625) internal successors, (715), 440 states have internal predecessors, (715), 0 states have call successors, (0), 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 443 states. [2022-02-21 00:02:43,960 INFO L87 Difference]: Start difference. First operand has 441 states, 440 states have (on average 1.625) internal successors, (715), 440 states have internal predecessors, (715), 0 states have call successors, (0), 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 443 states. [2022-02-21 00:02:43,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:43,970 INFO L93 Difference]: Finished difference Result 443 states and 716 transitions. [2022-02-21 00:02:43,970 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 716 transitions. [2022-02-21 00:02:43,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:43,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:43,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:43,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:43,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 440 states have (on average 1.625) internal successors, (715), 440 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 715 transitions. [2022-02-21 00:02:43,983 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 715 transitions. Word has length 19 [2022-02-21 00:02:43,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:43,983 INFO L470 AbstractCegarLoop]: Abstraction has 441 states and 715 transitions. [2022-02-21 00:02:43,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,983 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 715 transitions. [2022-02-21 00:02:43,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-21 00:02:43,984 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:43,984 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-21 00:02:43,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-21 00:02:43,985 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:43,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:43,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1440601487, now seen corresponding path program 1 times [2022-02-21 00:02:43,985 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:43,985 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882775040] [2022-02-21 00:02:43,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:43,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:44,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {7898#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {7898#true} is VALID [2022-02-21 00:02:44,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {7898#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; {7898#true} is VALID [2022-02-21 00:02:44,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {7898#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {7898#true} is VALID [2022-02-21 00:02:44,009 INFO L290 TraceCheckUtils]: 3: Hoare triple {7898#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; {7898#true} is VALID [2022-02-21 00:02:44,010 INFO L290 TraceCheckUtils]: 4: Hoare triple {7898#true} assume !(0 != main_~p1~0#1); {7898#true} is VALID [2022-02-21 00:02:44,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {7898#true} assume !(0 != main_~p2~0#1); {7898#true} is VALID [2022-02-21 00:02:44,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {7898#true} assume !(0 != main_~p3~0#1); {7898#true} is VALID [2022-02-21 00:02:44,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {7898#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {7900#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:44,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {7900#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {7900#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:44,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {7900#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {7900#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:44,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {7900#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {7900#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:44,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {7900#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {7900#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:44,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {7900#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {7900#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:44,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {7900#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p1~0#1); {7900#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:44,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {7900#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p2~0#1); {7900#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:44,013 INFO L290 TraceCheckUtils]: 15: Hoare triple {7900#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p3~0#1); {7900#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:44,013 INFO L290 TraceCheckUtils]: 16: Hoare triple {7900#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p4~0#1); {7899#false} is VALID [2022-02-21 00:02:44,014 INFO L290 TraceCheckUtils]: 17: Hoare triple {7899#false} assume 0 != main_~p5~0#1; {7899#false} is VALID [2022-02-21 00:02:44,014 INFO L290 TraceCheckUtils]: 18: Hoare triple {7899#false} assume 1 != main_~lk5~0#1; {7899#false} is VALID [2022-02-21 00:02:44,014 INFO L290 TraceCheckUtils]: 19: Hoare triple {7899#false} assume !false; {7899#false} is VALID [2022-02-21 00:02:44,014 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-21 00:02:44,014 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:44,015 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882775040] [2022-02-21 00:02:44,015 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882775040] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:44,015 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:44,015 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:44,015 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534476378] [2022-02-21 00:02:44,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:44,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-21 00:02:44,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:44,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-21 00:02:44,028 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-21 00:02:44,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:44,029 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:44,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:44,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:44,030 INFO L87 Difference]: Start difference. First operand 441 states and 715 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-21 00:02:44,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:44,101 INFO L93 Difference]: Finished difference Result 455 states and 724 transitions. [2022-02-21 00:02:44,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:44,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-21 00:02:44,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:44,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-21 00:02:44,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2022-02-21 00:02:44,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-21 00:02:44,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2022-02-21 00:02:44,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 106 transitions. [2022-02-21 00:02:44,177 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-21 00:02:44,187 INFO L225 Difference]: With dead ends: 455 [2022-02-21 00:02:44,187 INFO L226 Difference]: Without dead ends: 455 [2022-02-21 00:02:44,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 00:02:44,188 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 42 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:44,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 132 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:44,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-02-21 00:02:44,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 453. [2022-02-21 00:02:44,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:44,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 455 states. Second operand has 453 states, 452 states have (on average 1.5995575221238938) internal successors, (723), 452 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:44,196 INFO L74 IsIncluded]: Start isIncluded. First operand 455 states. Second operand has 453 states, 452 states have (on average 1.5995575221238938) internal successors, (723), 452 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:44,196 INFO L87 Difference]: Start difference. First operand 455 states. Second operand has 453 states, 452 states have (on average 1.5995575221238938) internal successors, (723), 452 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:44,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:44,208 INFO L93 Difference]: Finished difference Result 455 states and 724 transitions. [2022-02-21 00:02:44,208 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 724 transitions. [2022-02-21 00:02:44,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:44,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:44,209 INFO L74 IsIncluded]: Start isIncluded. First operand has 453 states, 452 states have (on average 1.5995575221238938) internal successors, (723), 452 states have internal predecessors, (723), 0 states have call successors, (0), 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 455 states. [2022-02-21 00:02:44,210 INFO L87 Difference]: Start difference. First operand has 453 states, 452 states have (on average 1.5995575221238938) internal successors, (723), 452 states have internal predecessors, (723), 0 states have call successors, (0), 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 455 states. [2022-02-21 00:02:44,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:44,221 INFO L93 Difference]: Finished difference Result 455 states and 724 transitions. [2022-02-21 00:02:44,221 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 724 transitions. [2022-02-21 00:02:44,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:44,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:44,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:44,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:44,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.5995575221238938) internal successors, (723), 452 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:44,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 723 transitions. [2022-02-21 00:02:44,234 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 723 transitions. Word has length 20 [2022-02-21 00:02:44,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:44,235 INFO L470 AbstractCegarLoop]: Abstraction has 453 states and 723 transitions. [2022-02-21 00:02:44,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-21 00:02:44,235 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 723 transitions. [2022-02-21 00:02:44,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-21 00:02:44,236 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:44,236 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-21 00:02:44,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-21 00:02:44,236 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:44,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:44,237 INFO L85 PathProgramCache]: Analyzing trace with hash -2027407501, now seen corresponding path program 1 times [2022-02-21 00:02:44,237 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:44,237 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544151961] [2022-02-21 00:02:44,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:44,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:44,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {9721#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {9721#true} is VALID [2022-02-21 00:02:44,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {9721#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; {9721#true} is VALID [2022-02-21 00:02:44,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {9721#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {9721#true} is VALID [2022-02-21 00:02:44,259 INFO L290 TraceCheckUtils]: 3: Hoare triple {9721#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; {9721#true} is VALID [2022-02-21 00:02:44,259 INFO L290 TraceCheckUtils]: 4: Hoare triple {9721#true} assume !(0 != main_~p1~0#1); {9721#true} is VALID [2022-02-21 00:02:44,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {9721#true} assume !(0 != main_~p2~0#1); {9721#true} is VALID [2022-02-21 00:02:44,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {9721#true} assume !(0 != main_~p3~0#1); {9721#true} is VALID [2022-02-21 00:02:44,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {9721#true} assume !(0 != main_~p4~0#1); {9721#true} is VALID [2022-02-21 00:02:44,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {9721#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {9723#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:44,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {9723#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {9723#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:44,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {9723#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {9723#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:44,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {9723#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {9723#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:44,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {9723#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {9723#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:44,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {9723#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p1~0#1); {9723#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:44,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {9723#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p2~0#1); {9723#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:44,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {9723#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p3~0#1); {9723#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:44,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {9723#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p4~0#1); {9723#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:44,263 INFO L290 TraceCheckUtils]: 17: Hoare triple {9723#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p5~0#1; {9723#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:44,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {9723#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 1 != main_~lk5~0#1; {9722#false} is VALID [2022-02-21 00:02:44,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {9722#false} assume !false; {9722#false} is VALID [2022-02-21 00:02:44,264 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-21 00:02:44,264 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:44,264 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544151961] [2022-02-21 00:02:44,265 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544151961] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:44,265 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:44,265 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:44,265 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429249915] [2022-02-21 00:02:44,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:44,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-21 00:02:44,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:44,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-21 00:02:44,278 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-21 00:02:44,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:44,279 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:44,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:44,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:44,280 INFO L87 Difference]: Start difference. First operand 453 states and 723 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-21 00:02:44,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:44,358 INFO L93 Difference]: Finished difference Result 807 states and 1292 transitions. [2022-02-21 00:02:44,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:44,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-21 00:02:44,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:44,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-21 00:02:44,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2022-02-21 00:02:44,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-21 00:02:44,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2022-02-21 00:02:44,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 98 transitions. [2022-02-21 00:02:44,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:44,452 INFO L225 Difference]: With dead ends: 807 [2022-02-21 00:02:44,452 INFO L226 Difference]: Without dead ends: 807 [2022-02-21 00:02:44,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 00:02:44,453 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 31 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:44,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 107 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:44,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2022-02-21 00:02:44,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 645. [2022-02-21 00:02:44,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:44,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 807 states. Second operand has 645 states, 644 states have (on average 1.5574534161490683) internal successors, (1003), 644 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:44,471 INFO L74 IsIncluded]: Start isIncluded. First operand 807 states. Second operand has 645 states, 644 states have (on average 1.5574534161490683) internal successors, (1003), 644 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:44,472 INFO L87 Difference]: Start difference. First operand 807 states. Second operand has 645 states, 644 states have (on average 1.5574534161490683) internal successors, (1003), 644 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:44,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:44,500 INFO L93 Difference]: Finished difference Result 807 states and 1292 transitions. [2022-02-21 00:02:44,500 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1292 transitions. [2022-02-21 00:02:44,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:44,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:44,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 645 states, 644 states have (on average 1.5574534161490683) internal successors, (1003), 644 states have internal predecessors, (1003), 0 states have call successors, (0), 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 807 states. [2022-02-21 00:02:44,503 INFO L87 Difference]: Start difference. First operand has 645 states, 644 states have (on average 1.5574534161490683) internal successors, (1003), 644 states have internal predecessors, (1003), 0 states have call successors, (0), 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 807 states. [2022-02-21 00:02:44,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:44,532 INFO L93 Difference]: Finished difference Result 807 states and 1292 transitions. [2022-02-21 00:02:44,532 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1292 transitions. [2022-02-21 00:02:44,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:44,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:44,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:44,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:44,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 1.5574534161490683) internal successors, (1003), 644 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:44,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1003 transitions. [2022-02-21 00:02:44,553 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1003 transitions. Word has length 20 [2022-02-21 00:02:44,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:44,553 INFO L470 AbstractCegarLoop]: Abstraction has 645 states and 1003 transitions. [2022-02-21 00:02:44,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-21 00:02:44,553 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1003 transitions. [2022-02-21 00:02:44,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-21 00:02:44,554 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:44,554 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-21 00:02:44,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-21 00:02:44,555 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:44,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:44,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1769242063, now seen corresponding path program 1 times [2022-02-21 00:02:44,556 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:44,556 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69194554] [2022-02-21 00:02:44,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:44,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:44,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {12792#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {12792#true} is VALID [2022-02-21 00:02:44,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {12792#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; {12792#true} is VALID [2022-02-21 00:02:44,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {12792#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {12792#true} is VALID [2022-02-21 00:02:44,578 INFO L290 TraceCheckUtils]: 3: Hoare triple {12792#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; {12792#true} is VALID [2022-02-21 00:02:44,578 INFO L290 TraceCheckUtils]: 4: Hoare triple {12792#true} assume !(0 != main_~p1~0#1); {12792#true} is VALID [2022-02-21 00:02:44,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {12792#true} assume !(0 != main_~p2~0#1); {12792#true} is VALID [2022-02-21 00:02:44,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {12792#true} assume !(0 != main_~p3~0#1); {12792#true} is VALID [2022-02-21 00:02:44,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {12792#true} assume !(0 != main_~p4~0#1); {12792#true} is VALID [2022-02-21 00:02:44,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {12792#true} assume !(0 != main_~p5~0#1); {12794#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:44,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {12794#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {12794#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:44,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {12794#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {12794#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:44,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {12794#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {12794#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:44,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {12794#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {12794#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:44,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {12794#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p1~0#1); {12794#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:44,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {12794#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p2~0#1); {12794#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:44,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {12794#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p3~0#1); {12794#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:44,582 INFO L290 TraceCheckUtils]: 16: Hoare triple {12794#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p4~0#1); {12794#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:44,582 INFO L290 TraceCheckUtils]: 17: Hoare triple {12794#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p5~0#1; {12793#false} is VALID [2022-02-21 00:02:44,582 INFO L290 TraceCheckUtils]: 18: Hoare triple {12793#false} assume 1 != main_~lk5~0#1; {12793#false} is VALID [2022-02-21 00:02:44,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {12793#false} assume !false; {12793#false} is VALID [2022-02-21 00:02:44,583 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-21 00:02:44,583 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:44,583 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69194554] [2022-02-21 00:02:44,583 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69194554] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:44,583 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:44,583 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:44,583 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767836112] [2022-02-21 00:02:44,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:44,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-21 00:02:44,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:44,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-21 00:02:44,596 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-21 00:02:44,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:44,597 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:44,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:44,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:44,598 INFO L87 Difference]: Start difference. First operand 645 states and 1003 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-21 00:02:44,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:44,689 INFO L93 Difference]: Finished difference Result 871 states and 1332 transitions. [2022-02-21 00:02:44,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:44,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-21 00:02:44,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:44,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-21 00:02:44,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2022-02-21 00:02:44,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-21 00:02:44,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2022-02-21 00:02:44,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 105 transitions. [2022-02-21 00:02:44,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:44,792 INFO L225 Difference]: With dead ends: 871 [2022-02-21 00:02:44,792 INFO L226 Difference]: Without dead ends: 871 [2022-02-21 00:02:44,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 00:02:44,793 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 39 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:44,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 133 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:44,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-02-21 00:02:44,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 869. [2022-02-21 00:02:44,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:44,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 871 states. Second operand has 869 states, 868 states have (on average 1.5334101382488479) internal successors, (1331), 868 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:44,805 INFO L74 IsIncluded]: Start isIncluded. First operand 871 states. Second operand has 869 states, 868 states have (on average 1.5334101382488479) internal successors, (1331), 868 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:44,806 INFO L87 Difference]: Start difference. First operand 871 states. Second operand has 869 states, 868 states have (on average 1.5334101382488479) internal successors, (1331), 868 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:44,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:44,838 INFO L93 Difference]: Finished difference Result 871 states and 1332 transitions. [2022-02-21 00:02:44,838 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1332 transitions. [2022-02-21 00:02:44,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:44,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:44,841 INFO L74 IsIncluded]: Start isIncluded. First operand has 869 states, 868 states have (on average 1.5334101382488479) internal successors, (1331), 868 states have internal predecessors, (1331), 0 states have call successors, (0), 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 871 states. [2022-02-21 00:02:44,842 INFO L87 Difference]: Start difference. First operand has 869 states, 868 states have (on average 1.5334101382488479) internal successors, (1331), 868 states have internal predecessors, (1331), 0 states have call successors, (0), 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 871 states. [2022-02-21 00:02:44,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:44,874 INFO L93 Difference]: Finished difference Result 871 states and 1332 transitions. [2022-02-21 00:02:44,875 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1332 transitions. [2022-02-21 00:02:44,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:44,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:44,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:44,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:44,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 1.5334101382488479) internal successors, (1331), 868 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:44,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1331 transitions. [2022-02-21 00:02:44,908 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1331 transitions. Word has length 20 [2022-02-21 00:02:44,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:44,909 INFO L470 AbstractCegarLoop]: Abstraction has 869 states and 1331 transitions. [2022-02-21 00:02:44,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-21 00:02:44,909 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1331 transitions. [2022-02-21 00:02:44,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-21 00:02:44,910 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:44,910 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:44,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-21 00:02:44,910 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:44,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:44,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1575091945, now seen corresponding path program 1 times [2022-02-21 00:02:44,911 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:44,911 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948951360] [2022-02-21 00:02:44,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:44,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:44,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {16279#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {16279#true} is VALID [2022-02-21 00:02:44,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {16279#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; {16279#true} is VALID [2022-02-21 00:02:44,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {16279#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {16279#true} is VALID [2022-02-21 00:02:44,931 INFO L290 TraceCheckUtils]: 3: Hoare triple {16279#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; {16279#true} is VALID [2022-02-21 00:02:44,931 INFO L290 TraceCheckUtils]: 4: Hoare triple {16279#true} assume !(0 != main_~p1~0#1); {16279#true} is VALID [2022-02-21 00:02:44,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {16279#true} assume !(0 != main_~p2~0#1); {16279#true} is VALID [2022-02-21 00:02:44,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {16279#true} assume !(0 != main_~p3~0#1); {16279#true} is VALID [2022-02-21 00:02:44,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {16279#true} assume !(0 != main_~p4~0#1); {16279#true} is VALID [2022-02-21 00:02:44,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {16279#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {16281#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:44,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {16281#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {16281#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:44,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {16281#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {16281#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:44,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {16281#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {16281#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:44,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {16281#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {16281#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:44,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {16281#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p1~0#1); {16281#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:44,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {16281#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p2~0#1); {16281#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:44,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {16281#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p3~0#1); {16281#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:44,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {16281#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p4~0#1); {16281#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:44,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {16281#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p5~0#1); {16280#false} is VALID [2022-02-21 00:02:44,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {16280#false} assume 0 != main_~p6~0#1; {16280#false} is VALID [2022-02-21 00:02:44,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {16280#false} assume 1 != main_~lk6~0#1; {16280#false} is VALID [2022-02-21 00:02:44,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {16280#false} assume !false; {16280#false} is VALID [2022-02-21 00:02:44,936 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-21 00:02:44,936 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:44,936 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948951360] [2022-02-21 00:02:44,936 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948951360] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:44,937 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:44,937 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:44,937 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929255385] [2022-02-21 00:02:44,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:44,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-02-21 00:02:44,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:44,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:44,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:44,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:44,950 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:44,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:44,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:44,951 INFO L87 Difference]: Start difference. First operand 869 states and 1331 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:45,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:45,043 INFO L93 Difference]: Finished difference Result 887 states and 1332 transitions. [2022-02-21 00:02:45,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:45,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-02-21 00:02:45,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:45,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:45,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2022-02-21 00:02:45,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:45,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2022-02-21 00:02:45,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 104 transitions. [2022-02-21 00:02:45,126 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-21 00:02:45,158 INFO L225 Difference]: With dead ends: 887 [2022-02-21 00:02:45,158 INFO L226 Difference]: Without dead ends: 887 [2022-02-21 00:02:45,158 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 00:02:45,159 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 41 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:45,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:45,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2022-02-21 00:02:45,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2022-02-21 00:02:45,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:45,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 887 states. Second operand has 885 states, 884 states have (on average 1.505656108597285) internal successors, (1331), 884 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:45,170 INFO L74 IsIncluded]: Start isIncluded. First operand 887 states. Second operand has 885 states, 884 states have (on average 1.505656108597285) internal successors, (1331), 884 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:45,171 INFO L87 Difference]: Start difference. First operand 887 states. Second operand has 885 states, 884 states have (on average 1.505656108597285) internal successors, (1331), 884 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:45,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:45,203 INFO L93 Difference]: Finished difference Result 887 states and 1332 transitions. [2022-02-21 00:02:45,203 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1332 transitions. [2022-02-21 00:02:45,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:45,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:45,206 INFO L74 IsIncluded]: Start isIncluded. First operand has 885 states, 884 states have (on average 1.505656108597285) internal successors, (1331), 884 states have internal predecessors, (1331), 0 states have call successors, (0), 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 887 states. [2022-02-21 00:02:45,207 INFO L87 Difference]: Start difference. First operand has 885 states, 884 states have (on average 1.505656108597285) internal successors, (1331), 884 states have internal predecessors, (1331), 0 states have call successors, (0), 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 887 states. [2022-02-21 00:02:45,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:45,241 INFO L93 Difference]: Finished difference Result 887 states and 1332 transitions. [2022-02-21 00:02:45,241 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1332 transitions. [2022-02-21 00:02:45,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:45,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:45,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:45,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:45,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 1.505656108597285) internal successors, (1331), 884 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:45,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1331 transitions. [2022-02-21 00:02:45,274 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1331 transitions. Word has length 21 [2022-02-21 00:02:45,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:45,275 INFO L470 AbstractCegarLoop]: Abstraction has 885 states and 1331 transitions. [2022-02-21 00:02:45,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:45,275 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1331 transitions. [2022-02-21 00:02:45,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-21 00:02:45,276 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:45,276 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:45,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-21 00:02:45,277 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:45,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:45,277 INFO L85 PathProgramCache]: Analyzing trace with hash 988285931, now seen corresponding path program 1 times [2022-02-21 00:02:45,277 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:45,277 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415351897] [2022-02-21 00:02:45,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:45,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:45,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {19830#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {19830#true} is VALID [2022-02-21 00:02:45,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {19830#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; {19830#true} is VALID [2022-02-21 00:02:45,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {19830#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {19830#true} is VALID [2022-02-21 00:02:45,298 INFO L290 TraceCheckUtils]: 3: Hoare triple {19830#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; {19830#true} is VALID [2022-02-21 00:02:45,298 INFO L290 TraceCheckUtils]: 4: Hoare triple {19830#true} assume !(0 != main_~p1~0#1); {19830#true} is VALID [2022-02-21 00:02:45,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {19830#true} assume !(0 != main_~p2~0#1); {19830#true} is VALID [2022-02-21 00:02:45,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {19830#true} assume !(0 != main_~p3~0#1); {19830#true} is VALID [2022-02-21 00:02:45,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {19830#true} assume !(0 != main_~p4~0#1); {19830#true} is VALID [2022-02-21 00:02:45,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {19830#true} assume !(0 != main_~p5~0#1); {19830#true} is VALID [2022-02-21 00:02:45,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {19830#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {19832#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:45,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {19832#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {19832#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:45,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {19832#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {19832#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:45,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {19832#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {19832#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:45,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {19832#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p1~0#1); {19832#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:45,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {19832#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p2~0#1); {19832#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:45,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {19832#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p3~0#1); {19832#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:45,301 INFO L290 TraceCheckUtils]: 16: Hoare triple {19832#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p4~0#1); {19832#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:45,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {19832#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p5~0#1); {19832#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:45,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {19832#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p6~0#1; {19832#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:45,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {19832#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 1 != main_~lk6~0#1; {19831#false} is VALID [2022-02-21 00:02:45,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {19831#false} assume !false; {19831#false} is VALID [2022-02-21 00:02:45,303 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-21 00:02:45,303 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:45,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415351897] [2022-02-21 00:02:45,303 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415351897] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:45,303 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:45,303 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:45,303 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947629535] [2022-02-21 00:02:45,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:45,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-02-21 00:02:45,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:45,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:45,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:45,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:45,317 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:45,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:45,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:45,318 INFO L87 Difference]: Start difference. First operand 885 states and 1331 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:45,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:45,456 INFO L93 Difference]: Finished difference Result 1543 states and 2324 transitions. [2022-02-21 00:02:45,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:45,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-02-21 00:02:45,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:45,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:45,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2022-02-21 00:02:45,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:45,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2022-02-21 00:02:45,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 94 transitions. [2022-02-21 00:02:45,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:45,612 INFO L225 Difference]: With dead ends: 1543 [2022-02-21 00:02:45,613 INFO L226 Difference]: Without dead ends: 1543 [2022-02-21 00:02:45,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 00:02:45,614 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 28 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:45,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 105 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:45,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2022-02-21 00:02:45,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1285. [2022-02-21 00:02:45,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:45,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1543 states. Second operand has 1285 states, 1284 states have (on average 1.4602803738317758) internal successors, (1875), 1284 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:45,632 INFO L74 IsIncluded]: Start isIncluded. First operand 1543 states. Second operand has 1285 states, 1284 states have (on average 1.4602803738317758) internal successors, (1875), 1284 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:45,634 INFO L87 Difference]: Start difference. First operand 1543 states. Second operand has 1285 states, 1284 states have (on average 1.4602803738317758) internal successors, (1875), 1284 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:45,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:45,723 INFO L93 Difference]: Finished difference Result 1543 states and 2324 transitions. [2022-02-21 00:02:45,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2324 transitions. [2022-02-21 00:02:45,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:45,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:45,728 INFO L74 IsIncluded]: Start isIncluded. First operand has 1285 states, 1284 states have (on average 1.4602803738317758) internal successors, (1875), 1284 states have internal predecessors, (1875), 0 states have call successors, (0), 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 1543 states. [2022-02-21 00:02:45,729 INFO L87 Difference]: Start difference. First operand has 1285 states, 1284 states have (on average 1.4602803738317758) internal successors, (1875), 1284 states have internal predecessors, (1875), 0 states have call successors, (0), 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 1543 states. [2022-02-21 00:02:45,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:45,822 INFO L93 Difference]: Finished difference Result 1543 states and 2324 transitions. [2022-02-21 00:02:45,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2324 transitions. [2022-02-21 00:02:45,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:45,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:45,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:45,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:45,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 1284 states have (on average 1.4602803738317758) internal successors, (1875), 1284 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:45,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1875 transitions. [2022-02-21 00:02:45,887 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1875 transitions. Word has length 21 [2022-02-21 00:02:45,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:45,887 INFO L470 AbstractCegarLoop]: Abstraction has 1285 states and 1875 transitions. [2022-02-21 00:02:45,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:45,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1875 transitions. [2022-02-21 00:02:45,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-21 00:02:45,889 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:45,889 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:45,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-21 00:02:45,890 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:45,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:45,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1246451369, now seen corresponding path program 1 times [2022-02-21 00:02:45,891 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:45,891 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681695083] [2022-02-21 00:02:45,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:45,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:45,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {25749#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {25749#true} is VALID [2022-02-21 00:02:45,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {25749#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; {25749#true} is VALID [2022-02-21 00:02:45,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {25749#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {25749#true} is VALID [2022-02-21 00:02:45,921 INFO L290 TraceCheckUtils]: 3: Hoare triple {25749#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; {25749#true} is VALID [2022-02-21 00:02:45,921 INFO L290 TraceCheckUtils]: 4: Hoare triple {25749#true} assume !(0 != main_~p1~0#1); {25749#true} is VALID [2022-02-21 00:02:45,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {25749#true} assume !(0 != main_~p2~0#1); {25749#true} is VALID [2022-02-21 00:02:45,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {25749#true} assume !(0 != main_~p3~0#1); {25749#true} is VALID [2022-02-21 00:02:45,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {25749#true} assume !(0 != main_~p4~0#1); {25749#true} is VALID [2022-02-21 00:02:45,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {25749#true} assume !(0 != main_~p5~0#1); {25749#true} is VALID [2022-02-21 00:02:45,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {25749#true} assume !(0 != main_~p6~0#1); {25751#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:45,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {25751#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {25751#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:45,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {25751#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {25751#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:45,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {25751#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {25751#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:45,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {25751#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p1~0#1); {25751#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:45,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {25751#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p2~0#1); {25751#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:45,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {25751#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p3~0#1); {25751#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:45,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {25751#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p4~0#1); {25751#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:45,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {25751#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p5~0#1); {25751#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:45,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {25751#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p6~0#1; {25750#false} is VALID [2022-02-21 00:02:45,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {25750#false} assume 1 != main_~lk6~0#1; {25750#false} is VALID [2022-02-21 00:02:45,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {25750#false} assume !false; {25750#false} is VALID [2022-02-21 00:02:45,926 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-21 00:02:45,926 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:45,927 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681695083] [2022-02-21 00:02:45,927 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681695083] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:45,927 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:45,927 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:45,927 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036713219] [2022-02-21 00:02:45,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:45,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-02-21 00:02:45,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:45,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:45,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:45,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:45,942 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:45,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:45,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:45,943 INFO L87 Difference]: Start difference. First operand 1285 states and 1875 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:46,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:46,110 INFO L93 Difference]: Finished difference Result 1703 states and 2436 transitions. [2022-02-21 00:02:46,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:46,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-02-21 00:02:46,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:46,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:46,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2022-02-21 00:02:46,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:46,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2022-02-21 00:02:46,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 103 transitions. [2022-02-21 00:02:46,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:46,295 INFO L225 Difference]: With dead ends: 1703 [2022-02-21 00:02:46,296 INFO L226 Difference]: Without dead ends: 1703 [2022-02-21 00:02:46,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 00:02:46,296 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 38 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:46,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 134 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:46,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2022-02-21 00:02:46,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1701. [2022-02-21 00:02:46,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:46,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1703 states. Second operand has 1701 states, 1700 states have (on average 1.4323529411764706) internal successors, (2435), 1700 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:46,327 INFO L74 IsIncluded]: Start isIncluded. First operand 1703 states. Second operand has 1701 states, 1700 states have (on average 1.4323529411764706) internal successors, (2435), 1700 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:46,328 INFO L87 Difference]: Start difference. First operand 1703 states. Second operand has 1701 states, 1700 states have (on average 1.4323529411764706) internal successors, (2435), 1700 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:46,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:46,431 INFO L93 Difference]: Finished difference Result 1703 states and 2436 transitions. [2022-02-21 00:02:46,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2436 transitions. [2022-02-21 00:02:46,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:46,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:46,436 INFO L74 IsIncluded]: Start isIncluded. First operand has 1701 states, 1700 states have (on average 1.4323529411764706) internal successors, (2435), 1700 states have internal predecessors, (2435), 0 states have call successors, (0), 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 1703 states. [2022-02-21 00:02:46,438 INFO L87 Difference]: Start difference. First operand has 1701 states, 1700 states have (on average 1.4323529411764706) internal successors, (2435), 1700 states have internal predecessors, (2435), 0 states have call successors, (0), 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 1703 states. [2022-02-21 00:02:46,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:46,541 INFO L93 Difference]: Finished difference Result 1703 states and 2436 transitions. [2022-02-21 00:02:46,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2436 transitions. [2022-02-21 00:02:46,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:46,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:46,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:46,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:46,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1700 states have (on average 1.4323529411764706) internal successors, (2435), 1700 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:46,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2435 transitions. [2022-02-21 00:02:46,651 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2435 transitions. Word has length 21 [2022-02-21 00:02:46,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:46,651 INFO L470 AbstractCegarLoop]: Abstraction has 1701 states and 2435 transitions. [2022-02-21 00:02:46,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:46,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2435 transitions. [2022-02-21 00:02:46,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-21 00:02:46,653 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:46,653 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] [2022-02-21 00:02:46,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-21 00:02:46,654 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:46,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:46,654 INFO L85 PathProgramCache]: Analyzing trace with hash 572308166, now seen corresponding path program 1 times [2022-02-21 00:02:46,655 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:46,655 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444975512] [2022-02-21 00:02:46,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:46,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:46,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {32564#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {32564#true} is VALID [2022-02-21 00:02:46,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {32564#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; {32564#true} is VALID [2022-02-21 00:02:46,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {32564#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {32564#true} is VALID [2022-02-21 00:02:46,676 INFO L290 TraceCheckUtils]: 3: Hoare triple {32564#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; {32564#true} is VALID [2022-02-21 00:02:46,676 INFO L290 TraceCheckUtils]: 4: Hoare triple {32564#true} assume !(0 != main_~p1~0#1); {32564#true} is VALID [2022-02-21 00:02:46,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {32564#true} assume !(0 != main_~p2~0#1); {32564#true} is VALID [2022-02-21 00:02:46,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {32564#true} assume !(0 != main_~p3~0#1); {32564#true} is VALID [2022-02-21 00:02:46,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {32564#true} assume !(0 != main_~p4~0#1); {32564#true} is VALID [2022-02-21 00:02:46,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {32564#true} assume !(0 != main_~p5~0#1); {32564#true} is VALID [2022-02-21 00:02:46,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {32564#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {32566#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:46,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {32566#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {32566#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:46,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {32566#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {32566#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:46,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {32566#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {32566#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:46,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {32566#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p1~0#1); {32566#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:46,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {32566#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p2~0#1); {32566#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:46,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {32566#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p3~0#1); {32566#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:46,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {32566#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p4~0#1); {32566#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:46,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {32566#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p5~0#1); {32566#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:46,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {32566#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p6~0#1); {32565#false} is VALID [2022-02-21 00:02:46,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {32565#false} assume 0 != main_~p7~0#1; {32565#false} is VALID [2022-02-21 00:02:46,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {32565#false} assume 1 != main_~lk7~0#1; {32565#false} is VALID [2022-02-21 00:02:46,680 INFO L290 TraceCheckUtils]: 21: Hoare triple {32565#false} assume !false; {32565#false} is VALID [2022-02-21 00:02:46,681 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-21 00:02:46,681 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:46,681 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444975512] [2022-02-21 00:02:46,681 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444975512] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:46,681 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:46,681 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:46,681 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423902373] [2022-02-21 00:02:46,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:46,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-02-21 00:02:46,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:46,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:46,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:46,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:46,697 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:46,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:46,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:46,698 INFO L87 Difference]: Start difference. First operand 1701 states and 2435 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:46,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:46,866 INFO L93 Difference]: Finished difference Result 1735 states and 2436 transitions. [2022-02-21 00:02:46,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:46,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-02-21 00:02:46,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:46,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:46,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2022-02-21 00:02:46,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:46,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2022-02-21 00:02:46,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 102 transitions. [2022-02-21 00:02:46,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:47,051 INFO L225 Difference]: With dead ends: 1735 [2022-02-21 00:02:47,052 INFO L226 Difference]: Without dead ends: 1735 [2022-02-21 00:02:47,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 00:02:47,053 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 40 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:47,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 124 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:47,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2022-02-21 00:02:47,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1733. [2022-02-21 00:02:47,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:47,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1735 states. Second operand has 1733 states, 1732 states have (on average 1.4058891454965359) internal successors, (2435), 1732 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,099 INFO L74 IsIncluded]: Start isIncluded. First operand 1735 states. Second operand has 1733 states, 1732 states have (on average 1.4058891454965359) internal successors, (2435), 1732 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,101 INFO L87 Difference]: Start difference. First operand 1735 states. Second operand has 1733 states, 1732 states have (on average 1.4058891454965359) internal successors, (2435), 1732 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:47,205 INFO L93 Difference]: Finished difference Result 1735 states and 2436 transitions. [2022-02-21 00:02:47,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2436 transitions. [2022-02-21 00:02:47,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:47,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:47,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 1733 states, 1732 states have (on average 1.4058891454965359) internal successors, (2435), 1732 states have internal predecessors, (2435), 0 states have call successors, (0), 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 1735 states. [2022-02-21 00:02:47,211 INFO L87 Difference]: Start difference. First operand has 1733 states, 1732 states have (on average 1.4058891454965359) internal successors, (2435), 1732 states have internal predecessors, (2435), 0 states have call successors, (0), 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 1735 states. [2022-02-21 00:02:47,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:47,317 INFO L93 Difference]: Finished difference Result 1735 states and 2436 transitions. [2022-02-21 00:02:47,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2436 transitions. [2022-02-21 00:02:47,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:47,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:47,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:47,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:47,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1732 states have (on average 1.4058891454965359) internal successors, (2435), 1732 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2435 transitions. [2022-02-21 00:02:47,434 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2435 transitions. Word has length 22 [2022-02-21 00:02:47,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:47,434 INFO L470 AbstractCegarLoop]: Abstraction has 1733 states and 2435 transitions. [2022-02-21 00:02:47,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2435 transitions. [2022-02-21 00:02:47,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-21 00:02:47,436 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:47,436 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] [2022-02-21 00:02:47,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-21 00:02:47,436 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:47,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:47,437 INFO L85 PathProgramCache]: Analyzing trace with hash -14497848, now seen corresponding path program 1 times [2022-02-21 00:02:47,437 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:47,437 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863412517] [2022-02-21 00:02:47,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:47,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:47,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {39507#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {39507#true} is VALID [2022-02-21 00:02:47,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {39507#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; {39507#true} is VALID [2022-02-21 00:02:47,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {39507#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {39507#true} is VALID [2022-02-21 00:02:47,459 INFO L290 TraceCheckUtils]: 3: Hoare triple {39507#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; {39507#true} is VALID [2022-02-21 00:02:47,459 INFO L290 TraceCheckUtils]: 4: Hoare triple {39507#true} assume !(0 != main_~p1~0#1); {39507#true} is VALID [2022-02-21 00:02:47,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {39507#true} assume !(0 != main_~p2~0#1); {39507#true} is VALID [2022-02-21 00:02:47,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {39507#true} assume !(0 != main_~p3~0#1); {39507#true} is VALID [2022-02-21 00:02:47,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {39507#true} assume !(0 != main_~p4~0#1); {39507#true} is VALID [2022-02-21 00:02:47,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {39507#true} assume !(0 != main_~p5~0#1); {39507#true} is VALID [2022-02-21 00:02:47,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {39507#true} assume !(0 != main_~p6~0#1); {39507#true} is VALID [2022-02-21 00:02:47,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {39507#true} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {39509#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:47,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {39509#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {39509#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:47,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {39509#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {39509#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:47,461 INFO L290 TraceCheckUtils]: 13: Hoare triple {39509#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p1~0#1); {39509#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:47,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {39509#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p2~0#1); {39509#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:47,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {39509#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p3~0#1); {39509#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:47,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {39509#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p4~0#1); {39509#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:47,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {39509#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p5~0#1); {39509#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:47,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {39509#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p6~0#1); {39509#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:47,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {39509#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p7~0#1; {39509#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:47,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {39509#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 1 != main_~lk7~0#1; {39508#false} is VALID [2022-02-21 00:02:47,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {39508#false} assume !false; {39508#false} is VALID [2022-02-21 00:02:47,464 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-21 00:02:47,464 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:47,464 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863412517] [2022-02-21 00:02:47,464 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863412517] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:47,464 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:47,465 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:47,465 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207036432] [2022-02-21 00:02:47,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:47,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-02-21 00:02:47,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:47,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:47,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:47,479 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:47,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:47,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:47,480 INFO L87 Difference]: Start difference. First operand 1733 states and 2435 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:47,813 INFO L93 Difference]: Finished difference Result 2951 states and 4132 transitions. [2022-02-21 00:02:47,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:47,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-02-21 00:02:47,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:47,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2022-02-21 00:02:47,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2022-02-21 00:02:47,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2022-02-21 00:02:47,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:48,199 INFO L225 Difference]: With dead ends: 2951 [2022-02-21 00:02:48,200 INFO L226 Difference]: Without dead ends: 2951 [2022-02-21 00:02:48,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 00:02:48,200 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 25 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:48,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 103 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:48,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2022-02-21 00:02:48,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2565. [2022-02-21 00:02:48,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:48,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2951 states. Second operand has 2565 states, 2564 states have (on average 1.361544461778471) internal successors, (3491), 2564 states have internal predecessors, (3491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:48,238 INFO L74 IsIncluded]: Start isIncluded. First operand 2951 states. Second operand has 2565 states, 2564 states have (on average 1.361544461778471) internal successors, (3491), 2564 states have internal predecessors, (3491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:48,239 INFO L87 Difference]: Start difference. First operand 2951 states. Second operand has 2565 states, 2564 states have (on average 1.361544461778471) internal successors, (3491), 2564 states have internal predecessors, (3491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:48,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:48,516 INFO L93 Difference]: Finished difference Result 2951 states and 4132 transitions. [2022-02-21 00:02:48,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 4132 transitions. [2022-02-21 00:02:48,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:48,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:48,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 2565 states, 2564 states have (on average 1.361544461778471) internal successors, (3491), 2564 states have internal predecessors, (3491), 0 states have call successors, (0), 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 2951 states. [2022-02-21 00:02:48,523 INFO L87 Difference]: Start difference. First operand has 2565 states, 2564 states have (on average 1.361544461778471) internal successors, (3491), 2564 states have internal predecessors, (3491), 0 states have call successors, (0), 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 2951 states. [2022-02-21 00:02:48,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:48,823 INFO L93 Difference]: Finished difference Result 2951 states and 4132 transitions. [2022-02-21 00:02:48,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 4132 transitions. [2022-02-21 00:02:48,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:48,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:48,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:48,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:48,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2565 states, 2564 states have (on average 1.361544461778471) internal successors, (3491), 2564 states have internal predecessors, (3491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 3491 transitions. [2022-02-21 00:02:49,056 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 3491 transitions. Word has length 22 [2022-02-21 00:02:49,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:49,056 INFO L470 AbstractCegarLoop]: Abstraction has 2565 states and 3491 transitions. [2022-02-21 00:02:49,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,056 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3491 transitions. [2022-02-21 00:02:49,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-21 00:02:49,059 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:49,059 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] [2022-02-21 00:02:49,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-21 00:02:49,059 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:49,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:49,060 INFO L85 PathProgramCache]: Analyzing trace with hash 243667590, now seen corresponding path program 1 times [2022-02-21 00:02:49,060 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:49,060 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100559247] [2022-02-21 00:02:49,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:49,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:49,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {50930#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {50930#true} is VALID [2022-02-21 00:02:49,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {50930#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; {50930#true} is VALID [2022-02-21 00:02:49,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {50930#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {50930#true} is VALID [2022-02-21 00:02:49,081 INFO L290 TraceCheckUtils]: 3: Hoare triple {50930#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; {50930#true} is VALID [2022-02-21 00:02:49,081 INFO L290 TraceCheckUtils]: 4: Hoare triple {50930#true} assume !(0 != main_~p1~0#1); {50930#true} is VALID [2022-02-21 00:02:49,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {50930#true} assume !(0 != main_~p2~0#1); {50930#true} is VALID [2022-02-21 00:02:49,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {50930#true} assume !(0 != main_~p3~0#1); {50930#true} is VALID [2022-02-21 00:02:49,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {50930#true} assume !(0 != main_~p4~0#1); {50930#true} is VALID [2022-02-21 00:02:49,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {50930#true} assume !(0 != main_~p5~0#1); {50930#true} is VALID [2022-02-21 00:02:49,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {50930#true} assume !(0 != main_~p6~0#1); {50930#true} is VALID [2022-02-21 00:02:49,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {50930#true} assume !(0 != main_~p7~0#1); {50932#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:49,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {50932#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {50932#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:49,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {50932#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {50932#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:49,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {50932#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p1~0#1); {50932#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:49,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {50932#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p2~0#1); {50932#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:49,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {50932#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p3~0#1); {50932#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:49,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {50932#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p4~0#1); {50932#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:49,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {50932#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p5~0#1); {50932#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:49,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {50932#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p6~0#1); {50932#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:49,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {50932#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p7~0#1; {50931#false} is VALID [2022-02-21 00:02:49,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {50931#false} assume 1 != main_~lk7~0#1; {50931#false} is VALID [2022-02-21 00:02:49,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {50931#false} assume !false; {50931#false} is VALID [2022-02-21 00:02:49,086 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-21 00:02:49,086 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:49,086 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100559247] [2022-02-21 00:02:49,086 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100559247] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:49,086 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:49,086 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:49,087 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40594909] [2022-02-21 00:02:49,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:49,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-02-21 00:02:49,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:49,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:49,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:49,101 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:49,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:49,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:49,102 INFO L87 Difference]: Start difference. First operand 2565 states and 3491 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:49,549 INFO L93 Difference]: Finished difference Result 3335 states and 4420 transitions. [2022-02-21 00:02:49,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:49,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-02-21 00:02:49,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:49,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-02-21 00:02:49,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-02-21 00:02:49,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-02-21 00:02:49,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:50,043 INFO L225 Difference]: With dead ends: 3335 [2022-02-21 00:02:50,044 INFO L226 Difference]: Without dead ends: 3335 [2022-02-21 00:02:50,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 00:02:50,045 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 37 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:50,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 135 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:50,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2022-02-21 00:02:50,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 3333. [2022-02-21 00:02:50,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:50,093 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3335 states. Second operand has 3333 states, 3332 states have (on average 1.3262304921968788) internal successors, (4419), 3332 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:50,095 INFO L74 IsIncluded]: Start isIncluded. First operand 3335 states. Second operand has 3333 states, 3332 states have (on average 1.3262304921968788) internal successors, (4419), 3332 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:50,097 INFO L87 Difference]: Start difference. First operand 3335 states. Second operand has 3333 states, 3332 states have (on average 1.3262304921968788) internal successors, (4419), 3332 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:50,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:50,482 INFO L93 Difference]: Finished difference Result 3335 states and 4420 transitions. [2022-02-21 00:02:50,482 INFO L276 IsEmpty]: Start isEmpty. Operand 3335 states and 4420 transitions. [2022-02-21 00:02:50,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:50,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:50,513 INFO L74 IsIncluded]: Start isIncluded. First operand has 3333 states, 3332 states have (on average 1.3262304921968788) internal successors, (4419), 3332 states have internal predecessors, (4419), 0 states have call successors, (0), 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 3335 states. [2022-02-21 00:02:50,515 INFO L87 Difference]: Start difference. First operand has 3333 states, 3332 states have (on average 1.3262304921968788) internal successors, (4419), 3332 states have internal predecessors, (4419), 0 states have call successors, (0), 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 3335 states. [2022-02-21 00:02:50,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:50,895 INFO L93 Difference]: Finished difference Result 3335 states and 4420 transitions. [2022-02-21 00:02:50,895 INFO L276 IsEmpty]: Start isEmpty. Operand 3335 states and 4420 transitions. [2022-02-21 00:02:50,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:50,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:50,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:50,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:50,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3333 states, 3332 states have (on average 1.3262304921968788) internal successors, (4419), 3332 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:51,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 4419 transitions. [2022-02-21 00:02:51,283 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 4419 transitions. Word has length 22 [2022-02-21 00:02:51,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:51,284 INFO L470 AbstractCegarLoop]: Abstraction has 3333 states and 4419 transitions. [2022-02-21 00:02:51,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:51,285 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 4419 transitions. [2022-02-21 00:02:51,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-21 00:02:51,288 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:51,288 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] [2022-02-21 00:02:51,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-21 00:02:51,288 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:51,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:51,289 INFO L85 PathProgramCache]: Analyzing trace with hash -449217570, now seen corresponding path program 1 times [2022-02-21 00:02:51,289 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:51,289 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337396276] [2022-02-21 00:02:51,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:51,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:51,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {64273#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {64273#true} is VALID [2022-02-21 00:02:51,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {64273#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; {64273#true} is VALID [2022-02-21 00:02:51,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {64273#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {64273#true} is VALID [2022-02-21 00:02:51,309 INFO L290 TraceCheckUtils]: 3: Hoare triple {64273#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; {64273#true} is VALID [2022-02-21 00:02:51,309 INFO L290 TraceCheckUtils]: 4: Hoare triple {64273#true} assume !(0 != main_~p1~0#1); {64273#true} is VALID [2022-02-21 00:02:51,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {64273#true} assume !(0 != main_~p2~0#1); {64273#true} is VALID [2022-02-21 00:02:51,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {64273#true} assume !(0 != main_~p3~0#1); {64273#true} is VALID [2022-02-21 00:02:51,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {64273#true} assume !(0 != main_~p4~0#1); {64273#true} is VALID [2022-02-21 00:02:51,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {64273#true} assume !(0 != main_~p5~0#1); {64273#true} is VALID [2022-02-21 00:02:51,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {64273#true} assume !(0 != main_~p6~0#1); {64273#true} is VALID [2022-02-21 00:02:51,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {64273#true} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {64275#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:51,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {64275#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {64275#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:51,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {64275#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {64275#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:51,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {64275#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p1~0#1); {64275#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:51,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {64275#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p2~0#1); {64275#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:51,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {64275#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p3~0#1); {64275#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:51,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {64275#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p4~0#1); {64275#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:51,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {64275#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p5~0#1); {64275#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:51,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {64275#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p6~0#1); {64275#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:51,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {64275#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p7~0#1); {64274#false} is VALID [2022-02-21 00:02:51,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {64274#false} assume 0 != main_~p8~0#1; {64274#false} is VALID [2022-02-21 00:02:51,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {64274#false} assume 1 != main_~lk8~0#1; {64274#false} is VALID [2022-02-21 00:02:51,314 INFO L290 TraceCheckUtils]: 22: Hoare triple {64274#false} assume !false; {64274#false} is VALID [2022-02-21 00:02:51,314 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-21 00:02:51,314 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:51,314 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337396276] [2022-02-21 00:02:51,314 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337396276] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:51,314 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:51,314 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:51,315 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993492107] [2022-02-21 00:02:51,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:51,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-02-21 00:02:51,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:51,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:51,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:51,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:51,329 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:51,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:51,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:51,330 INFO L87 Difference]: Start difference. First operand 3333 states and 4419 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:51,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:51,790 INFO L93 Difference]: Finished difference Result 3399 states and 4420 transitions. [2022-02-21 00:02:51,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:51,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-02-21 00:02:51,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:51,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:51,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2022-02-21 00:02:51,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:51,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2022-02-21 00:02:51,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 100 transitions. [2022-02-21 00:02:51,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:52,311 INFO L225 Difference]: With dead ends: 3399 [2022-02-21 00:02:52,312 INFO L226 Difference]: Without dead ends: 3399 [2022-02-21 00:02:52,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 00:02:52,313 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 39 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:52,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 120 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:52,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2022-02-21 00:02:52,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 3397. [2022-02-21 00:02:52,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:52,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3399 states. Second operand has 3397 states, 3396 states have (on average 1.3012367491166077) internal successors, (4419), 3396 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:52,354 INFO L74 IsIncluded]: Start isIncluded. First operand 3399 states. Second operand has 3397 states, 3396 states have (on average 1.3012367491166077) internal successors, (4419), 3396 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:52,356 INFO L87 Difference]: Start difference. First operand 3399 states. Second operand has 3397 states, 3396 states have (on average 1.3012367491166077) internal successors, (4419), 3396 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:52,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:52,768 INFO L93 Difference]: Finished difference Result 3399 states and 4420 transitions. [2022-02-21 00:02:52,768 INFO L276 IsEmpty]: Start isEmpty. Operand 3399 states and 4420 transitions. [2022-02-21 00:02:52,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:52,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:52,775 INFO L74 IsIncluded]: Start isIncluded. First operand has 3397 states, 3396 states have (on average 1.3012367491166077) internal successors, (4419), 3396 states have internal predecessors, (4419), 0 states have call successors, (0), 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 3399 states. [2022-02-21 00:02:52,778 INFO L87 Difference]: Start difference. First operand has 3397 states, 3396 states have (on average 1.3012367491166077) internal successors, (4419), 3396 states have internal predecessors, (4419), 0 states have call successors, (0), 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 3399 states. [2022-02-21 00:02:53,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:53,188 INFO L93 Difference]: Finished difference Result 3399 states and 4420 transitions. [2022-02-21 00:02:53,189 INFO L276 IsEmpty]: Start isEmpty. Operand 3399 states and 4420 transitions. [2022-02-21 00:02:53,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:53,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:53,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:53,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:53,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3397 states, 3396 states have (on average 1.3012367491166077) internal successors, (4419), 3396 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:53,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3397 states to 3397 states and 4419 transitions. [2022-02-21 00:02:53,617 INFO L78 Accepts]: Start accepts. Automaton has 3397 states and 4419 transitions. Word has length 23 [2022-02-21 00:02:53,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:53,617 INFO L470 AbstractCegarLoop]: Abstraction has 3397 states and 4419 transitions. [2022-02-21 00:02:53,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:53,617 INFO L276 IsEmpty]: Start isEmpty. Operand 3397 states and 4419 transitions. [2022-02-21 00:02:53,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-21 00:02:53,620 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:53,620 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] [2022-02-21 00:02:53,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-21 00:02:53,620 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:53,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:53,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1036023584, now seen corresponding path program 1 times [2022-02-21 00:02:53,621 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:53,621 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972151654] [2022-02-21 00:02:53,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:53,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:53,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {77872#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {77872#true} is VALID [2022-02-21 00:02:53,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {77872#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; {77872#true} is VALID [2022-02-21 00:02:53,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {77872#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {77872#true} is VALID [2022-02-21 00:02:53,641 INFO L290 TraceCheckUtils]: 3: Hoare triple {77872#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; {77872#true} is VALID [2022-02-21 00:02:53,641 INFO L290 TraceCheckUtils]: 4: Hoare triple {77872#true} assume !(0 != main_~p1~0#1); {77872#true} is VALID [2022-02-21 00:02:53,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {77872#true} assume !(0 != main_~p2~0#1); {77872#true} is VALID [2022-02-21 00:02:53,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {77872#true} assume !(0 != main_~p3~0#1); {77872#true} is VALID [2022-02-21 00:02:53,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {77872#true} assume !(0 != main_~p4~0#1); {77872#true} is VALID [2022-02-21 00:02:53,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {77872#true} assume !(0 != main_~p5~0#1); {77872#true} is VALID [2022-02-21 00:02:53,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {77872#true} assume !(0 != main_~p6~0#1); {77872#true} is VALID [2022-02-21 00:02:53,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {77872#true} assume !(0 != main_~p7~0#1); {77872#true} is VALID [2022-02-21 00:02:53,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {77872#true} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {77874#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:53,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {77874#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {77874#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:53,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {77874#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p1~0#1); {77874#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:53,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {77874#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p2~0#1); {77874#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:53,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {77874#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p3~0#1); {77874#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:53,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {77874#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p4~0#1); {77874#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:53,644 INFO L290 TraceCheckUtils]: 17: Hoare triple {77874#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p5~0#1); {77874#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:53,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {77874#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p6~0#1); {77874#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:53,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {77874#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p7~0#1); {77874#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:53,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {77874#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p8~0#1; {77874#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:53,646 INFO L290 TraceCheckUtils]: 21: Hoare triple {77874#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 1 != main_~lk8~0#1; {77873#false} is VALID [2022-02-21 00:02:53,646 INFO L290 TraceCheckUtils]: 22: Hoare triple {77873#false} assume !false; {77873#false} is VALID [2022-02-21 00:02:53,646 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-21 00:02:53,646 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:53,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972151654] [2022-02-21 00:02:53,646 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972151654] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:53,646 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:53,646 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:53,647 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390182701] [2022-02-21 00:02:53,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:53,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-02-21 00:02:53,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:53,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:53,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:53,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:53,661 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:53,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:53,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:53,661 INFO L87 Difference]: Start difference. First operand 3397 states and 4419 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:54,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:54,755 INFO L93 Difference]: Finished difference Result 5639 states and 7236 transitions. [2022-02-21 00:02:54,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:54,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-02-21 00:02:54,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:54,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:54,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2022-02-21 00:02:54,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:54,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2022-02-21 00:02:54,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 86 transitions. [2022-02-21 00:02:54,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:55,986 INFO L225 Difference]: With dead ends: 5639 [2022-02-21 00:02:55,986 INFO L226 Difference]: Without dead ends: 5639 [2022-02-21 00:02:55,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 00:02:55,987 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 22 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:55,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 101 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:55,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2022-02-21 00:02:56,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 5125. [2022-02-21 00:02:56,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:56,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5639 states. Second operand has 5125 states, 5124 states have (on average 1.2620999219359874) internal successors, (6467), 5124 states have internal predecessors, (6467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:56,072 INFO L74 IsIncluded]: Start isIncluded. First operand 5639 states. Second operand has 5125 states, 5124 states have (on average 1.2620999219359874) internal successors, (6467), 5124 states have internal predecessors, (6467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:56,077 INFO L87 Difference]: Start difference. First operand 5639 states. Second operand has 5125 states, 5124 states have (on average 1.2620999219359874) internal successors, (6467), 5124 states have internal predecessors, (6467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:57,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:57,127 INFO L93 Difference]: Finished difference Result 5639 states and 7236 transitions. [2022-02-21 00:02:57,127 INFO L276 IsEmpty]: Start isEmpty. Operand 5639 states and 7236 transitions. [2022-02-21 00:02:57,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:57,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:57,138 INFO L74 IsIncluded]: Start isIncluded. First operand has 5125 states, 5124 states have (on average 1.2620999219359874) internal successors, (6467), 5124 states have internal predecessors, (6467), 0 states have call successors, (0), 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 5639 states. [2022-02-21 00:02:57,141 INFO L87 Difference]: Start difference. First operand has 5125 states, 5124 states have (on average 1.2620999219359874) internal successors, (6467), 5124 states have internal predecessors, (6467), 0 states have call successors, (0), 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 5639 states. [2022-02-21 00:02:58,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:58,204 INFO L93 Difference]: Finished difference Result 5639 states and 7236 transitions. [2022-02-21 00:02:58,204 INFO L276 IsEmpty]: Start isEmpty. Operand 5639 states and 7236 transitions. [2022-02-21 00:02:58,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:58,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:58,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:58,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:58,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5125 states, 5124 states have (on average 1.2620999219359874) internal successors, (6467), 5124 states have internal predecessors, (6467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:59,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5125 states to 5125 states and 6467 transitions. [2022-02-21 00:02:59,139 INFO L78 Accepts]: Start accepts. Automaton has 5125 states and 6467 transitions. Word has length 23 [2022-02-21 00:02:59,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:59,139 INFO L470 AbstractCegarLoop]: Abstraction has 5125 states and 6467 transitions. [2022-02-21 00:02:59,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:59,140 INFO L276 IsEmpty]: Start isEmpty. Operand 5125 states and 6467 transitions. [2022-02-21 00:02:59,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-21 00:02:59,143 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:59,143 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] [2022-02-21 00:02:59,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-21 00:02:59,144 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:59,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:59,144 INFO L85 PathProgramCache]: Analyzing trace with hash -777858146, now seen corresponding path program 1 times [2022-02-21 00:02:59,144 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:59,144 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890740632] [2022-02-21 00:02:59,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:59,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:59,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {99919#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {99919#true} is VALID [2022-02-21 00:02:59,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {99919#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; {99919#true} is VALID [2022-02-21 00:02:59,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {99919#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {99919#true} is VALID [2022-02-21 00:02:59,164 INFO L290 TraceCheckUtils]: 3: Hoare triple {99919#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; {99919#true} is VALID [2022-02-21 00:02:59,164 INFO L290 TraceCheckUtils]: 4: Hoare triple {99919#true} assume !(0 != main_~p1~0#1); {99919#true} is VALID [2022-02-21 00:02:59,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {99919#true} assume !(0 != main_~p2~0#1); {99919#true} is VALID [2022-02-21 00:02:59,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {99919#true} assume !(0 != main_~p3~0#1); {99919#true} is VALID [2022-02-21 00:02:59,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {99919#true} assume !(0 != main_~p4~0#1); {99919#true} is VALID [2022-02-21 00:02:59,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {99919#true} assume !(0 != main_~p5~0#1); {99919#true} is VALID [2022-02-21 00:02:59,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {99919#true} assume !(0 != main_~p6~0#1); {99919#true} is VALID [2022-02-21 00:02:59,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {99919#true} assume !(0 != main_~p7~0#1); {99919#true} is VALID [2022-02-21 00:02:59,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {99919#true} assume !(0 != main_~p8~0#1); {99921#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:59,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {99921#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {99921#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:59,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {99921#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p1~0#1); {99921#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:59,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {99921#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p2~0#1); {99921#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:59,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {99921#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p3~0#1); {99921#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:59,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {99921#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p4~0#1); {99921#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:59,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {99921#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p5~0#1); {99921#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:59,168 INFO L290 TraceCheckUtils]: 18: Hoare triple {99921#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p6~0#1); {99921#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:59,168 INFO L290 TraceCheckUtils]: 19: Hoare triple {99921#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p7~0#1); {99921#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:59,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {99921#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p8~0#1; {99920#false} is VALID [2022-02-21 00:02:59,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {99920#false} assume 1 != main_~lk8~0#1; {99920#false} is VALID [2022-02-21 00:02:59,169 INFO L290 TraceCheckUtils]: 22: Hoare triple {99920#false} assume !false; {99920#false} is VALID [2022-02-21 00:02:59,169 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-21 00:02:59,169 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:59,169 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890740632] [2022-02-21 00:02:59,169 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890740632] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:59,170 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:59,170 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:59,170 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012698085] [2022-02-21 00:02:59,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:59,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-02-21 00:02:59,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:59,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:59,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:59,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:59,184 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:59,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:59,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:59,185 INFO L87 Difference]: Start difference. First operand 5125 states and 6467 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:00,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:00,255 INFO L93 Difference]: Finished difference Result 6535 states and 7940 transitions. [2022-02-21 00:03:00,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:03:00,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-02-21 00:03:00,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:00,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:00,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2022-02-21 00:03:00,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2022-02-21 00:03:00,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 99 transitions. [2022-02-21 00:03:00,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:01,384 INFO L225 Difference]: With dead ends: 6535 [2022-02-21 00:03:01,384 INFO L226 Difference]: Without dead ends: 6535 [2022-02-21 00:03:01,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 00:03:01,386 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 36 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:01,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 136 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:01,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6535 states. [2022-02-21 00:03:01,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6535 to 6533. [2022-02-21 00:03:01,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:01,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6535 states. Second operand has 6533 states, 6532 states have (on average 1.2154011022657685) internal successors, (7939), 6532 states have internal predecessors, (7939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:01,464 INFO L74 IsIncluded]: Start isIncluded. First operand 6535 states. Second operand has 6533 states, 6532 states have (on average 1.2154011022657685) internal successors, (7939), 6532 states have internal predecessors, (7939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:01,468 INFO L87 Difference]: Start difference. First operand 6535 states. Second operand has 6533 states, 6532 states have (on average 1.2154011022657685) internal successors, (7939), 6532 states have internal predecessors, (7939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:02,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:02,564 INFO L93 Difference]: Finished difference Result 6535 states and 7940 transitions. [2022-02-21 00:03:02,564 INFO L276 IsEmpty]: Start isEmpty. Operand 6535 states and 7940 transitions. [2022-02-21 00:03:02,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:02,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:02,574 INFO L74 IsIncluded]: Start isIncluded. First operand has 6533 states, 6532 states have (on average 1.2154011022657685) internal successors, (7939), 6532 states have internal predecessors, (7939), 0 states have call successors, (0), 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 6535 states. [2022-02-21 00:03:02,577 INFO L87 Difference]: Start difference. First operand has 6533 states, 6532 states have (on average 1.2154011022657685) internal successors, (7939), 6532 states have internal predecessors, (7939), 0 states have call successors, (0), 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 6535 states. [2022-02-21 00:03:03,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:03,578 INFO L93 Difference]: Finished difference Result 6535 states and 7940 transitions. [2022-02-21 00:03:03,578 INFO L276 IsEmpty]: Start isEmpty. Operand 6535 states and 7940 transitions. [2022-02-21 00:03:03,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:03,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:03,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:03,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:03,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6533 states, 6532 states have (on average 1.2154011022657685) internal successors, (7939), 6532 states have internal predecessors, (7939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6533 states to 6533 states and 7939 transitions. [2022-02-21 00:03:04,733 INFO L78 Accepts]: Start accepts. Automaton has 6533 states and 7939 transitions. Word has length 23 [2022-02-21 00:03:04,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:04,733 INFO L470 AbstractCegarLoop]: Abstraction has 6533 states and 7939 transitions. [2022-02-21 00:03:04,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,733 INFO L276 IsEmpty]: Start isEmpty. Operand 6533 states and 7939 transitions. [2022-02-21 00:03:04,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-21 00:03:04,736 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:04,736 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] [2022-02-21 00:03:04,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-21 00:03:04,736 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:03:04,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:04,737 INFO L85 PathProgramCache]: Analyzing trace with hash -2051743973, now seen corresponding path program 1 times [2022-02-21 00:03:04,737 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:04,737 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569996803] [2022-02-21 00:03:04,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:04,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:04,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {126062#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {126062#true} is VALID [2022-02-21 00:03:04,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {126062#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; {126062#true} is VALID [2022-02-21 00:03:04,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {126062#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {126062#true} is VALID [2022-02-21 00:03:04,784 INFO L290 TraceCheckUtils]: 3: Hoare triple {126062#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; {126062#true} is VALID [2022-02-21 00:03:04,784 INFO L290 TraceCheckUtils]: 4: Hoare triple {126062#true} assume !(0 != main_~p1~0#1); {126062#true} is VALID [2022-02-21 00:03:04,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {126062#true} assume !(0 != main_~p2~0#1); {126062#true} is VALID [2022-02-21 00:03:04,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {126062#true} assume !(0 != main_~p3~0#1); {126062#true} is VALID [2022-02-21 00:03:04,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {126062#true} assume !(0 != main_~p4~0#1); {126062#true} is VALID [2022-02-21 00:03:04,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {126062#true} assume !(0 != main_~p5~0#1); {126062#true} is VALID [2022-02-21 00:03:04,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {126062#true} assume !(0 != main_~p6~0#1); {126062#true} is VALID [2022-02-21 00:03:04,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {126062#true} assume !(0 != main_~p7~0#1); {126062#true} is VALID [2022-02-21 00:03:04,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {126062#true} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {126064#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:04,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {126064#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {126064#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:04,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {126064#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p1~0#1); {126064#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:04,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {126064#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p2~0#1); {126064#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:04,786 INFO L290 TraceCheckUtils]: 15: Hoare triple {126064#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p3~0#1); {126064#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:04,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {126064#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p4~0#1); {126064#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:04,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {126064#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p5~0#1); {126064#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:04,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {126064#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p6~0#1); {126064#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:04,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {126064#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p7~0#1); {126064#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:03:04,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {126064#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p8~0#1); {126063#false} is VALID [2022-02-21 00:03:04,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {126063#false} assume 0 != main_~p9~0#1; {126063#false} is VALID [2022-02-21 00:03:04,789 INFO L290 TraceCheckUtils]: 22: Hoare triple {126063#false} assume 1 != main_~lk9~0#1; {126063#false} is VALID [2022-02-21 00:03:04,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {126063#false} assume !false; {126063#false} is VALID [2022-02-21 00:03:04,789 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-21 00:03:04,789 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:04,790 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569996803] [2022-02-21 00:03:04,790 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569996803] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:04,790 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:04,790 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:03:04,790 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712447760] [2022-02-21 00:03:04,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:04,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-21 00:03:04,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:04,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:04,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:03:04,805 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:04,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:03:04,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:03:04,805 INFO L87 Difference]: Start difference. First operand 6533 states and 7939 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:06,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:06,049 INFO L93 Difference]: Finished difference Result 6663 states and 7940 transitions. [2022-02-21 00:03:06,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:03:06,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-21 00:03:06,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:06,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:06,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2022-02-21 00:03:06,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:06,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2022-02-21 00:03:06,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 98 transitions. [2022-02-21 00:03:06,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:07,340 INFO L225 Difference]: With dead ends: 6663 [2022-02-21 00:03:07,341 INFO L226 Difference]: Without dead ends: 6663 [2022-02-21 00:03:07,341 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 00:03:07,341 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 38 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:07,341 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 116 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:07,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6663 states. [2022-02-21 00:03:07,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6663 to 6661. [2022-02-21 00:03:07,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:07,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6663 states. Second operand has 6661 states, 6660 states have (on average 1.1920420420420421) internal successors, (7939), 6660 states have internal predecessors, (7939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:07,453 INFO L74 IsIncluded]: Start isIncluded. First operand 6663 states. Second operand has 6661 states, 6660 states have (on average 1.1920420420420421) internal successors, (7939), 6660 states have internal predecessors, (7939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:07,458 INFO L87 Difference]: Start difference. First operand 6663 states. Second operand has 6661 states, 6660 states have (on average 1.1920420420420421) internal successors, (7939), 6660 states have internal predecessors, (7939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:09,058 INFO L93 Difference]: Finished difference Result 6663 states and 7940 transitions. [2022-02-21 00:03:09,058 INFO L276 IsEmpty]: Start isEmpty. Operand 6663 states and 7940 transitions. [2022-02-21 00:03:09,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:09,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:09,071 INFO L74 IsIncluded]: Start isIncluded. First operand has 6661 states, 6660 states have (on average 1.1920420420420421) internal successors, (7939), 6660 states have internal predecessors, (7939), 0 states have call successors, (0), 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 6663 states. [2022-02-21 00:03:09,078 INFO L87 Difference]: Start difference. First operand has 6661 states, 6660 states have (on average 1.1920420420420421) internal successors, (7939), 6660 states have internal predecessors, (7939), 0 states have call successors, (0), 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 6663 states. [2022-02-21 00:03:10,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:10,571 INFO L93 Difference]: Finished difference Result 6663 states and 7940 transitions. [2022-02-21 00:03:10,571 INFO L276 IsEmpty]: Start isEmpty. Operand 6663 states and 7940 transitions. [2022-02-21 00:03:10,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:10,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:10,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:10,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:10,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6661 states, 6660 states have (on average 1.1920420420420421) internal successors, (7939), 6660 states have internal predecessors, (7939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:12,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 7939 transitions. [2022-02-21 00:03:12,208 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 7939 transitions. Word has length 24 [2022-02-21 00:03:12,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:12,209 INFO L470 AbstractCegarLoop]: Abstraction has 6661 states and 7939 transitions. [2022-02-21 00:03:12,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:12,209 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 7939 transitions. [2022-02-21 00:03:12,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-21 00:03:12,213 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:12,213 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] [2022-02-21 00:03:12,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-21 00:03:12,213 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:03:12,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:12,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1656417309, now seen corresponding path program 1 times [2022-02-21 00:03:12,214 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:12,214 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892371846] [2022-02-21 00:03:12,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:12,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:12,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {152717#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {152717#true} is VALID [2022-02-21 00:03:12,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {152717#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; {152717#true} is VALID [2022-02-21 00:03:12,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {152717#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {152717#true} is VALID [2022-02-21 00:03:12,235 INFO L290 TraceCheckUtils]: 3: Hoare triple {152717#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; {152717#true} is VALID [2022-02-21 00:03:12,235 INFO L290 TraceCheckUtils]: 4: Hoare triple {152717#true} assume !(0 != main_~p1~0#1); {152717#true} is VALID [2022-02-21 00:03:12,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {152717#true} assume !(0 != main_~p2~0#1); {152717#true} is VALID [2022-02-21 00:03:12,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {152717#true} assume !(0 != main_~p3~0#1); {152717#true} is VALID [2022-02-21 00:03:12,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {152717#true} assume !(0 != main_~p4~0#1); {152717#true} is VALID [2022-02-21 00:03:12,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {152717#true} assume !(0 != main_~p5~0#1); {152717#true} is VALID [2022-02-21 00:03:12,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {152717#true} assume !(0 != main_~p6~0#1); {152717#true} is VALID [2022-02-21 00:03:12,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {152717#true} assume !(0 != main_~p7~0#1); {152717#true} is VALID [2022-02-21 00:03:12,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {152717#true} assume !(0 != main_~p8~0#1); {152717#true} is VALID [2022-02-21 00:03:12,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {152717#true} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {152719#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:12,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {152719#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p1~0#1); {152719#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:12,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {152719#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p2~0#1); {152719#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:12,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {152719#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p3~0#1); {152719#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:12,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {152719#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p4~0#1); {152719#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:12,239 INFO L290 TraceCheckUtils]: 17: Hoare triple {152719#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p5~0#1); {152719#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:12,239 INFO L290 TraceCheckUtils]: 18: Hoare triple {152719#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p6~0#1); {152719#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:12,239 INFO L290 TraceCheckUtils]: 19: Hoare triple {152719#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p7~0#1); {152719#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:12,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {152719#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p8~0#1); {152719#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:12,240 INFO L290 TraceCheckUtils]: 21: Hoare triple {152719#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume 0 != main_~p9~0#1; {152719#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:12,240 INFO L290 TraceCheckUtils]: 22: Hoare triple {152719#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume 1 != main_~lk9~0#1; {152718#false} is VALID [2022-02-21 00:03:12,241 INFO L290 TraceCheckUtils]: 23: Hoare triple {152718#false} assume !false; {152718#false} is VALID [2022-02-21 00:03:12,241 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-21 00:03:12,241 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:12,241 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892371846] [2022-02-21 00:03:12,241 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892371846] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:12,241 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:12,242 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:03:12,242 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299509153] [2022-02-21 00:03:12,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:12,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-21 00:03:12,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:12,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:12,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:12,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:03:12,258 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:12,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:03:12,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:03:12,259 INFO L87 Difference]: Start difference. First operand 6661 states and 7939 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:16,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:16,243 INFO L93 Difference]: Finished difference Result 10757 states and 12419 transitions. [2022-02-21 00:03:16,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:03:16,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-21 00:03:16,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:16,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:16,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-02-21 00:03:16,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:16,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-02-21 00:03:16,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 81 transitions. [2022-02-21 00:03:16,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:20,733 INFO L225 Difference]: With dead ends: 10757 [2022-02-21 00:03:20,733 INFO L226 Difference]: Without dead ends: 10757 [2022-02-21 00:03:20,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 00:03:20,734 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 18 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:20,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 98 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:20,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10757 states. [2022-02-21 00:03:20,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10757 to 10245. [2022-02-21 00:03:20,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:20,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10757 states. Second operand has 10245 states, 10244 states have (on average 1.1623389301054277) internal successors, (11907), 10244 states have internal predecessors, (11907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:20,867 INFO L74 IsIncluded]: Start isIncluded. First operand 10757 states. Second operand has 10245 states, 10244 states have (on average 1.1623389301054277) internal successors, (11907), 10244 states have internal predecessors, (11907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:20,878 INFO L87 Difference]: Start difference. First operand 10757 states. Second operand has 10245 states, 10244 states have (on average 1.1623389301054277) internal successors, (11907), 10244 states have internal predecessors, (11907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:24,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:24,869 INFO L93 Difference]: Finished difference Result 10757 states and 12419 transitions. [2022-02-21 00:03:24,869 INFO L276 IsEmpty]: Start isEmpty. Operand 10757 states and 12419 transitions. [2022-02-21 00:03:24,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:24,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:24,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 10245 states, 10244 states have (on average 1.1623389301054277) internal successors, (11907), 10244 states have internal predecessors, (11907), 0 states have call successors, (0), 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 10757 states. [2022-02-21 00:03:24,934 INFO L87 Difference]: Start difference. First operand has 10245 states, 10244 states have (on average 1.1623389301054277) internal successors, (11907), 10244 states have internal predecessors, (11907), 0 states have call successors, (0), 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 10757 states. [2022-02-21 00:03:27,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:27,846 INFO L93 Difference]: Finished difference Result 10757 states and 12419 transitions. [2022-02-21 00:03:27,846 INFO L276 IsEmpty]: Start isEmpty. Operand 10757 states and 12419 transitions. [2022-02-21 00:03:27,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:27,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:27,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:27,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:27,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10245 states, 10244 states have (on average 1.1623389301054277) internal successors, (11907), 10244 states have internal predecessors, (11907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:30,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10245 states to 10245 states and 11907 transitions. [2022-02-21 00:03:30,204 INFO L78 Accepts]: Start accepts. Automaton has 10245 states and 11907 transitions. Word has length 24 [2022-02-21 00:03:30,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:30,204 INFO L470 AbstractCegarLoop]: Abstraction has 10245 states and 11907 transitions. [2022-02-21 00:03:30,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:30,204 INFO L276 IsEmpty]: Start isEmpty. Operand 10245 states and 11907 transitions. [2022-02-21 00:03:30,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-21 00:03:30,210 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:30,210 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] [2022-02-21 00:03:30,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-02-21 00:03:30,212 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:03:30,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:30,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1914582747, now seen corresponding path program 1 times [2022-02-21 00:03:30,213 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:30,213 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146839304] [2022-02-21 00:03:30,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:30,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:30,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {195238#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {195238#true} is VALID [2022-02-21 00:03:30,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {195238#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; {195238#true} is VALID [2022-02-21 00:03:30,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {195238#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {195238#true} is VALID [2022-02-21 00:03:30,250 INFO L290 TraceCheckUtils]: 3: Hoare triple {195238#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; {195238#true} is VALID [2022-02-21 00:03:30,250 INFO L290 TraceCheckUtils]: 4: Hoare triple {195238#true} assume !(0 != main_~p1~0#1); {195238#true} is VALID [2022-02-21 00:03:30,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {195238#true} assume !(0 != main_~p2~0#1); {195238#true} is VALID [2022-02-21 00:03:30,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {195238#true} assume !(0 != main_~p3~0#1); {195238#true} is VALID [2022-02-21 00:03:30,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {195238#true} assume !(0 != main_~p4~0#1); {195238#true} is VALID [2022-02-21 00:03:30,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {195238#true} assume !(0 != main_~p5~0#1); {195238#true} is VALID [2022-02-21 00:03:30,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {195238#true} assume !(0 != main_~p6~0#1); {195238#true} is VALID [2022-02-21 00:03:30,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {195238#true} assume !(0 != main_~p7~0#1); {195238#true} is VALID [2022-02-21 00:03:30,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {195238#true} assume !(0 != main_~p8~0#1); {195238#true} is VALID [2022-02-21 00:03:30,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {195238#true} assume !(0 != main_~p9~0#1); {195240#(= |ULTIMATE.start_main_~p9~0#1| 0)} is VALID [2022-02-21 00:03:30,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {195240#(= |ULTIMATE.start_main_~p9~0#1| 0)} assume !(0 != main_~p1~0#1); {195240#(= |ULTIMATE.start_main_~p9~0#1| 0)} is VALID [2022-02-21 00:03:30,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {195240#(= |ULTIMATE.start_main_~p9~0#1| 0)} assume !(0 != main_~p2~0#1); {195240#(= |ULTIMATE.start_main_~p9~0#1| 0)} is VALID [2022-02-21 00:03:30,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {195240#(= |ULTIMATE.start_main_~p9~0#1| 0)} assume !(0 != main_~p3~0#1); {195240#(= |ULTIMATE.start_main_~p9~0#1| 0)} is VALID [2022-02-21 00:03:30,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {195240#(= |ULTIMATE.start_main_~p9~0#1| 0)} assume !(0 != main_~p4~0#1); {195240#(= |ULTIMATE.start_main_~p9~0#1| 0)} is VALID [2022-02-21 00:03:30,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {195240#(= |ULTIMATE.start_main_~p9~0#1| 0)} assume !(0 != main_~p5~0#1); {195240#(= |ULTIMATE.start_main_~p9~0#1| 0)} is VALID [2022-02-21 00:03:30,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {195240#(= |ULTIMATE.start_main_~p9~0#1| 0)} assume !(0 != main_~p6~0#1); {195240#(= |ULTIMATE.start_main_~p9~0#1| 0)} is VALID [2022-02-21 00:03:30,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {195240#(= |ULTIMATE.start_main_~p9~0#1| 0)} assume !(0 != main_~p7~0#1); {195240#(= |ULTIMATE.start_main_~p9~0#1| 0)} is VALID [2022-02-21 00:03:30,255 INFO L290 TraceCheckUtils]: 20: Hoare triple {195240#(= |ULTIMATE.start_main_~p9~0#1| 0)} assume !(0 != main_~p8~0#1); {195240#(= |ULTIMATE.start_main_~p9~0#1| 0)} is VALID [2022-02-21 00:03:30,255 INFO L290 TraceCheckUtils]: 21: Hoare triple {195240#(= |ULTIMATE.start_main_~p9~0#1| 0)} assume 0 != main_~p9~0#1; {195239#false} is VALID [2022-02-21 00:03:30,255 INFO L290 TraceCheckUtils]: 22: Hoare triple {195239#false} assume 1 != main_~lk9~0#1; {195239#false} is VALID [2022-02-21 00:03:30,255 INFO L290 TraceCheckUtils]: 23: Hoare triple {195239#false} assume !false; {195239#false} is VALID [2022-02-21 00:03:30,255 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-21 00:03:30,256 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:30,256 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146839304] [2022-02-21 00:03:30,256 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146839304] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:30,256 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:30,256 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:03:30,256 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938372598] [2022-02-21 00:03:30,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:30,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-21 00:03:30,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:30,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:30,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:30,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:03:30,269 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:30,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:03:30,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:03:30,270 INFO L87 Difference]: Start difference. First operand 10245 states and 11907 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:34,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:34,577 INFO L93 Difference]: Finished difference Result 12803 states and 14082 transitions. [2022-02-21 00:03:34,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:03:34,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-21 00:03:34,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:34,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:34,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-02-21 00:03:34,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:34,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-02-21 00:03:34,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-02-21 00:03:34,631 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-21 00:03:34,632 INFO L225 Difference]: With dead ends: 12803 [2022-02-21 00:03:34,632 INFO L226 Difference]: Without dead ends: 0 [2022-02-21 00:03:34,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 00:03:34,632 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 34 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:34,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 135 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:34,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-21 00:03:34,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-21 00:03:34,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:34,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:34,633 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:34,634 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:34,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:34,634 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 00:03:34,634 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 00:03:34,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:34,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:34,634 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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 0 states. [2022-02-21 00:03:34,634 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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 0 states. [2022-02-21 00:03:34,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:34,634 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 00:03:34,635 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 00:03:34,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:34,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:34,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:34,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:34,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:34,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 00:03:34,635 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-02-21 00:03:34,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:34,635 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 00:03:34,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:34,636 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 00:03:34,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:34,638 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-02-21 00:03:34,640 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-02-21 00:03:34,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-02-21 00:03:34,643 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:34,644 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 00:03:34,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 12:03:34 BoogieIcfgContainer [2022-02-21 00:03:34,648 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 00:03:34,648 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 00:03:34,648 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 00:03:34,648 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 00:03:34,648 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:40" (3/4) ... [2022-02-21 00:03:34,652 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-21 00:03:34,661 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-02-21 00:03:34,661 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-21 00:03:34,661 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-02-21 00:03:34,661 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-21 00:03:34,694 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 00:03:34,694 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 00:03:34,695 INFO L158 Benchmark]: Toolchain (without parser) took 54656.78ms. Allocated memory was 109.1MB in the beginning and 262.1MB in the end (delta: 153.1MB). Free memory was 70.0MB in the beginning and 84.2MB in the end (delta: -14.2MB). Peak memory consumption was 137.8MB. Max. memory is 16.1GB. [2022-02-21 00:03:34,695 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 00:03:34,695 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.91ms. Allocated memory is still 109.1MB. Free memory was 69.8MB in the beginning and 82.9MB in the end (delta: -13.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 00:03:34,696 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.10ms. Allocated memory is still 109.1MB. Free memory was 82.9MB in the beginning and 80.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 00:03:34,696 INFO L158 Benchmark]: Boogie Preprocessor took 24.59ms. Allocated memory is still 109.1MB. Free memory was 80.9MB in the beginning and 79.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 00:03:34,696 INFO L158 Benchmark]: RCFGBuilder took 277.06ms. Allocated memory is still 109.1MB. Free memory was 79.5MB in the beginning and 64.1MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-21 00:03:34,698 INFO L158 Benchmark]: TraceAbstraction took 54075.76ms. Allocated memory was 109.1MB in the beginning and 262.1MB in the end (delta: 153.1MB). Free memory was 63.5MB in the beginning and 87.3MB in the end (delta: -23.8MB). Peak memory consumption was 131.9MB. Max. memory is 16.1GB. [2022-02-21 00:03:34,698 INFO L158 Benchmark]: Witness Printer took 46.26ms. Allocated memory is still 262.1MB. Free memory was 87.3MB in the beginning and 84.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 00:03:34,706 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.14ms. Allocated memory is still 109.1MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.91ms. Allocated memory is still 109.1MB. Free memory was 69.8MB in the beginning and 82.9MB in the end (delta: -13.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.10ms. Allocated memory is still 109.1MB. Free memory was 82.9MB in the beginning and 80.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.59ms. Allocated memory is still 109.1MB. Free memory was 80.9MB in the beginning and 79.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 277.06ms. Allocated memory is still 109.1MB. Free memory was 79.5MB in the beginning and 64.1MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 54075.76ms. Allocated memory was 109.1MB in the beginning and 262.1MB in the end (delta: 153.1MB). Free memory was 63.5MB in the beginning and 87.3MB in the end (delta: -23.8MB). Peak memory consumption was 131.9MB. Max. memory is 16.1GB. * Witness Printer took 46.26ms. Allocated memory is still 262.1MB. Free memory was 87.3MB in the beginning and 84.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 149]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 54.0s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 26.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 974 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 974 mSDsluCounter, 3211 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1228 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 134 IncrementalHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 1983 mSDtfsCounter, 134 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10245occurred in iteration=26, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 25.9s AutomataMinimizationTime, 27 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 516 NumberOfCodeBlocks, 516 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 489 ConstructedInterpolants, 0 QuantifiedInterpolants, 1028 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-21 00:03:34,738 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 Result: TRUE