./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_10.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_10.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 c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 00:02:06,591 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 00:02:06,593 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 00:02:06,623 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 00:02:06,624 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 00:02:06,625 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 00:02:06,626 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 00:02:06,627 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 00:02:06,628 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 00:02:06,629 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 00:02:06,630 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 00:02:06,630 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 00:02:06,631 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 00:02:06,632 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 00:02:06,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 00:02:06,633 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 00:02:06,634 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 00:02:06,635 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 00:02:06,636 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 00:02:06,637 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 00:02:06,638 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 00:02:06,639 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 00:02:06,640 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 00:02:06,640 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 00:02:06,642 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 00:02:06,642 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 00:02:06,643 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 00:02:06,643 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 00:02:06,644 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 00:02:06,644 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 00:02:06,645 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 00:02:06,645 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 00:02:06,646 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 00:02:06,646 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 00:02:06,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 00:02:06,648 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 00:02:06,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 00:02:06,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 00:02:06,649 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 00:02:06,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 00:02:06,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 00:02:06,660 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:06,685 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 00:02:06,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 00:02:06,686 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 00:02:06,686 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 00:02:06,686 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 00:02:06,687 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 00:02:06,687 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 00:02:06,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 00:02:06,687 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 00:02:06,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 00:02:06,688 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 00:02:06,688 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 00:02:06,688 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 00:02:06,689 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 00:02:06,689 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 00:02:06,689 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-21 00:02:06,689 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-21 00:02:06,689 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-21 00:02:06,689 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 00:02:06,690 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-21 00:02:06,690 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 00:02:06,690 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 00:02:06,690 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 00:02:06,690 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 00:02:06,691 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 00:02:06,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:02:06,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 00:02:06,696 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 00:02:06,696 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 00:02:06,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 00:02:06,697 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 -> c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b [2022-02-21 00:02:06,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 00:02:06,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 00:02:06,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 00:02:06,889 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 00:02:06,889 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 00:02:06,890 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_10.c [2022-02-21 00:02:06,960 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49b5bc5f0/4959e29d83914afebd848132e546953c/FLAGb303c865c [2022-02-21 00:02:07,247 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 00:02:07,248 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_10.c [2022-02-21 00:02:07,260 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49b5bc5f0/4959e29d83914afebd848132e546953c/FLAGb303c865c [2022-02-21 00:02:07,688 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49b5bc5f0/4959e29d83914afebd848132e546953c [2022-02-21 00:02:07,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 00:02:07,692 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 00:02:07,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 00:02:07,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 00:02:07,698 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 00:02:07,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:02:07" (1/1) ... [2022-02-21 00:02:07,700 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60b77fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:07, skipping insertion in model container [2022-02-21 00:02:07,700 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:02:07" (1/1) ... [2022-02-21 00:02:07,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 00:02:07,725 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 00:02:07,854 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_10.c[3901,3914] [2022-02-21 00:02:07,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:02:07,866 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 00:02:07,881 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_10.c[3901,3914] [2022-02-21 00:02:07,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:02:07,891 INFO L208 MainTranslator]: Completed translation [2022-02-21 00:02:07,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:07 WrapperNode [2022-02-21 00:02:07,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 00:02:07,893 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 00:02:07,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 00:02:07,894 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 00:02:07,898 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:07" (1/1) ... [2022-02-21 00:02:07,903 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:07" (1/1) ... [2022-02-21 00:02:07,934 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 138 [2022-02-21 00:02:07,934 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 00:02:07,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 00:02:07,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 00:02:07,935 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 00:02:07,940 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:07" (1/1) ... [2022-02-21 00:02:07,940 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:07" (1/1) ... [2022-02-21 00:02:07,942 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:07" (1/1) ... [2022-02-21 00:02:07,942 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:07" (1/1) ... [2022-02-21 00:02:07,945 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:07" (1/1) ... [2022-02-21 00:02:07,948 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:07" (1/1) ... [2022-02-21 00:02:07,949 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:07" (1/1) ... [2022-02-21 00:02:07,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 00:02:07,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 00:02:07,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 00:02:07,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 00:02:07,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:07" (1/1) ... [2022-02-21 00:02:07,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:02:07,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:07,990 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:07,992 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:08,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 00:02:08,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 00:02:08,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 00:02:08,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 00:02:08,065 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 00:02:08,066 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 00:02:08,336 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 00:02:08,341 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 00:02:08,341 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 00:02:08,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:08 BoogieIcfgContainer [2022-02-21 00:02:08,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 00:02:08,343 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 00:02:08,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 00:02:08,346 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 00:02:08,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 12:02:07" (1/3) ... [2022-02-21 00:02:08,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58226f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:02:08, skipping insertion in model container [2022-02-21 00:02:08,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:07" (2/3) ... [2022-02-21 00:02:08,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58226f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:02:08, skipping insertion in model container [2022-02-21 00:02:08,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:08" (3/3) ... [2022-02-21 00:02:08,348 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2022-02-21 00:02:08,352 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 00:02:08,352 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-21 00:02:08,379 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 00:02:08,384 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:08,384 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-21 00:02:08,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 40 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:08,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 00:02:08,415 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:08,415 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 00:02:08,417 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:08,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:08,424 INFO L85 PathProgramCache]: Analyzing trace with hash 28703467, now seen corresponding path program 1 times [2022-02-21 00:02:08,430 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:08,431 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059692703] [2022-02-21 00:02:08,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:08,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:08,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {44#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(16, 2);call #Ultimate.allocInit(12, 3); {44#true} is VALID [2022-02-21 00:02:08,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {44#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_#t~nondet14#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_~p10~0#1, main_~lk10~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;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; {44#true} is VALID [2022-02-21 00:02:08,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#true} assume false; {45#false} is VALID [2022-02-21 00:02:08,603 INFO L290 TraceCheckUtils]: 3: Hoare triple {45#false} main_#res#1 := 0; {45#false} is VALID [2022-02-21 00:02:08,603 INFO L290 TraceCheckUtils]: 4: Hoare triple {45#false} assume !(#valid == main_old_#valid#1); {45#false} is VALID [2022-02-21 00:02:08,605 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:08,605 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:08,605 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059692703] [2022-02-21 00:02:08,606 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059692703] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:08,606 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:08,606 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:08,607 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781789359] [2022-02-21 00:02:08,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:08,611 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:08,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:08,614 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:08,624 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:08,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-21 00:02:08,625 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:08,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 00:02:08,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 00:02:08,650 INFO L87 Difference]: Start difference. First operand has 41 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 40 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 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:08,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:08,712 INFO L93 Difference]: Finished difference Result 41 states and 70 transitions. [2022-02-21 00:02:08,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 00:02:08,712 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:08,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:08,713 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:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 73 transitions. [2022-02-21 00:02:08,723 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:08,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 73 transitions. [2022-02-21 00:02:08,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 73 transitions. [2022-02-21 00:02:08,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:08,798 INFO L225 Difference]: With dead ends: 41 [2022-02-21 00:02:08,798 INFO L226 Difference]: Without dead ends: 39 [2022-02-21 00:02:08,800 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:08,803 INFO L933 BasicCegarLoop]: 70 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, 70 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:08,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 70 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:08,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-21 00:02:08,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-02-21 00:02:08,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:08,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 37 states have (on average 1.837837837837838) internal successors, (68), 38 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:08,839 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 37 states have (on average 1.837837837837838) internal successors, (68), 38 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:08,840 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 37 states have (on average 1.837837837837838) internal successors, (68), 38 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:08,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:08,845 INFO L93 Difference]: Finished difference Result 39 states and 68 transitions. [2022-02-21 00:02:08,845 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2022-02-21 00:02:08,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:08,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:08,848 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 37 states have (on average 1.837837837837838) internal successors, (68), 38 states have internal predecessors, (68), 0 states have call successors, (0), 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 39 states. [2022-02-21 00:02:08,849 INFO L87 Difference]: Start difference. First operand has 39 states, 37 states have (on average 1.837837837837838) internal successors, (68), 38 states have internal predecessors, (68), 0 states have call successors, (0), 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 39 states. [2022-02-21 00:02:08,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:08,851 INFO L93 Difference]: Finished difference Result 39 states and 68 transitions. [2022-02-21 00:02:08,851 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2022-02-21 00:02:08,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:08,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:08,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:08,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:08,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 37 states have (on average 1.837837837837838) internal successors, (68), 38 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:08,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 68 transitions. [2022-02-21 00:02:08,854 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 68 transitions. Word has length 5 [2022-02-21 00:02:08,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:08,854 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 68 transitions. [2022-02-21 00:02:08,854 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:08,854 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2022-02-21 00:02:08,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 00:02:08,855 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:08,855 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 00:02:08,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 00:02:08,855 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:08,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:08,856 INFO L85 PathProgramCache]: Analyzing trace with hash 889697963, now seen corresponding path program 1 times [2022-02-21 00:02:08,856 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:08,856 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441666217] [2022-02-21 00:02:08,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:08,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:08,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {206#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(16, 2);call #Ultimate.allocInit(12, 3); {206#true} is VALID [2022-02-21 00:02:08,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {206#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_#t~nondet14#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_~p10~0#1, main_~lk10~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;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; {208#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:08,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !false;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {208#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:08,915 INFO L290 TraceCheckUtils]: 3: Hoare triple {208#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume 0 == main_~cond~0#1; {208#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:08,916 INFO L290 TraceCheckUtils]: 4: Hoare triple {208#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} main_#res#1 := 0; {208#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:08,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(#valid == main_old_#valid#1); {207#false} is VALID [2022-02-21 00:02:08,919 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:08,920 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:08,920 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441666217] [2022-02-21 00:02:08,921 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441666217] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:08,921 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:08,922 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:08,922 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461972137] [2022-02-21 00:02:08,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:08,924 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:08,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:08,929 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:08,938 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:08,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:08,938 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:08,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:08,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:08,940 INFO L87 Difference]: Start difference. First operand 39 states and 68 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:09,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:09,000 INFO L93 Difference]: Finished difference Result 38 states and 67 transitions. [2022-02-21 00:02:09,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:09,001 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:09,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:09,001 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:09,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-02-21 00:02:09,003 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:09,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-02-21 00:02:09,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 68 transitions. [2022-02-21 00:02:09,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:09,051 INFO L225 Difference]: With dead ends: 38 [2022-02-21 00:02:09,051 INFO L226 Difference]: Without dead ends: 36 [2022-02-21 00:02:09,054 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:09,057 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 62 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 67 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:09,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 67 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:09,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-21 00:02:09,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-02-21 00:02:09,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:09,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 35 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:09,065 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 35 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:09,065 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 35 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:09,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:09,073 INFO L93 Difference]: Finished difference Result 36 states and 65 transitions. [2022-02-21 00:02:09,074 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 65 transitions. [2022-02-21 00:02:09,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:09,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:09,075 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 35 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 36 states. [2022-02-21 00:02:09,075 INFO L87 Difference]: Start difference. First operand has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 35 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 36 states. [2022-02-21 00:02:09,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:09,080 INFO L93 Difference]: Finished difference Result 36 states and 65 transitions. [2022-02-21 00:02:09,080 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 65 transitions. [2022-02-21 00:02:09,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:09,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:09,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:09,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:09,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 35 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:09,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 65 transitions. [2022-02-21 00:02:09,082 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 65 transitions. Word has length 6 [2022-02-21 00:02:09,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:09,083 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 65 transitions. [2022-02-21 00:02:09,083 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:09,083 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 65 transitions. [2022-02-21 00:02:09,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-21 00:02:09,084 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:09,084 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:09,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 00:02:09,084 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:09,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:09,085 INFO L85 PathProgramCache]: Analyzing trace with hash 153349273, now seen corresponding path program 1 times [2022-02-21 00:02:09,085 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:09,085 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471063449] [2022-02-21 00:02:09,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:09,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:09,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {357#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(16, 2);call #Ultimate.allocInit(12, 3); {357#true} is VALID [2022-02-21 00:02:09,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {357#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_#t~nondet14#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_~p10~0#1, main_~lk10~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;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; {357#true} is VALID [2022-02-21 00:02:09,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {357#true} assume !false;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {357#true} is VALID [2022-02-21 00:02:09,132 INFO L290 TraceCheckUtils]: 3: Hoare triple {357#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;main_~lk10~0#1 := 0; {357#true} is VALID [2022-02-21 00:02:09,133 INFO L290 TraceCheckUtils]: 4: Hoare triple {357#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {359#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:09,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {359#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {359#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:09,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {359#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume !(0 != main_~p3~0#1); {359#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:09,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {359#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {359#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:09,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {359#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {359#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:09,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {359#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {359#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:09,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {359#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {359#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:09,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {359#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {359#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:09,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {359#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {359#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:09,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {359#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {359#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:09,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {359#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p1~0#1; {359#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:09,137 INFO L290 TraceCheckUtils]: 15: Hoare triple {359#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 1 != main_~lk1~0#1; {358#false} is VALID [2022-02-21 00:02:09,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {358#false} assume !false; {358#false} is VALID [2022-02-21 00:02:09,137 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:09,138 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:09,138 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471063449] [2022-02-21 00:02:09,138 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471063449] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:09,138 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:09,138 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:09,138 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959200764] [2022-02-21 00:02:09,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:09,139 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:09,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:09,139 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:09,150 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:09,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:09,155 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:09,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:09,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:09,156 INFO L87 Difference]: Start difference. First operand 36 states and 65 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:09,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:09,240 INFO L93 Difference]: Finished difference Result 69 states and 125 transitions. [2022-02-21 00:02:09,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:09,240 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:09,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:09,241 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:09,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2022-02-21 00:02:09,242 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:09,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2022-02-21 00:02:09,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2022-02-21 00:02:09,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:09,340 INFO L225 Difference]: With dead ends: 69 [2022-02-21 00:02:09,340 INFO L226 Difference]: Without dead ends: 69 [2022-02-21 00:02:09,340 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:09,350 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 48 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 127 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:09,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 127 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:09,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-02-21 00:02:09,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 47. [2022-02-21 00:02:09,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:09,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 47 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 46 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:09,364 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 47 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 46 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:09,364 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 47 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 46 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:09,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:09,367 INFO L93 Difference]: Finished difference Result 69 states and 125 transitions. [2022-02-21 00:02:09,367 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 125 transitions. [2022-02-21 00:02:09,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:09,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:09,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 46 states have internal predecessors, (86), 0 states have call successors, (0), 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 69 states. [2022-02-21 00:02:09,368 INFO L87 Difference]: Start difference. First operand has 47 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 46 states have internal predecessors, (86), 0 states have call successors, (0), 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 69 states. [2022-02-21 00:02:09,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:09,371 INFO L93 Difference]: Finished difference Result 69 states and 125 transitions. [2022-02-21 00:02:09,371 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 125 transitions. [2022-02-21 00:02:09,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:09,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:09,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:09,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 46 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:09,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 86 transitions. [2022-02-21 00:02:09,374 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 86 transitions. Word has length 17 [2022-02-21 00:02:09,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:09,375 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 86 transitions. [2022-02-21 00:02:09,375 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:09,375 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2022-02-21 00:02:09,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-21 00:02:09,376 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:09,376 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:09,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 00:02:09,376 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:09,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:09,377 INFO L85 PathProgramCache]: Analyzing trace with hash -433456741, now seen corresponding path program 1 times [2022-02-21 00:02:09,377 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:09,378 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712313817] [2022-02-21 00:02:09,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:09,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:09,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {616#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(16, 2);call #Ultimate.allocInit(12, 3); {616#true} is VALID [2022-02-21 00:02:09,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {616#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_#t~nondet14#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_~p10~0#1, main_~lk10~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;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; {616#true} is VALID [2022-02-21 00:02:09,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {616#true} assume !false;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {616#true} is VALID [2022-02-21 00:02:09,422 INFO L290 TraceCheckUtils]: 3: Hoare triple {616#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;main_~lk10~0#1 := 0; {616#true} is VALID [2022-02-21 00:02:09,422 INFO L290 TraceCheckUtils]: 4: Hoare triple {616#true} assume !(0 != main_~p1~0#1); {618#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:09,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {618#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {618#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:09,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {618#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume !(0 != main_~p3~0#1); {618#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:09,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {618#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {618#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:09,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {618#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {618#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:09,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {618#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {618#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:09,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {618#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {618#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:09,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {618#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {618#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:09,426 INFO L290 TraceCheckUtils]: 12: Hoare triple {618#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {618#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:09,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {618#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {618#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:09,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {618#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p1~0#1; {617#false} is VALID [2022-02-21 00:02:09,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {617#false} assume 1 != main_~lk1~0#1; {617#false} is VALID [2022-02-21 00:02:09,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {617#false} assume !false; {617#false} is VALID [2022-02-21 00:02:09,427 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:09,428 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:09,428 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712313817] [2022-02-21 00:02:09,428 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712313817] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:09,428 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:09,428 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:09,429 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004748876] [2022-02-21 00:02:09,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:09,429 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:09,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:09,430 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:09,442 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:09,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:09,442 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:09,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:09,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:09,443 INFO L87 Difference]: Start difference. First operand 47 states and 86 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:09,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:09,508 INFO L93 Difference]: Finished difference Result 69 states and 123 transitions. [2022-02-21 00:02:09,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:09,508 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:09,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:09,508 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:09,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2022-02-21 00:02:09,510 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:09,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2022-02-21 00:02:09,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 125 transitions. [2022-02-21 00:02:09,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:09,613 INFO L225 Difference]: With dead ends: 69 [2022-02-21 00:02:09,613 INFO L226 Difference]: Without dead ends: 69 [2022-02-21 00:02:09,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:09,614 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 48 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 143 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:09,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 143 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:09,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-02-21 00:02:09,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-02-21 00:02:09,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:09,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 67 states, 66 states have (on average 1.8484848484848484) internal successors, (122), 66 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:09,618 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 67 states, 66 states have (on average 1.8484848484848484) internal successors, (122), 66 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:09,618 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 67 states, 66 states have (on average 1.8484848484848484) internal successors, (122), 66 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:09,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:09,620 INFO L93 Difference]: Finished difference Result 69 states and 123 transitions. [2022-02-21 00:02:09,620 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 123 transitions. [2022-02-21 00:02:09,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:09,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:09,621 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 66 states have (on average 1.8484848484848484) internal successors, (122), 66 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 69 states. [2022-02-21 00:02:09,621 INFO L87 Difference]: Start difference. First operand has 67 states, 66 states have (on average 1.8484848484848484) internal successors, (122), 66 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 69 states. [2022-02-21 00:02:09,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:09,623 INFO L93 Difference]: Finished difference Result 69 states and 123 transitions. [2022-02-21 00:02:09,623 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 123 transitions. [2022-02-21 00:02:09,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:09,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:09,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:09,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:09,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.8484848484848484) internal successors, (122), 66 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:09,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 122 transitions. [2022-02-21 00:02:09,626 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 122 transitions. Word has length 17 [2022-02-21 00:02:09,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:09,626 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 122 transitions. [2022-02-21 00:02:09,626 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:09,626 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 122 transitions. [2022-02-21 00:02:09,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-21 00:02:09,627 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:09,627 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:09,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 00:02:09,627 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:09,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:09,628 INFO L85 PathProgramCache]: Analyzing trace with hash 459073515, now seen corresponding path program 1 times [2022-02-21 00:02:09,628 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:09,628 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831012092] [2022-02-21 00:02:09,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:09,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:09,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {895#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(16, 2);call #Ultimate.allocInit(12, 3); {895#true} is VALID [2022-02-21 00:02:09,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {895#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_#t~nondet14#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_~p10~0#1, main_~lk10~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;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; {895#true} is VALID [2022-02-21 00:02:09,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {895#true} assume !false;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {895#true} is VALID [2022-02-21 00:02:09,669 INFO L290 TraceCheckUtils]: 3: Hoare triple {895#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;main_~lk10~0#1 := 0; {895#true} is VALID [2022-02-21 00:02:09,672 INFO L290 TraceCheckUtils]: 4: Hoare triple {895#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {897#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:09,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {897#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {897#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:09,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {897#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p3~0#1); {897#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:09,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {897#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {897#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:09,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {897#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {897#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:09,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {897#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {897#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:09,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {897#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {897#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:09,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {897#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {897#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:09,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {897#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {897#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:09,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {897#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {897#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:09,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {897#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p1~0#1); {896#false} is VALID [2022-02-21 00:02:09,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {896#false} assume 0 != main_~p2~0#1; {896#false} is VALID [2022-02-21 00:02:09,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {896#false} assume 1 != main_~lk2~0#1; {896#false} is VALID [2022-02-21 00:02:09,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {896#false} assume !false; {896#false} is VALID [2022-02-21 00:02:09,682 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:09,682 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:09,683 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831012092] [2022-02-21 00:02:09,683 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831012092] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:09,683 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:09,683 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:09,683 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456973726] [2022-02-21 00:02:09,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:09,684 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:09,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:09,685 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:09,695 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:09,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:09,695 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:09,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:09,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:09,696 INFO L87 Difference]: Start difference. First operand 67 states and 122 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:09,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:09,758 INFO L93 Difference]: Finished difference Result 72 states and 125 transitions. [2022-02-21 00:02:09,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:09,758 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:09,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:09,759 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:09,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2022-02-21 00:02:09,760 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:09,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2022-02-21 00:02:09,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 124 transitions. [2022-02-21 00:02:09,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:09,840 INFO L225 Difference]: With dead ends: 72 [2022-02-21 00:02:09,840 INFO L226 Difference]: Without dead ends: 72 [2022-02-21 00:02:09,840 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:09,841 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 50 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 160 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:09,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 160 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:09,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-02-21 00:02:09,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2022-02-21 00:02:09,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:09,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 70 states, 69 states have (on average 1.7971014492753623) internal successors, (124), 69 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:09,845 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 70 states, 69 states have (on average 1.7971014492753623) internal successors, (124), 69 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:09,845 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 70 states, 69 states have (on average 1.7971014492753623) internal successors, (124), 69 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:09,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:09,846 INFO L93 Difference]: Finished difference Result 72 states and 125 transitions. [2022-02-21 00:02:09,847 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 125 transitions. [2022-02-21 00:02:09,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:09,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:09,847 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 69 states have (on average 1.7971014492753623) internal successors, (124), 69 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 72 states. [2022-02-21 00:02:09,848 INFO L87 Difference]: Start difference. First operand has 70 states, 69 states have (on average 1.7971014492753623) internal successors, (124), 69 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 72 states. [2022-02-21 00:02:09,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:09,849 INFO L93 Difference]: Finished difference Result 72 states and 125 transitions. [2022-02-21 00:02:09,849 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 125 transitions. [2022-02-21 00:02:09,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:09,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:09,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:09,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:09,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.7971014492753623) internal successors, (124), 69 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:09,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 124 transitions. [2022-02-21 00:02:09,852 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 124 transitions. Word has length 18 [2022-02-21 00:02:09,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:09,852 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 124 transitions. [2022-02-21 00:02:09,852 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:09,852 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 124 transitions. [2022-02-21 00:02:09,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-21 00:02:09,853 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:09,853 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:09,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 00:02:09,854 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:09,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:09,854 INFO L85 PathProgramCache]: Analyzing trace with hash -552043735, now seen corresponding path program 1 times [2022-02-21 00:02:09,854 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:09,854 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065446435] [2022-02-21 00:02:09,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:09,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:09,905 INFO L290 TraceCheckUtils]: 0: Hoare triple {1186#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(16, 2);call #Ultimate.allocInit(12, 3); {1186#true} is VALID [2022-02-21 00:02:09,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {1186#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_#t~nondet14#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_~p10~0#1, main_~lk10~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;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; {1186#true} is VALID [2022-02-21 00:02:09,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {1186#true} assume !false;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {1186#true} is VALID [2022-02-21 00:02:09,906 INFO L290 TraceCheckUtils]: 3: Hoare triple {1186#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;main_~lk10~0#1 := 0; {1186#true} is VALID [2022-02-21 00:02:09,906 INFO L290 TraceCheckUtils]: 4: Hoare triple {1186#true} assume !(0 != main_~p1~0#1); {1186#true} is VALID [2022-02-21 00:02:09,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {1186#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {1188#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:09,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {1188#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p3~0#1); {1188#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:09,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {1188#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1188#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:09,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {1188#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1188#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:09,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {1188#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1188#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:09,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {1188#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {1188#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:09,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {1188#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {1188#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:09,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {1188#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {1188#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:09,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {1188#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {1188#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:09,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {1188#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p1~0#1); {1188#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:09,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {1188#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p2~0#1; {1188#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:09,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {1188#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 1 != main_~lk2~0#1; {1187#false} is VALID [2022-02-21 00:02:09,910 INFO L290 TraceCheckUtils]: 17: Hoare triple {1187#false} assume !false; {1187#false} is VALID [2022-02-21 00:02:09,910 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:09,910 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:09,910 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065446435] [2022-02-21 00:02:09,911 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065446435] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:09,911 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:09,911 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:09,911 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071471773] [2022-02-21 00:02:09,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:09,911 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:09,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:09,911 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:09,921 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:09,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:09,922 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:09,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:09,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:09,922 INFO L87 Difference]: Start difference. First operand 70 states and 124 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:09,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:09,977 INFO L93 Difference]: Finished difference Result 131 states and 234 transitions. [2022-02-21 00:02:09,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:09,977 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:09,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:09,978 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:09,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2022-02-21 00:02:09,979 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:09,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2022-02-21 00:02:09,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 122 transitions. [2022-02-21 00:02:10,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:10,069 INFO L225 Difference]: With dead ends: 131 [2022-02-21 00:02:10,069 INFO L226 Difference]: Without dead ends: 131 [2022-02-21 00:02:10,069 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:10,070 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 45 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 125 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:10,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 125 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:10,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-02-21 00:02:10,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 93. [2022-02-21 00:02:10,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:10,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 93 states, 92 states have (on average 1.7934782608695652) internal successors, (165), 92 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:10,083 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 93 states, 92 states have (on average 1.7934782608695652) internal successors, (165), 92 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:10,083 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 93 states, 92 states have (on average 1.7934782608695652) internal successors, (165), 92 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:10,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:10,085 INFO L93 Difference]: Finished difference Result 131 states and 234 transitions. [2022-02-21 00:02:10,086 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 234 transitions. [2022-02-21 00:02:10,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:10,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:10,087 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 92 states have (on average 1.7934782608695652) internal successors, (165), 92 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 131 states. [2022-02-21 00:02:10,087 INFO L87 Difference]: Start difference. First operand has 93 states, 92 states have (on average 1.7934782608695652) internal successors, (165), 92 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 131 states. [2022-02-21 00:02:10,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:10,089 INFO L93 Difference]: Finished difference Result 131 states and 234 transitions. [2022-02-21 00:02:10,090 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 234 transitions. [2022-02-21 00:02:10,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:10,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:10,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:10,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:10,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.7934782608695652) internal successors, (165), 92 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:10,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 165 transitions. [2022-02-21 00:02:10,092 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 165 transitions. Word has length 18 [2022-02-21 00:02:10,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:10,092 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 165 transitions. [2022-02-21 00:02:10,092 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:10,093 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 165 transitions. [2022-02-21 00:02:10,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-21 00:02:10,093 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:10,093 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:10,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-21 00:02:10,094 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:10,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:10,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1138849749, now seen corresponding path program 1 times [2022-02-21 00:02:10,095 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:10,095 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091418967] [2022-02-21 00:02:10,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:10,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:10,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {1677#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(16, 2);call #Ultimate.allocInit(12, 3); {1677#true} is VALID [2022-02-21 00:02:10,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {1677#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_#t~nondet14#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_~p10~0#1, main_~lk10~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;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; {1677#true} is VALID [2022-02-21 00:02:10,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {1677#true} assume !false;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {1677#true} is VALID [2022-02-21 00:02:10,152 INFO L290 TraceCheckUtils]: 3: Hoare triple {1677#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;main_~lk10~0#1 := 0; {1677#true} is VALID [2022-02-21 00:02:10,153 INFO L290 TraceCheckUtils]: 4: Hoare triple {1677#true} assume !(0 != main_~p1~0#1); {1677#true} is VALID [2022-02-21 00:02:10,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {1677#true} assume !(0 != main_~p2~0#1); {1679#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:10,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {1679#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p3~0#1); {1679#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:10,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {1679#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1679#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:10,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {1679#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1679#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:10,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {1679#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1679#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:10,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {1679#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {1679#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:10,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {1679#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {1679#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:10,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {1679#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {1679#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:10,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {1679#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {1679#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:10,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {1679#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p1~0#1); {1679#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:10,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {1679#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p2~0#1; {1678#false} is VALID [2022-02-21 00:02:10,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {1678#false} assume 1 != main_~lk2~0#1; {1678#false} is VALID [2022-02-21 00:02:10,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {1678#false} assume !false; {1678#false} is VALID [2022-02-21 00:02:10,157 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:10,157 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:10,157 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091418967] [2022-02-21 00:02:10,157 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091418967] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:10,157 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:10,157 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:10,158 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419391241] [2022-02-21 00:02:10,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:10,158 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:10,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:10,158 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:10,167 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:10,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:10,168 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:10,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:10,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:10,169 INFO L87 Difference]: Start difference. First operand 93 states and 165 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:10,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:10,224 INFO L93 Difference]: Finished difference Result 133 states and 232 transitions. [2022-02-21 00:02:10,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:10,224 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:10,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:10,226 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:10,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2022-02-21 00:02:10,227 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:10,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2022-02-21 00:02:10,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 123 transitions. [2022-02-21 00:02:10,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:10,302 INFO L225 Difference]: With dead ends: 133 [2022-02-21 00:02:10,302 INFO L226 Difference]: Without dead ends: 133 [2022-02-21 00:02:10,303 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:10,303 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 47 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 144 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:10,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 144 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:10,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-02-21 00:02:10,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2022-02-21 00:02:10,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:10,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 131 states, 130 states have (on average 1.7769230769230768) internal successors, (231), 130 states have internal predecessors, (231), 0 states have call successors, (0), 0 states 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:10,307 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 131 states, 130 states have (on average 1.7769230769230768) internal successors, (231), 130 states have internal predecessors, (231), 0 states have call successors, (0), 0 states 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:10,308 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 131 states, 130 states have (on average 1.7769230769230768) internal successors, (231), 130 states have internal predecessors, (231), 0 states have call successors, (0), 0 states 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:10,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:10,310 INFO L93 Difference]: Finished difference Result 133 states and 232 transitions. [2022-02-21 00:02:10,310 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 232 transitions. [2022-02-21 00:02:10,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:10,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:10,311 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 130 states have (on average 1.7769230769230768) internal successors, (231), 130 states have internal predecessors, (231), 0 states have call successors, (0), 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 133 states. [2022-02-21 00:02:10,311 INFO L87 Difference]: Start difference. First operand has 131 states, 130 states have (on average 1.7769230769230768) internal successors, (231), 130 states have internal predecessors, (231), 0 states have call successors, (0), 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 133 states. [2022-02-21 00:02:10,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:10,314 INFO L93 Difference]: Finished difference Result 133 states and 232 transitions. [2022-02-21 00:02:10,314 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 232 transitions. [2022-02-21 00:02:10,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:10,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:10,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:10,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:10,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.7769230769230768) internal successors, (231), 130 states have internal predecessors, (231), 0 states have call successors, (0), 0 states 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:10,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 231 transitions. [2022-02-21 00:02:10,318 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 231 transitions. Word has length 18 [2022-02-21 00:02:10,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:10,318 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 231 transitions. [2022-02-21 00:02:10,318 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:10,318 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 231 transitions. [2022-02-21 00:02:10,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-21 00:02:10,319 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:10,319 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:10,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-21 00:02:10,319 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:10,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:10,320 INFO L85 PathProgramCache]: Analyzing trace with hash 66727088, now seen corresponding path program 1 times [2022-02-21 00:02:10,320 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:10,320 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643027007] [2022-02-21 00:02:10,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:10,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:10,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {2212#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(16, 2);call #Ultimate.allocInit(12, 3); {2212#true} is VALID [2022-02-21 00:02:10,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {2212#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_#t~nondet14#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_~p10~0#1, main_~lk10~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;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; {2212#true} is VALID [2022-02-21 00:02:10,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {2212#true} assume !false;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {2212#true} is VALID [2022-02-21 00:02:10,345 INFO L290 TraceCheckUtils]: 3: Hoare triple {2212#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;main_~lk10~0#1 := 0; {2212#true} is VALID [2022-02-21 00:02:10,345 INFO L290 TraceCheckUtils]: 4: Hoare triple {2212#true} assume !(0 != main_~p1~0#1); {2212#true} is VALID [2022-02-21 00:02:10,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {2212#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {2214#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:10,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {2214#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p3~0#1); {2214#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:10,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {2214#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {2214#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:10,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {2214#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {2214#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:10,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {2214#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {2214#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:10,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {2214#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {2214#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:10,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {2214#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {2214#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:10,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {2214#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {2214#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:10,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {2214#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {2214#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:10,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {2214#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p1~0#1); {2214#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:10,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {2214#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p2~0#1); {2213#false} is VALID [2022-02-21 00:02:10,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {2213#false} assume 0 != main_~p3~0#1; {2213#false} is VALID [2022-02-21 00:02:10,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {2213#false} assume 1 != main_~lk3~0#1; {2213#false} is VALID [2022-02-21 00:02:10,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {2213#false} assume !false; {2213#false} is VALID [2022-02-21 00:02:10,350 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:10,350 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:10,350 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643027007] [2022-02-21 00:02:10,350 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643027007] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:10,350 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:10,350 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:10,350 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120927080] [2022-02-21 00:02:10,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:10,351 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:10,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:10,351 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:10,360 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:10,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:10,361 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:10,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:10,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:10,362 INFO L87 Difference]: Start difference. First operand 131 states and 231 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:10,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:10,416 INFO L93 Difference]: Finished difference Result 135 states and 232 transitions. [2022-02-21 00:02:10,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:10,416 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:10,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:10,417 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:10,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2022-02-21 00:02:10,418 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:10,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2022-02-21 00:02:10,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 122 transitions. [2022-02-21 00:02:10,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:10,497 INFO L225 Difference]: With dead ends: 135 [2022-02-21 00:02:10,497 INFO L226 Difference]: Without dead ends: 135 [2022-02-21 00:02:10,497 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:10,497 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 49 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 156 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:10,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 156 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:10,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-02-21 00:02:10,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2022-02-21 00:02:10,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:10,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 133 states, 132 states have (on average 1.75) internal successors, (231), 132 states have internal predecessors, (231), 0 states have call successors, (0), 0 states 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:10,501 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 133 states, 132 states have (on average 1.75) internal successors, (231), 132 states have internal predecessors, (231), 0 states have call successors, (0), 0 states 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:10,501 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 133 states, 132 states have (on average 1.75) internal successors, (231), 132 states have internal predecessors, (231), 0 states have call successors, (0), 0 states 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:10,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:10,504 INFO L93 Difference]: Finished difference Result 135 states and 232 transitions. [2022-02-21 00:02:10,504 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 232 transitions. [2022-02-21 00:02:10,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:10,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:10,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 132 states have (on average 1.75) internal successors, (231), 132 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 135 states. [2022-02-21 00:02:10,521 INFO L87 Difference]: Start difference. First operand has 133 states, 132 states have (on average 1.75) internal successors, (231), 132 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 135 states. [2022-02-21 00:02:10,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:10,524 INFO L93 Difference]: Finished difference Result 135 states and 232 transitions. [2022-02-21 00:02:10,524 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 232 transitions. [2022-02-21 00:02:10,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:10,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:10,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:10,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:10,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.75) internal successors, (231), 132 states have internal predecessors, (231), 0 states have call successors, (0), 0 states 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:10,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 231 transitions. [2022-02-21 00:02:10,528 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 231 transitions. Word has length 19 [2022-02-21 00:02:10,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:10,528 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 231 transitions. [2022-02-21 00:02:10,529 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:10,529 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 231 transitions. [2022-02-21 00:02:10,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-21 00:02:10,529 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:10,529 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:10,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-21 00:02:10,530 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:10,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:10,530 INFO L85 PathProgramCache]: Analyzing trace with hash -944390162, now seen corresponding path program 1 times [2022-02-21 00:02:10,530 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:10,531 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580588276] [2022-02-21 00:02:10,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:10,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:10,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {2755#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(16, 2);call #Ultimate.allocInit(12, 3); {2755#true} is VALID [2022-02-21 00:02:10,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {2755#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_#t~nondet14#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_~p10~0#1, main_~lk10~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;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; {2755#true} is VALID [2022-02-21 00:02:10,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {2755#true} assume !false;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {2755#true} is VALID [2022-02-21 00:02:10,564 INFO L290 TraceCheckUtils]: 3: Hoare triple {2755#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;main_~lk10~0#1 := 0; {2755#true} is VALID [2022-02-21 00:02:10,564 INFO L290 TraceCheckUtils]: 4: Hoare triple {2755#true} assume !(0 != main_~p1~0#1); {2755#true} is VALID [2022-02-21 00:02:10,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {2755#true} assume !(0 != main_~p2~0#1); {2755#true} is VALID [2022-02-21 00:02:10,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {2755#true} assume !(0 != main_~p3~0#1); {2757#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:10,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {2757#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {2757#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:10,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {2757#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {2757#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:10,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {2757#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {2757#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:10,566 INFO L290 TraceCheckUtils]: 10: Hoare triple {2757#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {2757#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:10,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {2757#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {2757#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:10,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {2757#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {2757#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:10,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {2757#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {2757#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:10,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {2757#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p1~0#1); {2757#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:10,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {2757#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p2~0#1); {2757#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:10,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {2757#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p3~0#1; {2756#false} is VALID [2022-02-21 00:02:10,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {2756#false} assume 1 != main_~lk3~0#1; {2756#false} is VALID [2022-02-21 00:02:10,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {2756#false} assume !false; {2756#false} is VALID [2022-02-21 00:02:10,569 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:10,569 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:10,569 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580588276] [2022-02-21 00:02:10,569 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580588276] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:10,569 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:10,570 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:10,570 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522119538] [2022-02-21 00:02:10,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:10,570 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:10,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:10,571 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:10,581 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:10,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:10,581 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:10,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:10,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:10,582 INFO L87 Difference]: Start difference. First operand 133 states and 231 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:10,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:10,652 INFO L93 Difference]: Finished difference Result 255 states and 436 transitions. [2022-02-21 00:02:10,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:10,653 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:10,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:10,653 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:10,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2022-02-21 00:02:10,654 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:10,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2022-02-21 00:02:10,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 122 transitions. [2022-02-21 00:02:10,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:10,732 INFO L225 Difference]: With dead ends: 255 [2022-02-21 00:02:10,732 INFO L226 Difference]: Without dead ends: 255 [2022-02-21 00:02:10,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:02:10,733 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 47 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 127 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:10,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 127 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:10,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-02-21 00:02:10,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253. [2022-02-21 00:02:10,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:10,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 255 states. Second operand has 253 states, 252 states have (on average 1.7261904761904763) internal successors, (435), 252 states have internal predecessors, (435), 0 states have call successors, (0), 0 states 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:10,739 INFO L74 IsIncluded]: Start isIncluded. First operand 255 states. Second operand has 253 states, 252 states have (on average 1.7261904761904763) internal successors, (435), 252 states have internal predecessors, (435), 0 states have call successors, (0), 0 states 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:10,740 INFO L87 Difference]: Start difference. First operand 255 states. Second operand has 253 states, 252 states have (on average 1.7261904761904763) internal successors, (435), 252 states have internal predecessors, (435), 0 states have call successors, (0), 0 states 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:10,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:10,745 INFO L93 Difference]: Finished difference Result 255 states and 436 transitions. [2022-02-21 00:02:10,745 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 436 transitions. [2022-02-21 00:02:10,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:10,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:10,746 INFO L74 IsIncluded]: Start isIncluded. First operand has 253 states, 252 states have (on average 1.7261904761904763) internal successors, (435), 252 states have internal predecessors, (435), 0 states have call successors, (0), 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 255 states. [2022-02-21 00:02:10,747 INFO L87 Difference]: Start difference. First operand has 253 states, 252 states have (on average 1.7261904761904763) internal successors, (435), 252 states have internal predecessors, (435), 0 states have call successors, (0), 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 255 states. [2022-02-21 00:02:10,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:10,752 INFO L93 Difference]: Finished difference Result 255 states and 436 transitions. [2022-02-21 00:02:10,752 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 436 transitions. [2022-02-21 00:02:10,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:10,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:10,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:10,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:10,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 1.7261904761904763) internal successors, (435), 252 states have internal predecessors, (435), 0 states have call successors, (0), 0 states 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:10,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 435 transitions. [2022-02-21 00:02:10,759 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 435 transitions. Word has length 19 [2022-02-21 00:02:10,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:10,759 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 435 transitions. [2022-02-21 00:02:10,760 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:10,760 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 435 transitions. [2022-02-21 00:02:10,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-21 00:02:10,760 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:10,760 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:10,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-21 00:02:10,761 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:10,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:10,761 INFO L85 PathProgramCache]: Analyzing trace with hash -357584148, now seen corresponding path program 1 times [2022-02-21 00:02:10,761 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:10,761 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681117847] [2022-02-21 00:02:10,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:10,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:10,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {3778#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(16, 2);call #Ultimate.allocInit(12, 3); {3778#true} is VALID [2022-02-21 00:02:10,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {3778#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_#t~nondet14#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_~p10~0#1, main_~lk10~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;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; {3778#true} is VALID [2022-02-21 00:02:10,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {3778#true} assume !false;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {3778#true} is VALID [2022-02-21 00:02:10,785 INFO L290 TraceCheckUtils]: 3: Hoare triple {3778#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;main_~lk10~0#1 := 0; {3778#true} is VALID [2022-02-21 00:02:10,785 INFO L290 TraceCheckUtils]: 4: Hoare triple {3778#true} assume !(0 != main_~p1~0#1); {3778#true} is VALID [2022-02-21 00:02:10,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {3778#true} assume !(0 != main_~p2~0#1); {3778#true} is VALID [2022-02-21 00:02:10,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {3778#true} assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; {3780#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:10,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {3780#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {3780#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:10,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {3780#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {3780#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:10,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {3780#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {3780#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:10,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {3780#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {3780#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:10,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {3780#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {3780#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:10,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {3780#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {3780#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:10,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {3780#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {3780#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:10,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {3780#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p1~0#1); {3780#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:10,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {3780#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p2~0#1); {3780#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:10,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {3780#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p3~0#1; {3780#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:10,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {3780#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 1 != main_~lk3~0#1; {3779#false} is VALID [2022-02-21 00:02:10,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {3779#false} assume !false; {3779#false} is VALID [2022-02-21 00:02:10,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:02:10,789 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:10,789 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681117847] [2022-02-21 00:02:10,790 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681117847] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:10,790 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:10,790 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:10,790 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776637102] [2022-02-21 00:02:10,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:10,790 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:10,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:10,791 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:10,805 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:10,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:10,805 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:10,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:10,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:10,805 INFO L87 Difference]: Start difference. First operand 253 states and 435 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:10,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:10,890 INFO L93 Difference]: Finished difference Result 319 states and 552 transitions. [2022-02-21 00:02:10,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:10,890 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:10,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:10,890 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:10,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2022-02-21 00:02:10,896 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:10,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2022-02-21 00:02:10,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 115 transitions. [2022-02-21 00:02:10,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:10,965 INFO L225 Difference]: With dead ends: 319 [2022-02-21 00:02:10,965 INFO L226 Difference]: Without dead ends: 319 [2022-02-21 00:02:10,966 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:10,966 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 42 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 170 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:10,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 170 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:10,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-02-21 00:02:10,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 253. [2022-02-21 00:02:10,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:10,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 319 states. Second operand has 253 states, 252 states have (on average 1.7103174603174602) internal successors, (431), 252 states have internal predecessors, (431), 0 states have call successors, (0), 0 states 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:10,972 INFO L74 IsIncluded]: Start isIncluded. First operand 319 states. Second operand has 253 states, 252 states have (on average 1.7103174603174602) internal successors, (431), 252 states have internal predecessors, (431), 0 states have call successors, (0), 0 states 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:10,972 INFO L87 Difference]: Start difference. First operand 319 states. Second operand has 253 states, 252 states have (on average 1.7103174603174602) internal successors, (431), 252 states have internal predecessors, (431), 0 states have call successors, (0), 0 states 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:10,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:10,978 INFO L93 Difference]: Finished difference Result 319 states and 552 transitions. [2022-02-21 00:02:10,978 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 552 transitions. [2022-02-21 00:02:10,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:10,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:10,979 INFO L74 IsIncluded]: Start isIncluded. First operand has 253 states, 252 states have (on average 1.7103174603174602) internal successors, (431), 252 states have internal predecessors, (431), 0 states have call successors, (0), 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 319 states. [2022-02-21 00:02:10,980 INFO L87 Difference]: Start difference. First operand has 253 states, 252 states have (on average 1.7103174603174602) internal successors, (431), 252 states have internal predecessors, (431), 0 states have call successors, (0), 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 319 states. [2022-02-21 00:02:10,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:10,986 INFO L93 Difference]: Finished difference Result 319 states and 552 transitions. [2022-02-21 00:02:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 552 transitions. [2022-02-21 00:02:10,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:10,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:10,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:10,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:10,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 1.7103174603174602) internal successors, (431), 252 states have internal predecessors, (431), 0 states have call successors, (0), 0 states 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:10,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 431 transitions. [2022-02-21 00:02:10,991 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 431 transitions. Word has length 19 [2022-02-21 00:02:10,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:10,991 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 431 transitions. [2022-02-21 00:02:10,991 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:10,992 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 431 transitions. [2022-02-21 00:02:10,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-21 00:02:10,992 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:10,992 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:10,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-21 00:02:10,992 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:10,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:10,993 INFO L85 PathProgramCache]: Analyzing trace with hash 788890080, now seen corresponding path program 1 times [2022-02-21 00:02:10,993 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:10,993 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780818093] [2022-02-21 00:02:10,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:10,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:11,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {4993#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(16, 2);call #Ultimate.allocInit(12, 3); {4993#true} is VALID [2022-02-21 00:02:11,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {4993#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_#t~nondet14#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_~p10~0#1, main_~lk10~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;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; {4993#true} is VALID [2022-02-21 00:02:11,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {4993#true} assume !false;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {4993#true} is VALID [2022-02-21 00:02:11,016 INFO L290 TraceCheckUtils]: 3: Hoare triple {4993#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;main_~lk10~0#1 := 0; {4993#true} is VALID [2022-02-21 00:02:11,017 INFO L290 TraceCheckUtils]: 4: Hoare triple {4993#true} assume !(0 != main_~p1~0#1); {4993#true} is VALID [2022-02-21 00:02:11,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {4993#true} assume !(0 != main_~p2~0#1); {4993#true} is VALID [2022-02-21 00:02:11,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {4993#true} assume !(0 != main_~p3~0#1); {4993#true} is VALID [2022-02-21 00:02:11,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {4993#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {4995#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:11,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {4995#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {4995#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:11,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {4995#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {4995#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:11,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {4995#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {4995#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:11,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {4995#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {4995#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:11,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {4995#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {4995#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:11,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {4995#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {4995#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:11,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {4995#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p1~0#1); {4995#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:11,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {4995#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p2~0#1); {4995#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:11,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {4995#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p3~0#1); {4995#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:11,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {4995#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p4~0#1; {4995#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:11,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {4995#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 1 != main_~lk4~0#1; {4994#false} is VALID [2022-02-21 00:02:11,021 INFO L290 TraceCheckUtils]: 19: Hoare triple {4994#false} assume !false; {4994#false} is VALID [2022-02-21 00:02:11,021 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:11,021 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:11,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780818093] [2022-02-21 00:02:11,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780818093] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:11,022 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:11,022 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:11,022 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327679870] [2022-02-21 00:02:11,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:11,039 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:11,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:11,039 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:11,049 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:11,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:11,050 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:11,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:11,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:11,051 INFO L87 Difference]: Start difference. First operand 253 states and 431 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:11,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:11,102 INFO L93 Difference]: Finished difference Result 467 states and 800 transitions. [2022-02-21 00:02:11,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:11,102 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:11,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:11,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:11,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2022-02-21 00:02:11,104 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:11,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2022-02-21 00:02:11,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 114 transitions. [2022-02-21 00:02:11,167 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:11,175 INFO L225 Difference]: With dead ends: 467 [2022-02-21 00:02:11,175 INFO L226 Difference]: Without dead ends: 467 [2022-02-21 00:02:11,175 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:11,176 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 39 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 121 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:11,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 121 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:11,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2022-02-21 00:02:11,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 353. [2022-02-21 00:02:11,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:11,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 467 states. Second operand has 353 states, 352 states have (on average 1.6789772727272727) internal successors, (591), 352 states have internal predecessors, (591), 0 states have call successors, (0), 0 states 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:11,182 INFO L74 IsIncluded]: Start isIncluded. First operand 467 states. Second operand has 353 states, 352 states have (on average 1.6789772727272727) internal successors, (591), 352 states have internal predecessors, (591), 0 states have call successors, (0), 0 states 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:11,182 INFO L87 Difference]: Start difference. First operand 467 states. Second operand has 353 states, 352 states have (on average 1.6789772727272727) internal successors, (591), 352 states have internal predecessors, (591), 0 states have call successors, (0), 0 states 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:11,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:11,192 INFO L93 Difference]: Finished difference Result 467 states and 800 transitions. [2022-02-21 00:02:11,192 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 800 transitions. [2022-02-21 00:02:11,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:11,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:11,193 INFO L74 IsIncluded]: Start isIncluded. First operand has 353 states, 352 states have (on average 1.6789772727272727) internal successors, (591), 352 states have internal predecessors, (591), 0 states have call successors, (0), 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 467 states. [2022-02-21 00:02:11,194 INFO L87 Difference]: Start difference. First operand has 353 states, 352 states have (on average 1.6789772727272727) internal successors, (591), 352 states have internal predecessors, (591), 0 states have call successors, (0), 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 467 states. [2022-02-21 00:02:11,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:11,204 INFO L93 Difference]: Finished difference Result 467 states and 800 transitions. [2022-02-21 00:02:11,204 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 800 transitions. [2022-02-21 00:02:11,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:11,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:11,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:11,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:11,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 1.6789772727272727) internal successors, (591), 352 states have internal predecessors, (591), 0 states have call successors, (0), 0 states 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:11,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 591 transitions. [2022-02-21 00:02:11,211 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 591 transitions. Word has length 20 [2022-02-21 00:02:11,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:11,211 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 591 transitions. [2022-02-21 00:02:11,211 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:11,212 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 591 transitions. [2022-02-21 00:02:11,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-21 00:02:11,212 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:11,212 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:11,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-21 00:02:11,213 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:11,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:11,213 INFO L85 PathProgramCache]: Analyzing trace with hash 202084066, now seen corresponding path program 1 times [2022-02-21 00:02:11,213 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:11,213 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036968496] [2022-02-21 00:02:11,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:11,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:11,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {6752#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(16, 2);call #Ultimate.allocInit(12, 3); {6752#true} is VALID [2022-02-21 00:02:11,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {6752#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_#t~nondet14#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_~p10~0#1, main_~lk10~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;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; {6752#true} is VALID [2022-02-21 00:02:11,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {6752#true} assume !false;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {6752#true} is VALID [2022-02-21 00:02:11,252 INFO L290 TraceCheckUtils]: 3: Hoare triple {6752#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;main_~lk10~0#1 := 0; {6752#true} is VALID [2022-02-21 00:02:11,252 INFO L290 TraceCheckUtils]: 4: Hoare triple {6752#true} assume !(0 != main_~p1~0#1); {6752#true} is VALID [2022-02-21 00:02:11,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {6752#true} assume !(0 != main_~p2~0#1); {6752#true} is VALID [2022-02-21 00:02:11,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {6752#true} assume !(0 != main_~p3~0#1); {6752#true} is VALID [2022-02-21 00:02:11,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {6752#true} assume !(0 != main_~p4~0#1); {6754#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:11,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {6754#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {6754#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:11,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {6754#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {6754#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:11,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {6754#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {6754#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:11,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {6754#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {6754#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:11,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {6754#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {6754#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:11,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {6754#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {6754#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:11,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {6754#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p1~0#1); {6754#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:11,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {6754#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p2~0#1); {6754#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:11,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {6754#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p3~0#1); {6754#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:11,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {6754#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p4~0#1; {6753#false} is VALID [2022-02-21 00:02:11,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {6753#false} assume 1 != main_~lk4~0#1; {6753#false} is VALID [2022-02-21 00:02:11,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {6753#false} assume !false; {6753#false} is VALID [2022-02-21 00:02:11,261 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:11,261 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:11,261 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036968496] [2022-02-21 00:02:11,261 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036968496] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:11,262 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:11,262 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:11,262 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907854064] [2022-02-21 00:02:11,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:11,262 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:11,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:11,263 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:11,272 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:11,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:11,272 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:11,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:11,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:11,273 INFO L87 Difference]: Start difference. First operand 353 states and 591 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:11,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:11,330 INFO L93 Difference]: Finished difference Result 491 states and 812 transitions. [2022-02-21 00:02:11,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:11,333 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:11,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:11,333 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:11,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2022-02-21 00:02:11,335 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:11,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2022-02-21 00:02:11,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 119 transitions. [2022-02-21 00:02:11,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:11,397 INFO L225 Difference]: With dead ends: 491 [2022-02-21 00:02:11,397 INFO L226 Difference]: Without dead ends: 491 [2022-02-21 00:02:11,397 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:11,398 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 45 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 146 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:11,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 146 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:11,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-02-21 00:02:11,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 489. [2022-02-21 00:02:11,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:11,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 491 states. Second operand has 489 states, 488 states have (on average 1.6618852459016393) internal successors, (811), 488 states have internal predecessors, (811), 0 states have call successors, (0), 0 states 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:11,407 INFO L74 IsIncluded]: Start isIncluded. First operand 491 states. Second operand has 489 states, 488 states have (on average 1.6618852459016393) internal successors, (811), 488 states have internal predecessors, (811), 0 states have call successors, (0), 0 states 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:11,408 INFO L87 Difference]: Start difference. First operand 491 states. Second operand has 489 states, 488 states have (on average 1.6618852459016393) internal successors, (811), 488 states have internal predecessors, (811), 0 states have call successors, (0), 0 states 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:11,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:11,418 INFO L93 Difference]: Finished difference Result 491 states and 812 transitions. [2022-02-21 00:02:11,418 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 812 transitions. [2022-02-21 00:02:11,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:11,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:11,420 INFO L74 IsIncluded]: Start isIncluded. First operand has 489 states, 488 states have (on average 1.6618852459016393) internal successors, (811), 488 states have internal predecessors, (811), 0 states have call successors, (0), 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 491 states. [2022-02-21 00:02:11,420 INFO L87 Difference]: Start difference. First operand has 489 states, 488 states have (on average 1.6618852459016393) internal successors, (811), 488 states have internal predecessors, (811), 0 states have call successors, (0), 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 491 states. [2022-02-21 00:02:11,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:11,431 INFO L93 Difference]: Finished difference Result 491 states and 812 transitions. [2022-02-21 00:02:11,431 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 812 transitions. [2022-02-21 00:02:11,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:11,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:11,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:11,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:11,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 488 states have (on average 1.6618852459016393) internal successors, (811), 488 states have internal predecessors, (811), 0 states have call successors, (0), 0 states 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:11,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 811 transitions. [2022-02-21 00:02:11,442 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 811 transitions. Word has length 20 [2022-02-21 00:02:11,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:11,442 INFO L470 AbstractCegarLoop]: Abstraction has 489 states and 811 transitions. [2022-02-21 00:02:11,442 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:11,442 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 811 transitions. [2022-02-21 00:02:11,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-21 00:02:11,444 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:11,444 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:11,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-21 00:02:11,444 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:11,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:11,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1313996925, now seen corresponding path program 1 times [2022-02-21 00:02:11,445 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:11,445 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357467057] [2022-02-21 00:02:11,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:11,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:11,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {8719#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(16, 2);call #Ultimate.allocInit(12, 3); {8719#true} is VALID [2022-02-21 00:02:11,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {8719#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_#t~nondet14#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_~p10~0#1, main_~lk10~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;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; {8719#true} is VALID [2022-02-21 00:02:11,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {8719#true} assume !false;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {8719#true} is VALID [2022-02-21 00:02:11,485 INFO L290 TraceCheckUtils]: 3: Hoare triple {8719#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;main_~lk10~0#1 := 0; {8719#true} is VALID [2022-02-21 00:02:11,485 INFO L290 TraceCheckUtils]: 4: Hoare triple {8719#true} assume !(0 != main_~p1~0#1); {8719#true} is VALID [2022-02-21 00:02:11,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {8719#true} assume !(0 != main_~p2~0#1); {8719#true} is VALID [2022-02-21 00:02:11,485 INFO L290 TraceCheckUtils]: 6: Hoare triple {8719#true} assume !(0 != main_~p3~0#1); {8719#true} is VALID [2022-02-21 00:02:11,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {8719#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {8721#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:11,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {8721#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {8721#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:11,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {8721#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {8721#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:11,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {8721#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {8721#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:11,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {8721#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {8721#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:11,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {8721#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {8721#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:11,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {8721#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {8721#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:11,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {8721#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p1~0#1); {8721#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:11,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {8721#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p2~0#1); {8721#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:11,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {8721#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p3~0#1); {8721#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:11,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {8721#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p4~0#1); {8720#false} is VALID [2022-02-21 00:02:11,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {8720#false} assume 0 != main_~p5~0#1; {8720#false} is VALID [2022-02-21 00:02:11,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {8720#false} assume 1 != main_~lk5~0#1; {8720#false} is VALID [2022-02-21 00:02:11,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {8720#false} assume !false; {8720#false} is VALID [2022-02-21 00:02:11,492 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:11,492 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:11,492 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357467057] [2022-02-21 00:02:11,492 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357467057] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:11,492 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:11,492 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:11,492 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567231817] [2022-02-21 00:02:11,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:11,493 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:11,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:11,493 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:11,503 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:11,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:11,504 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:11,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:11,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:11,504 INFO L87 Difference]: Start difference. First operand 489 states and 811 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:11,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:11,589 INFO L93 Difference]: Finished difference Result 503 states and 820 transitions. [2022-02-21 00:02:11,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:11,589 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:11,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:11,589 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:11,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2022-02-21 00:02:11,590 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:11,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2022-02-21 00:02:11,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 118 transitions. [2022-02-21 00:02:11,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:11,658 INFO L225 Difference]: With dead ends: 503 [2022-02-21 00:02:11,658 INFO L226 Difference]: Without dead ends: 503 [2022-02-21 00:02:11,658 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:11,659 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 47 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 148 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:11,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 148 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:11,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2022-02-21 00:02:11,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 501. [2022-02-21 00:02:11,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:11,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 503 states. Second operand has 501 states, 500 states have (on average 1.638) internal successors, (819), 500 states have internal predecessors, (819), 0 states have call successors, (0), 0 states 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:11,667 INFO L74 IsIncluded]: Start isIncluded. First operand 503 states. Second operand has 501 states, 500 states have (on average 1.638) internal successors, (819), 500 states have internal predecessors, (819), 0 states have call successors, (0), 0 states 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:11,668 INFO L87 Difference]: Start difference. First operand 503 states. Second operand has 501 states, 500 states have (on average 1.638) internal successors, (819), 500 states have internal predecessors, (819), 0 states have call successors, (0), 0 states 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:11,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:11,678 INFO L93 Difference]: Finished difference Result 503 states and 820 transitions. [2022-02-21 00:02:11,678 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 820 transitions. [2022-02-21 00:02:11,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:11,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:11,680 INFO L74 IsIncluded]: Start isIncluded. First operand has 501 states, 500 states have (on average 1.638) internal successors, (819), 500 states have internal predecessors, (819), 0 states have call successors, (0), 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 503 states. [2022-02-21 00:02:11,680 INFO L87 Difference]: Start difference. First operand has 501 states, 500 states have (on average 1.638) internal successors, (819), 500 states have internal predecessors, (819), 0 states have call successors, (0), 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 503 states. [2022-02-21 00:02:11,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:11,690 INFO L93 Difference]: Finished difference Result 503 states and 820 transitions. [2022-02-21 00:02:11,691 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 820 transitions. [2022-02-21 00:02:11,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:11,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:11,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:11,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:11,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 1.638) internal successors, (819), 500 states have internal predecessors, (819), 0 states have call successors, (0), 0 states 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:11,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 819 transitions. [2022-02-21 00:02:11,702 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 819 transitions. Word has length 21 [2022-02-21 00:02:11,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:11,702 INFO L470 AbstractCegarLoop]: Abstraction has 501 states and 819 transitions. [2022-02-21 00:02:11,703 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:11,703 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 819 transitions. [2022-02-21 00:02:11,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-21 00:02:11,704 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:11,704 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:11,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-21 00:02:11,705 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:11,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:11,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1969853121, now seen corresponding path program 1 times [2022-02-21 00:02:11,705 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:11,706 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539147996] [2022-02-21 00:02:11,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:11,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:11,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {10734#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(16, 2);call #Ultimate.allocInit(12, 3); {10734#true} is VALID [2022-02-21 00:02:11,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {10734#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_#t~nondet14#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_~p10~0#1, main_~lk10~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;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; {10734#true} is VALID [2022-02-21 00:02:11,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {10734#true} assume !false;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {10734#true} is VALID [2022-02-21 00:02:11,754 INFO L290 TraceCheckUtils]: 3: Hoare triple {10734#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;main_~lk10~0#1 := 0; {10734#true} is VALID [2022-02-21 00:02:11,754 INFO L290 TraceCheckUtils]: 4: Hoare triple {10734#true} assume !(0 != main_~p1~0#1); {10734#true} is VALID [2022-02-21 00:02:11,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {10734#true} assume !(0 != main_~p2~0#1); {10734#true} is VALID [2022-02-21 00:02:11,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {10734#true} assume !(0 != main_~p3~0#1); {10734#true} is VALID [2022-02-21 00:02:11,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {10734#true} assume !(0 != main_~p4~0#1); {10734#true} is VALID [2022-02-21 00:02:11,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {10734#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {10736#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:11,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {10736#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {10736#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:11,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {10736#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {10736#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:11,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {10736#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {10736#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:11,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {10736#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {10736#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:11,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {10736#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {10736#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:11,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {10736#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p1~0#1); {10736#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:11,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {10736#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p2~0#1); {10736#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:11,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {10736#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p3~0#1); {10736#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:11,757 INFO L290 TraceCheckUtils]: 17: Hoare triple {10736#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p4~0#1); {10736#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:11,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {10736#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p5~0#1; {10736#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:11,758 INFO L290 TraceCheckUtils]: 19: Hoare triple {10736#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 1 != main_~lk5~0#1; {10735#false} is VALID [2022-02-21 00:02:11,758 INFO L290 TraceCheckUtils]: 20: Hoare triple {10735#false} assume !false; {10735#false} is VALID [2022-02-21 00:02:11,758 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:11,758 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:11,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539147996] [2022-02-21 00:02:11,758 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539147996] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:11,758 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:11,758 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:11,758 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072608607] [2022-02-21 00:02:11,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:11,759 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:11,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:11,759 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:11,770 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:11,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:11,770 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:11,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:11,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:11,770 INFO L87 Difference]: Start difference. First operand 501 states and 819 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:11,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:11,835 INFO L93 Difference]: Finished difference Result 903 states and 1484 transitions. [2022-02-21 00:02:11,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:11,836 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:11,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:11,836 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:11,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-02-21 00:02:11,837 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:11,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-02-21 00:02:11,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2022-02-21 00:02:11,906 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:11,933 INFO L225 Difference]: With dead ends: 903 [2022-02-21 00:02:11,933 INFO L226 Difference]: Without dead ends: 903 [2022-02-21 00:02:11,934 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:11,934 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 36 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 119 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:11,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 119 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:11,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2022-02-21 00:02:11,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 709. [2022-02-21 00:02:11,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:11,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 903 states. Second operand has 709 states, 708 states have (on average 1.597457627118644) internal successors, (1131), 708 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states 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:11,949 INFO L74 IsIncluded]: Start isIncluded. First operand 903 states. Second operand has 709 states, 708 states have (on average 1.597457627118644) internal successors, (1131), 708 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states 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:11,950 INFO L87 Difference]: Start difference. First operand 903 states. Second operand has 709 states, 708 states have (on average 1.597457627118644) internal successors, (1131), 708 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states 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:11,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:11,980 INFO L93 Difference]: Finished difference Result 903 states and 1484 transitions. [2022-02-21 00:02:11,980 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1484 transitions. [2022-02-21 00:02:11,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:11,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:11,983 INFO L74 IsIncluded]: Start isIncluded. First operand has 709 states, 708 states have (on average 1.597457627118644) internal successors, (1131), 708 states have internal predecessors, (1131), 0 states have call successors, (0), 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 903 states. [2022-02-21 00:02:11,984 INFO L87 Difference]: Start difference. First operand has 709 states, 708 states have (on average 1.597457627118644) internal successors, (1131), 708 states have internal predecessors, (1131), 0 states have call successors, (0), 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 903 states. [2022-02-21 00:02:12,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:12,021 INFO L93 Difference]: Finished difference Result 903 states and 1484 transitions. [2022-02-21 00:02:12,021 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1484 transitions. [2022-02-21 00:02:12,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:12,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:12,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:12,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:12,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 708 states have (on average 1.597457627118644) internal successors, (1131), 708 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states 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:12,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1131 transitions. [2022-02-21 00:02:12,048 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1131 transitions. Word has length 21 [2022-02-21 00:02:12,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:12,049 INFO L470 AbstractCegarLoop]: Abstraction has 709 states and 1131 transitions. [2022-02-21 00:02:12,049 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:12,049 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1131 transitions. [2022-02-21 00:02:12,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-21 00:02:12,051 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:12,051 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:12,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-21 00:02:12,052 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:12,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:12,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1383047107, now seen corresponding path program 1 times [2022-02-21 00:02:12,053 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:12,053 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334027171] [2022-02-21 00:02:12,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:12,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:12,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {14157#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(16, 2);call #Ultimate.allocInit(12, 3); {14157#true} is VALID [2022-02-21 00:02:12,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {14157#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_#t~nondet14#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_~p10~0#1, main_~lk10~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;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; {14157#true} is VALID [2022-02-21 00:02:12,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {14157#true} assume !false;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {14157#true} is VALID [2022-02-21 00:02:12,094 INFO L290 TraceCheckUtils]: 3: Hoare triple {14157#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;main_~lk10~0#1 := 0; {14157#true} is VALID [2022-02-21 00:02:12,094 INFO L290 TraceCheckUtils]: 4: Hoare triple {14157#true} assume !(0 != main_~p1~0#1); {14157#true} is VALID [2022-02-21 00:02:12,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {14157#true} assume !(0 != main_~p2~0#1); {14157#true} is VALID [2022-02-21 00:02:12,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {14157#true} assume !(0 != main_~p3~0#1); {14157#true} is VALID [2022-02-21 00:02:12,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {14157#true} assume !(0 != main_~p4~0#1); {14157#true} is VALID [2022-02-21 00:02:12,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {14157#true} assume !(0 != main_~p5~0#1); {14159#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:12,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {14159#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {14159#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:12,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {14159#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {14159#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:12,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {14159#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {14159#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:12,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {14159#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {14159#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:12,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {14159#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {14159#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:12,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {14159#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p1~0#1); {14159#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:12,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {14159#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p2~0#1); {14159#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:12,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {14159#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p3~0#1); {14159#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:12,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {14159#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p4~0#1); {14159#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:12,098 INFO L290 TraceCheckUtils]: 18: Hoare triple {14159#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p5~0#1; {14158#false} is VALID [2022-02-21 00:02:12,098 INFO L290 TraceCheckUtils]: 19: Hoare triple {14158#false} assume 1 != main_~lk5~0#1; {14158#false} is VALID [2022-02-21 00:02:12,098 INFO L290 TraceCheckUtils]: 20: Hoare triple {14158#false} assume !false; {14158#false} is VALID [2022-02-21 00:02:12,098 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:12,098 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:12,099 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334027171] [2022-02-21 00:02:12,099 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334027171] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:12,099 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:12,099 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:12,099 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135770801] [2022-02-21 00:02:12,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:12,100 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:12,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:12,100 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:12,131 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:12,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:12,132 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:12,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:12,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:12,133 INFO L87 Difference]: Start difference. First operand 709 states and 1131 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:12,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:12,233 INFO L93 Difference]: Finished difference Result 967 states and 1524 transitions. [2022-02-21 00:02:12,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:12,233 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:12,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:12,234 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:12,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2022-02-21 00:02:12,235 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:12,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2022-02-21 00:02:12,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 117 transitions. [2022-02-21 00:02:12,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:12,332 INFO L225 Difference]: With dead ends: 967 [2022-02-21 00:02:12,332 INFO L226 Difference]: Without dead ends: 967 [2022-02-21 00:02:12,333 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:12,333 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 44 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 147 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:12,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 147 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:12,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2022-02-21 00:02:12,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 965. [2022-02-21 00:02:12,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:12,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 967 states. Second operand has 965 states, 964 states have (on average 1.579875518672199) internal successors, (1523), 964 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states 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:12,346 INFO L74 IsIncluded]: Start isIncluded. First operand 967 states. Second operand has 965 states, 964 states have (on average 1.579875518672199) internal successors, (1523), 964 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states 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:12,347 INFO L87 Difference]: Start difference. First operand 967 states. Second operand has 965 states, 964 states have (on average 1.579875518672199) internal successors, (1523), 964 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states 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:12,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:12,377 INFO L93 Difference]: Finished difference Result 967 states and 1524 transitions. [2022-02-21 00:02:12,377 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1524 transitions. [2022-02-21 00:02:12,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:12,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:12,380 INFO L74 IsIncluded]: Start isIncluded. First operand has 965 states, 964 states have (on average 1.579875518672199) internal successors, (1523), 964 states have internal predecessors, (1523), 0 states have call successors, (0), 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 967 states. [2022-02-21 00:02:12,381 INFO L87 Difference]: Start difference. First operand has 965 states, 964 states have (on average 1.579875518672199) internal successors, (1523), 964 states have internal predecessors, (1523), 0 states have call successors, (0), 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 967 states. [2022-02-21 00:02:12,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:12,412 INFO L93 Difference]: Finished difference Result 967 states and 1524 transitions. [2022-02-21 00:02:12,412 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1524 transitions. [2022-02-21 00:02:12,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:12,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:12,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:12,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:12,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 964 states have (on average 1.579875518672199) internal successors, (1523), 964 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states 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:12,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1523 transitions. [2022-02-21 00:02:12,443 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1523 transitions. Word has length 21 [2022-02-21 00:02:12,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:12,444 INFO L470 AbstractCegarLoop]: Abstraction has 965 states and 1523 transitions. [2022-02-21 00:02:12,444 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:12,444 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1523 transitions. [2022-02-21 00:02:12,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-21 00:02:12,445 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:12,445 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:12,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-21 00:02:12,445 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:12,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:12,446 INFO L85 PathProgramCache]: Analyzing trace with hash 936119319, now seen corresponding path program 1 times [2022-02-21 00:02:12,446 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:12,446 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127044920] [2022-02-21 00:02:12,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:12,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:12,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {18028#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(16, 2);call #Ultimate.allocInit(12, 3); {18028#true} is VALID [2022-02-21 00:02:12,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {18028#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_#t~nondet14#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_~p10~0#1, main_~lk10~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;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; {18028#true} is VALID [2022-02-21 00:02:12,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {18028#true} assume !false;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {18028#true} is VALID [2022-02-21 00:02:12,467 INFO L290 TraceCheckUtils]: 3: Hoare triple {18028#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;main_~lk10~0#1 := 0; {18028#true} is VALID [2022-02-21 00:02:12,467 INFO L290 TraceCheckUtils]: 4: Hoare triple {18028#true} assume !(0 != main_~p1~0#1); {18028#true} is VALID [2022-02-21 00:02:12,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {18028#true} assume !(0 != main_~p2~0#1); {18028#true} is VALID [2022-02-21 00:02:12,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {18028#true} assume !(0 != main_~p3~0#1); {18028#true} is VALID [2022-02-21 00:02:12,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {18028#true} assume !(0 != main_~p4~0#1); {18028#true} is VALID [2022-02-21 00:02:12,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {18028#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {18030#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:12,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {18030#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {18030#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:12,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {18030#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {18030#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:12,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {18030#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {18030#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:12,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {18030#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {18030#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:12,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {18030#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {18030#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:12,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {18030#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p1~0#1); {18030#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:12,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {18030#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p2~0#1); {18030#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:12,470 INFO L290 TraceCheckUtils]: 16: Hoare triple {18030#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p3~0#1); {18030#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:12,470 INFO L290 TraceCheckUtils]: 17: Hoare triple {18030#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p4~0#1); {18030#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:12,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {18030#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p5~0#1); {18029#false} is VALID [2022-02-21 00:02:12,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {18029#false} assume 0 != main_~p6~0#1; {18029#false} is VALID [2022-02-21 00:02:12,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {18029#false} assume 1 != main_~lk6~0#1; {18029#false} is VALID [2022-02-21 00:02:12,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {18029#false} assume !false; {18029#false} is VALID [2022-02-21 00:02:12,471 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:12,471 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:12,472 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127044920] [2022-02-21 00:02:12,472 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127044920] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:12,472 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:12,472 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:12,472 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261602405] [2022-02-21 00:02:12,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:12,473 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:12,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:12,473 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:12,486 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:12,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:12,486 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:12,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:12,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:12,487 INFO L87 Difference]: Start difference. First operand 965 states and 1523 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:12,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:12,574 INFO L93 Difference]: Finished difference Result 983 states and 1524 transitions. [2022-02-21 00:02:12,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:12,574 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:12,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:12,575 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:12,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2022-02-21 00:02:12,576 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:12,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2022-02-21 00:02:12,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 116 transitions. [2022-02-21 00:02:12,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:12,690 INFO L225 Difference]: With dead ends: 983 [2022-02-21 00:02:12,690 INFO L226 Difference]: Without dead ends: 983 [2022-02-21 00:02:12,690 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:12,691 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 46 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 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:12,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 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:12,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2022-02-21 00:02:12,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 981. [2022-02-21 00:02:12,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:12,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 983 states. Second operand has 981 states, 980 states have (on average 1.5540816326530613) internal successors, (1523), 980 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states 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:12,706 INFO L74 IsIncluded]: Start isIncluded. First operand 983 states. Second operand has 981 states, 980 states have (on average 1.5540816326530613) internal successors, (1523), 980 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states 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:12,707 INFO L87 Difference]: Start difference. First operand 983 states. Second operand has 981 states, 980 states have (on average 1.5540816326530613) internal successors, (1523), 980 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states 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:12,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:12,768 INFO L93 Difference]: Finished difference Result 983 states and 1524 transitions. [2022-02-21 00:02:12,768 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1524 transitions. [2022-02-21 00:02:12,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:12,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:12,771 INFO L74 IsIncluded]: Start isIncluded. First operand has 981 states, 980 states have (on average 1.5540816326530613) internal successors, (1523), 980 states have internal predecessors, (1523), 0 states have call successors, (0), 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 983 states. [2022-02-21 00:02:12,772 INFO L87 Difference]: Start difference. First operand has 981 states, 980 states have (on average 1.5540816326530613) internal successors, (1523), 980 states have internal predecessors, (1523), 0 states have call successors, (0), 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 983 states. [2022-02-21 00:02:12,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:12,803 INFO L93 Difference]: Finished difference Result 983 states and 1524 transitions. [2022-02-21 00:02:12,804 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1524 transitions. [2022-02-21 00:02:12,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:12,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:12,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:12,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:12,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 1.5540816326530613) internal successors, (1523), 980 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states 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:12,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1523 transitions. [2022-02-21 00:02:12,837 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1523 transitions. Word has length 22 [2022-02-21 00:02:12,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:12,837 INFO L470 AbstractCegarLoop]: Abstraction has 981 states and 1523 transitions. [2022-02-21 00:02:12,838 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:12,838 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1523 transitions. [2022-02-21 00:02:12,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-21 00:02:12,839 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:12,839 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:12,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-21 00:02:12,839 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:12,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:12,840 INFO L85 PathProgramCache]: Analyzing trace with hash -74997931, now seen corresponding path program 1 times [2022-02-21 00:02:12,840 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:12,840 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167609087] [2022-02-21 00:02:12,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:12,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:12,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {21963#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(16, 2);call #Ultimate.allocInit(12, 3); {21963#true} is VALID [2022-02-21 00:02:12,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {21963#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_#t~nondet14#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_~p10~0#1, main_~lk10~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;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; {21963#true} is VALID [2022-02-21 00:02:12,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {21963#true} assume !false;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {21963#true} is VALID [2022-02-21 00:02:12,877 INFO L290 TraceCheckUtils]: 3: Hoare triple {21963#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;main_~lk10~0#1 := 0; {21963#true} is VALID [2022-02-21 00:02:12,877 INFO L290 TraceCheckUtils]: 4: Hoare triple {21963#true} assume !(0 != main_~p1~0#1); {21963#true} is VALID [2022-02-21 00:02:12,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {21963#true} assume !(0 != main_~p2~0#1); {21963#true} is VALID [2022-02-21 00:02:12,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {21963#true} assume !(0 != main_~p3~0#1); {21963#true} is VALID [2022-02-21 00:02:12,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {21963#true} assume !(0 != main_~p4~0#1); {21963#true} is VALID [2022-02-21 00:02:12,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {21963#true} assume !(0 != main_~p5~0#1); {21963#true} is VALID [2022-02-21 00:02:12,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {21963#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {21965#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:12,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {21965#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {21965#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:12,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {21965#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {21965#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:12,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {21965#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {21965#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:12,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {21965#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {21965#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:12,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {21965#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p1~0#1); {21965#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:12,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {21965#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p2~0#1); {21965#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:12,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {21965#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p3~0#1); {21965#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:12,880 INFO L290 TraceCheckUtils]: 17: Hoare triple {21965#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p4~0#1); {21965#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:12,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {21965#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p5~0#1); {21965#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:12,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {21965#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p6~0#1; {21965#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:12,881 INFO L290 TraceCheckUtils]: 20: Hoare triple {21965#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 1 != main_~lk6~0#1; {21964#false} is VALID [2022-02-21 00:02:12,881 INFO L290 TraceCheckUtils]: 21: Hoare triple {21964#false} assume !false; {21964#false} is VALID [2022-02-21 00:02:12,882 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:12,882 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:12,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167609087] [2022-02-21 00:02:12,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167609087] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:12,882 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:12,882 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:12,882 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516218587] [2022-02-21 00:02:12,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:12,883 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:12,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:12,884 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:12,894 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:12,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:12,895 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:12,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:12,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:12,896 INFO L87 Difference]: Start difference. First operand 981 states and 1523 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:13,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:13,024 INFO L93 Difference]: Finished difference Result 1735 states and 2708 transitions. [2022-02-21 00:02:13,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:13,025 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:13,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:13,025 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:13,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2022-02-21 00:02:13,026 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:13,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2022-02-21 00:02:13,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 106 transitions. [2022-02-21 00:02:13,078 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:13,166 INFO L225 Difference]: With dead ends: 1735 [2022-02-21 00:02:13,166 INFO L226 Difference]: Without dead ends: 1735 [2022-02-21 00:02:13,166 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:13,167 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 33 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 117 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:13,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 117 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:13,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2022-02-21 00:02:13,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1413. [2022-02-21 00:02:13,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:13,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1735 states. Second operand has 1413 states, 1412 states have (on average 1.5092067988668556) internal successors, (2131), 1412 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states 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:13,188 INFO L74 IsIncluded]: Start isIncluded. First operand 1735 states. Second operand has 1413 states, 1412 states have (on average 1.5092067988668556) internal successors, (2131), 1412 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states 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:13,189 INFO L87 Difference]: Start difference. First operand 1735 states. Second operand has 1413 states, 1412 states have (on average 1.5092067988668556) internal successors, (2131), 1412 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states 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:13,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:13,275 INFO L93 Difference]: Finished difference Result 1735 states and 2708 transitions. [2022-02-21 00:02:13,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2708 transitions. [2022-02-21 00:02:13,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:13,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:13,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 1413 states, 1412 states have (on average 1.5092067988668556) internal successors, (2131), 1412 states have internal predecessors, (2131), 0 states have call successors, (0), 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:13,281 INFO L87 Difference]: Start difference. First operand has 1413 states, 1412 states have (on average 1.5092067988668556) internal successors, (2131), 1412 states have internal predecessors, (2131), 0 states have call successors, (0), 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:13,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:13,361 INFO L93 Difference]: Finished difference Result 1735 states and 2708 transitions. [2022-02-21 00:02:13,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2708 transitions. [2022-02-21 00:02:13,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:13,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:13,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:13,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:13,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1413 states, 1412 states have (on average 1.5092067988668556) internal successors, (2131), 1412 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states 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:13,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2131 transitions. [2022-02-21 00:02:13,417 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 2131 transitions. Word has length 22 [2022-02-21 00:02:13,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:13,417 INFO L470 AbstractCegarLoop]: Abstraction has 1413 states and 2131 transitions. [2022-02-21 00:02:13,418 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:13,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 2131 transitions. [2022-02-21 00:02:13,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-21 00:02:13,419 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:13,419 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:13,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-21 00:02:13,420 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:13,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:13,420 INFO L85 PathProgramCache]: Analyzing trace with hash -661803945, now seen corresponding path program 1 times [2022-02-21 00:02:13,420 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:13,420 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006460665] [2022-02-21 00:02:13,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:13,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:13,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {28586#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(16, 2);call #Ultimate.allocInit(12, 3); {28586#true} is VALID [2022-02-21 00:02:13,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {28586#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_#t~nondet14#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_~p10~0#1, main_~lk10~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;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; {28586#true} is VALID [2022-02-21 00:02:13,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {28586#true} assume !false;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {28586#true} is VALID [2022-02-21 00:02:13,443 INFO L290 TraceCheckUtils]: 3: Hoare triple {28586#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;main_~lk10~0#1 := 0; {28586#true} is VALID [2022-02-21 00:02:13,443 INFO L290 TraceCheckUtils]: 4: Hoare triple {28586#true} assume !(0 != main_~p1~0#1); {28586#true} is VALID [2022-02-21 00:02:13,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {28586#true} assume !(0 != main_~p2~0#1); {28586#true} is VALID [2022-02-21 00:02:13,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {28586#true} assume !(0 != main_~p3~0#1); {28586#true} is VALID [2022-02-21 00:02:13,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {28586#true} assume !(0 != main_~p4~0#1); {28586#true} is VALID [2022-02-21 00:02:13,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {28586#true} assume !(0 != main_~p5~0#1); {28586#true} is VALID [2022-02-21 00:02:13,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {28586#true} assume !(0 != main_~p6~0#1); {28588#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:13,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {28588#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {28588#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:13,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {28588#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {28588#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:13,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {28588#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {28588#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:13,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {28588#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {28588#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:13,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {28588#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p1~0#1); {28588#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:13,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {28588#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p2~0#1); {28588#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:13,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {28588#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p3~0#1); {28588#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:13,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {28588#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p4~0#1); {28588#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:13,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {28588#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p5~0#1); {28588#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:13,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {28588#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p6~0#1; {28587#false} is VALID [2022-02-21 00:02:13,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {28587#false} assume 1 != main_~lk6~0#1; {28587#false} is VALID [2022-02-21 00:02:13,447 INFO L290 TraceCheckUtils]: 21: Hoare triple {28587#false} assume !false; {28587#false} is VALID [2022-02-21 00:02:13,447 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:13,448 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:13,448 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006460665] [2022-02-21 00:02:13,448 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006460665] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:13,448 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:13,448 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:13,448 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72976010] [2022-02-21 00:02:13,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:13,449 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:13,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:13,449 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:13,459 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:13,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:13,460 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:13,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:13,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:13,460 INFO L87 Difference]: Start difference. First operand 1413 states and 2131 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:13,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:13,622 INFO L93 Difference]: Finished difference Result 1895 states and 2820 transitions. [2022-02-21 00:02:13,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:13,623 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:13,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:13,623 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:13,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2022-02-21 00:02:13,624 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:13,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2022-02-21 00:02:13,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 115 transitions. [2022-02-21 00:02:13,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:13,800 INFO L225 Difference]: With dead ends: 1895 [2022-02-21 00:02:13,800 INFO L226 Difference]: Without dead ends: 1895 [2022-02-21 00:02:13,800 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:13,801 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 43 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 148 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:13,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 148 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:13,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2022-02-21 00:02:13,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1893. [2022-02-21 00:02:13,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:13,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1895 states. Second operand has 1893 states, 1892 states have (on average 1.4899577167019027) internal successors, (2819), 1892 states have internal predecessors, (2819), 0 states have call successors, (0), 0 states 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:13,826 INFO L74 IsIncluded]: Start isIncluded. First operand 1895 states. Second operand has 1893 states, 1892 states have (on average 1.4899577167019027) internal successors, (2819), 1892 states have internal predecessors, (2819), 0 states have call successors, (0), 0 states 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:13,827 INFO L87 Difference]: Start difference. First operand 1895 states. Second operand has 1893 states, 1892 states have (on average 1.4899577167019027) internal successors, (2819), 1892 states have internal predecessors, (2819), 0 states have call successors, (0), 0 states 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:13,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:13,925 INFO L93 Difference]: Finished difference Result 1895 states and 2820 transitions. [2022-02-21 00:02:13,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2820 transitions. [2022-02-21 00:02:13,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:13,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:13,930 INFO L74 IsIncluded]: Start isIncluded. First operand has 1893 states, 1892 states have (on average 1.4899577167019027) internal successors, (2819), 1892 states have internal predecessors, (2819), 0 states have call successors, (0), 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 1895 states. [2022-02-21 00:02:13,931 INFO L87 Difference]: Start difference. First operand has 1893 states, 1892 states have (on average 1.4899577167019027) internal successors, (2819), 1892 states have internal predecessors, (2819), 0 states have call successors, (0), 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 1895 states. [2022-02-21 00:02:14,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:14,024 INFO L93 Difference]: Finished difference Result 1895 states and 2820 transitions. [2022-02-21 00:02:14,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2820 transitions. [2022-02-21 00:02:14,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:14,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:14,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:14,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:14,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1892 states have (on average 1.4899577167019027) internal successors, (2819), 1892 states have internal predecessors, (2819), 0 states have call successors, (0), 0 states 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:14,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2819 transitions. [2022-02-21 00:02:14,121 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2819 transitions. Word has length 22 [2022-02-21 00:02:14,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:14,121 INFO L470 AbstractCegarLoop]: Abstraction has 1893 states and 2819 transitions. [2022-02-21 00:02:14,121 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:14,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2819 transitions. [2022-02-21 00:02:14,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-21 00:02:14,123 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:14,123 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:14,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-21 00:02:14,123 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:14,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:14,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1970246488, now seen corresponding path program 1 times [2022-02-21 00:02:14,124 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:14,124 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525497768] [2022-02-21 00:02:14,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:14,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:14,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {36169#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(16, 2);call #Ultimate.allocInit(12, 3); {36169#true} is VALID [2022-02-21 00:02:14,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {36169#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_#t~nondet14#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_~p10~0#1, main_~lk10~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;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; {36169#true} is VALID [2022-02-21 00:02:14,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {36169#true} assume !false;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {36169#true} is VALID [2022-02-21 00:02:14,142 INFO L290 TraceCheckUtils]: 3: Hoare triple {36169#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;main_~lk10~0#1 := 0; {36169#true} is VALID [2022-02-21 00:02:14,143 INFO L290 TraceCheckUtils]: 4: Hoare triple {36169#true} assume !(0 != main_~p1~0#1); {36169#true} is VALID [2022-02-21 00:02:14,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {36169#true} assume !(0 != main_~p2~0#1); {36169#true} is VALID [2022-02-21 00:02:14,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {36169#true} assume !(0 != main_~p3~0#1); {36169#true} is VALID [2022-02-21 00:02:14,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {36169#true} assume !(0 != main_~p4~0#1); {36169#true} is VALID [2022-02-21 00:02:14,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {36169#true} assume !(0 != main_~p5~0#1); {36169#true} is VALID [2022-02-21 00:02:14,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {36169#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {36171#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:14,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {36171#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {36171#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:14,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {36171#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {36171#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:14,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {36171#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {36171#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:14,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {36171#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {36171#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:14,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {36171#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p1~0#1); {36171#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:14,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {36171#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p2~0#1); {36171#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:14,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {36171#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p3~0#1); {36171#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:14,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {36171#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p4~0#1); {36171#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:14,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {36171#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p5~0#1); {36171#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:14,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {36171#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p6~0#1); {36170#false} is VALID [2022-02-21 00:02:14,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {36170#false} assume 0 != main_~p7~0#1; {36170#false} is VALID [2022-02-21 00:02:14,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {36170#false} assume 1 != main_~lk7~0#1; {36170#false} is VALID [2022-02-21 00:02:14,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {36170#false} assume !false; {36170#false} is VALID [2022-02-21 00:02:14,147 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:14,147 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:14,147 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525497768] [2022-02-21 00:02:14,147 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525497768] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:14,148 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:14,148 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:14,148 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294763794] [2022-02-21 00:02:14,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:14,148 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:14,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:14,149 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:14,161 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:14,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:14,161 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:14,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:14,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:14,162 INFO L87 Difference]: Start difference. First operand 1893 states and 2819 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:14,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:14,331 INFO L93 Difference]: Finished difference Result 1927 states and 2820 transitions. [2022-02-21 00:02:14,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:14,331 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:14,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:14,331 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:14,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2022-02-21 00:02:14,332 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:14,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2022-02-21 00:02:14,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 114 transitions. [2022-02-21 00:02:14,387 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:14,494 INFO L225 Difference]: With dead ends: 1927 [2022-02-21 00:02:14,494 INFO L226 Difference]: Without dead ends: 1927 [2022-02-21 00:02:14,494 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:14,495 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 45 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 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:14,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 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:14,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2022-02-21 00:02:14,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1925. [2022-02-21 00:02:14,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:14,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1927 states. Second operand has 1925 states, 1924 states have (on average 1.4651767151767152) internal successors, (2819), 1924 states have internal predecessors, (2819), 0 states have call successors, (0), 0 states 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:14,523 INFO L74 IsIncluded]: Start isIncluded. First operand 1927 states. Second operand has 1925 states, 1924 states have (on average 1.4651767151767152) internal successors, (2819), 1924 states have internal predecessors, (2819), 0 states have call successors, (0), 0 states 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:14,525 INFO L87 Difference]: Start difference. First operand 1927 states. Second operand has 1925 states, 1924 states have (on average 1.4651767151767152) internal successors, (2819), 1924 states have internal predecessors, (2819), 0 states have call successors, (0), 0 states 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:14,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:14,627 INFO L93 Difference]: Finished difference Result 1927 states and 2820 transitions. [2022-02-21 00:02:14,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 2820 transitions. [2022-02-21 00:02:14,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:14,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:14,631 INFO L74 IsIncluded]: Start isIncluded. First operand has 1925 states, 1924 states have (on average 1.4651767151767152) internal successors, (2819), 1924 states have internal predecessors, (2819), 0 states have call successors, (0), 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 1927 states. [2022-02-21 00:02:14,633 INFO L87 Difference]: Start difference. First operand has 1925 states, 1924 states have (on average 1.4651767151767152) internal successors, (2819), 1924 states have internal predecessors, (2819), 0 states have call successors, (0), 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 1927 states. [2022-02-21 00:02:14,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:14,732 INFO L93 Difference]: Finished difference Result 1927 states and 2820 transitions. [2022-02-21 00:02:14,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 2820 transitions. [2022-02-21 00:02:14,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:14,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:14,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:14,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:14,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1924 states have (on average 1.4651767151767152) internal successors, (2819), 1924 states have internal predecessors, (2819), 0 states have call successors, (0), 0 states 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:14,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2819 transitions. [2022-02-21 00:02:14,834 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2819 transitions. Word has length 23 [2022-02-21 00:02:14,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:14,834 INFO L470 AbstractCegarLoop]: Abstraction has 1925 states and 2819 transitions. [2022-02-21 00:02:14,834 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:14,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2819 transitions. [2022-02-21 00:02:14,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-21 00:02:14,836 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:14,836 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:14,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-21 00:02:14,836 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:14,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:14,837 INFO L85 PathProgramCache]: Analyzing trace with hash 959129238, now seen corresponding path program 1 times [2022-02-21 00:02:14,837 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:14,837 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523325926] [2022-02-21 00:02:14,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:14,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:14,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {43880#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(16, 2);call #Ultimate.allocInit(12, 3); {43880#true} is VALID [2022-02-21 00:02:14,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {43880#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_#t~nondet14#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_~p10~0#1, main_~lk10~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;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; {43880#true} is VALID [2022-02-21 00:02:14,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {43880#true} assume !false;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {43880#true} is VALID [2022-02-21 00:02:14,863 INFO L290 TraceCheckUtils]: 3: Hoare triple {43880#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;main_~lk10~0#1 := 0; {43880#true} is VALID [2022-02-21 00:02:14,863 INFO L290 TraceCheckUtils]: 4: Hoare triple {43880#true} assume !(0 != main_~p1~0#1); {43880#true} is VALID [2022-02-21 00:02:14,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {43880#true} assume !(0 != main_~p2~0#1); {43880#true} is VALID [2022-02-21 00:02:14,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {43880#true} assume !(0 != main_~p3~0#1); {43880#true} is VALID [2022-02-21 00:02:14,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {43880#true} assume !(0 != main_~p4~0#1); {43880#true} is VALID [2022-02-21 00:02:14,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {43880#true} assume !(0 != main_~p5~0#1); {43880#true} is VALID [2022-02-21 00:02:14,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {43880#true} assume !(0 != main_~p6~0#1); {43880#true} is VALID [2022-02-21 00:02:14,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {43880#true} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {43882#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:14,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {43882#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {43882#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:14,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {43882#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {43882#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:14,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {43882#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {43882#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:14,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {43882#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p1~0#1); {43882#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:14,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {43882#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p2~0#1); {43882#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:14,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {43882#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p3~0#1); {43882#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:14,868 INFO L290 TraceCheckUtils]: 17: Hoare triple {43882#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p4~0#1); {43882#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:14,868 INFO L290 TraceCheckUtils]: 18: Hoare triple {43882#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p5~0#1); {43882#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:14,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {43882#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p6~0#1); {43882#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:14,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {43882#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p7~0#1; {43882#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:14,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {43882#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 1 != main_~lk7~0#1; {43881#false} is VALID [2022-02-21 00:02:14,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {43881#false} assume !false; {43881#false} is VALID [2022-02-21 00:02:14,869 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:14,869 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:14,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523325926] [2022-02-21 00:02:14,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523325926] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:14,870 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:14,870 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:14,870 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605880723] [2022-02-21 00:02:14,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:14,871 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:14,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:14,871 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:14,883 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:14,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:14,884 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:14,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:14,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:14,884 INFO L87 Difference]: Start difference. First operand 1925 states and 2819 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:15,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:15,242 INFO L93 Difference]: Finished difference Result 3335 states and 4900 transitions. [2022-02-21 00:02:15,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:15,242 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:15,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:15,243 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:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2022-02-21 00:02:15,243 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:15,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2022-02-21 00:02:15,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 102 transitions. [2022-02-21 00:02:15,312 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:15,639 INFO L225 Difference]: With dead ends: 3335 [2022-02-21 00:02:15,639 INFO L226 Difference]: Without dead ends: 3335 [2022-02-21 00:02:15,639 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:15,641 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 30 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 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:15,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 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:15,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2022-02-21 00:02:15,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 2821. [2022-02-21 00:02:15,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:15,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3335 states. Second operand has 2821 states, 2820 states have (on average 1.4195035460992909) internal successors, (4003), 2820 states have internal predecessors, (4003), 0 states have call successors, (0), 0 states 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:15,688 INFO L74 IsIncluded]: Start isIncluded. First operand 3335 states. Second operand has 2821 states, 2820 states have (on average 1.4195035460992909) internal successors, (4003), 2820 states have internal predecessors, (4003), 0 states have call successors, (0), 0 states 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:15,691 INFO L87 Difference]: Start difference. First operand 3335 states. Second operand has 2821 states, 2820 states have (on average 1.4195035460992909) internal successors, (4003), 2820 states have internal predecessors, (4003), 0 states have call successors, (0), 0 states 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:16,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:16,031 INFO L93 Difference]: Finished difference Result 3335 states and 4900 transitions. [2022-02-21 00:02:16,031 INFO L276 IsEmpty]: Start isEmpty. Operand 3335 states and 4900 transitions. [2022-02-21 00:02:16,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:16,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:16,061 INFO L74 IsIncluded]: Start isIncluded. First operand has 2821 states, 2820 states have (on average 1.4195035460992909) internal successors, (4003), 2820 states have internal predecessors, (4003), 0 states have call successors, (0), 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:16,064 INFO L87 Difference]: Start difference. First operand has 2821 states, 2820 states have (on average 1.4195035460992909) internal successors, (4003), 2820 states have internal predecessors, (4003), 0 states have call successors, (0), 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:16,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:16,380 INFO L93 Difference]: Finished difference Result 3335 states and 4900 transitions. [2022-02-21 00:02:16,381 INFO L276 IsEmpty]: Start isEmpty. Operand 3335 states and 4900 transitions. [2022-02-21 00:02:16,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:16,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:16,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:16,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:16,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2821 states, 2820 states have (on average 1.4195035460992909) internal successors, (4003), 2820 states have internal predecessors, (4003), 0 states have call successors, (0), 0 states 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:16,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 4003 transitions. [2022-02-21 00:02:16,591 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 4003 transitions. Word has length 23 [2022-02-21 00:02:16,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:16,591 INFO L470 AbstractCegarLoop]: Abstraction has 2821 states and 4003 transitions. [2022-02-21 00:02:16,591 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:16,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 4003 transitions. [2022-02-21 00:02:16,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-21 00:02:16,593 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:16,593 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:16,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-21 00:02:16,594 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:16,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:16,594 INFO L85 PathProgramCache]: Analyzing trace with hash 372323224, now seen corresponding path program 1 times [2022-02-21 00:02:16,594 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:16,594 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115943423] [2022-02-21 00:02:16,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:16,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:16,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {56711#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(16, 2);call #Ultimate.allocInit(12, 3); {56711#true} is VALID [2022-02-21 00:02:16,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {56711#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_#t~nondet14#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_~p10~0#1, main_~lk10~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;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; {56711#true} is VALID [2022-02-21 00:02:16,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {56711#true} assume !false;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {56711#true} is VALID [2022-02-21 00:02:16,629 INFO L290 TraceCheckUtils]: 3: Hoare triple {56711#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;main_~lk10~0#1 := 0; {56711#true} is VALID [2022-02-21 00:02:16,632 INFO L290 TraceCheckUtils]: 4: Hoare triple {56711#true} assume !(0 != main_~p1~0#1); {56711#true} is VALID [2022-02-21 00:02:16,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {56711#true} assume !(0 != main_~p2~0#1); {56711#true} is VALID [2022-02-21 00:02:16,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {56711#true} assume !(0 != main_~p3~0#1); {56711#true} is VALID [2022-02-21 00:02:16,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {56711#true} assume !(0 != main_~p4~0#1); {56711#true} is VALID [2022-02-21 00:02:16,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {56711#true} assume !(0 != main_~p5~0#1); {56711#true} is VALID [2022-02-21 00:02:16,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {56711#true} assume !(0 != main_~p6~0#1); {56711#true} is VALID [2022-02-21 00:02:16,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {56711#true} assume !(0 != main_~p7~0#1); {56713#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:16,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {56713#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {56713#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:16,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {56713#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {56713#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:16,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {56713#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {56713#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:16,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {56713#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p1~0#1); {56713#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:16,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {56713#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p2~0#1); {56713#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:16,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {56713#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p3~0#1); {56713#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:16,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {56713#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p4~0#1); {56713#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:16,643 INFO L290 TraceCheckUtils]: 18: Hoare triple {56713#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p5~0#1); {56713#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:16,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {56713#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p6~0#1); {56713#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:16,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {56713#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p7~0#1; {56712#false} is VALID [2022-02-21 00:02:16,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {56712#false} assume 1 != main_~lk7~0#1; {56712#false} is VALID [2022-02-21 00:02:16,644 INFO L290 TraceCheckUtils]: 22: Hoare triple {56712#false} assume !false; {56712#false} is VALID [2022-02-21 00:02:16,644 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:16,645 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:16,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115943423] [2022-02-21 00:02:16,645 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115943423] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:16,645 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:16,646 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:16,646 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299479410] [2022-02-21 00:02:16,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:16,646 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:16,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:16,646 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:16,658 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:16,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:16,659 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:16,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:16,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:16,660 INFO L87 Difference]: Start difference. First operand 2821 states and 4003 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:17,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:17,100 INFO L93 Difference]: Finished difference Result 3719 states and 5188 transitions. [2022-02-21 00:02:17,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:17,100 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:17,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:17,100 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:17,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-02-21 00:02:17,101 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:17,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-02-21 00:02:17,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2022-02-21 00:02:17,162 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:17,568 INFO L225 Difference]: With dead ends: 3719 [2022-02-21 00:02:17,569 INFO L226 Difference]: Without dead ends: 3719 [2022-02-21 00:02:17,569 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:17,574 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 42 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 149 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:17,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 149 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:17,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2022-02-21 00:02:17,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3717. [2022-02-21 00:02:17,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:17,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3719 states. Second operand has 3717 states, 3716 states have (on average 1.3958557588805167) internal successors, (5187), 3716 states have internal predecessors, (5187), 0 states have call successors, (0), 0 states 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:17,638 INFO L74 IsIncluded]: Start isIncluded. First operand 3719 states. Second operand has 3717 states, 3716 states have (on average 1.3958557588805167) internal successors, (5187), 3716 states have internal predecessors, (5187), 0 states have call successors, (0), 0 states 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:17,642 INFO L87 Difference]: Start difference. First operand 3719 states. Second operand has 3717 states, 3716 states have (on average 1.3958557588805167) internal successors, (5187), 3716 states have internal predecessors, (5187), 0 states have call successors, (0), 0 states 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:18,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:18,038 INFO L93 Difference]: Finished difference Result 3719 states and 5188 transitions. [2022-02-21 00:02:18,038 INFO L276 IsEmpty]: Start isEmpty. Operand 3719 states and 5188 transitions. [2022-02-21 00:02:18,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:18,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:18,046 INFO L74 IsIncluded]: Start isIncluded. First operand has 3717 states, 3716 states have (on average 1.3958557588805167) internal successors, (5187), 3716 states have internal predecessors, (5187), 0 states have call successors, (0), 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 3719 states. [2022-02-21 00:02:18,049 INFO L87 Difference]: Start difference. First operand has 3717 states, 3716 states have (on average 1.3958557588805167) internal successors, (5187), 3716 states have internal predecessors, (5187), 0 states have call successors, (0), 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 3719 states. [2022-02-21 00:02:18,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:18,505 INFO L93 Difference]: Finished difference Result 3719 states and 5188 transitions. [2022-02-21 00:02:18,505 INFO L276 IsEmpty]: Start isEmpty. Operand 3719 states and 5188 transitions. [2022-02-21 00:02:18,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:18,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:18,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:18,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:18,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3717 states, 3716 states have (on average 1.3958557588805167) internal successors, (5187), 3716 states have internal predecessors, (5187), 0 states have call successors, (0), 0 states 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:18,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3717 states to 3717 states and 5187 transitions. [2022-02-21 00:02:18,945 INFO L78 Accepts]: Start accepts. Automaton has 3717 states and 5187 transitions. Word has length 23 [2022-02-21 00:02:18,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:18,945 INFO L470 AbstractCegarLoop]: Abstraction has 3717 states and 5187 transitions. [2022-02-21 00:02:18,945 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:18,945 INFO L276 IsEmpty]: Start isEmpty. Operand 3717 states and 5187 transitions. [2022-02-21 00:02:18,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-21 00:02:18,947 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:18,947 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:02:18,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-21 00:02:18,948 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:18,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:18,948 INFO L85 PathProgramCache]: Analyzing trace with hash -331549300, now seen corresponding path program 1 times [2022-02-21 00:02:18,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:18,948 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818209061] [2022-02-21 00:02:18,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:18,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:18,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {71590#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(16, 2);call #Ultimate.allocInit(12, 3); {71590#true} is VALID [2022-02-21 00:02:18,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {71590#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_#t~nondet14#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_~p10~0#1, main_~lk10~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;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; {71590#true} is VALID [2022-02-21 00:02:18,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {71590#true} assume !false;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {71590#true} is VALID [2022-02-21 00:02:18,969 INFO L290 TraceCheckUtils]: 3: Hoare triple {71590#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;main_~lk10~0#1 := 0; {71590#true} is VALID [2022-02-21 00:02:18,969 INFO L290 TraceCheckUtils]: 4: Hoare triple {71590#true} assume !(0 != main_~p1~0#1); {71590#true} is VALID [2022-02-21 00:02:18,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {71590#true} assume !(0 != main_~p2~0#1); {71590#true} is VALID [2022-02-21 00:02:18,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {71590#true} assume !(0 != main_~p3~0#1); {71590#true} is VALID [2022-02-21 00:02:18,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {71590#true} assume !(0 != main_~p4~0#1); {71590#true} is VALID [2022-02-21 00:02:18,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {71590#true} assume !(0 != main_~p5~0#1); {71590#true} is VALID [2022-02-21 00:02:18,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {71590#true} assume !(0 != main_~p6~0#1); {71590#true} is VALID [2022-02-21 00:02:18,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {71590#true} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {71592#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:18,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {71592#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {71592#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:18,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {71592#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {71592#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:18,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {71592#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {71592#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:18,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {71592#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p1~0#1); {71592#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:18,972 INFO L290 TraceCheckUtils]: 15: Hoare triple {71592#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p2~0#1); {71592#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:18,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {71592#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p3~0#1); {71592#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:18,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {71592#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p4~0#1); {71592#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:18,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {71592#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p5~0#1); {71592#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:18,973 INFO L290 TraceCheckUtils]: 19: Hoare triple {71592#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p6~0#1); {71592#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:18,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {71592#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p7~0#1); {71591#false} is VALID [2022-02-21 00:02:18,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {71591#false} assume 0 != main_~p8~0#1; {71591#false} is VALID [2022-02-21 00:02:18,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {71591#false} assume 1 != main_~lk8~0#1; {71591#false} is VALID [2022-02-21 00:02:18,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {71591#false} assume !false; {71591#false} is VALID [2022-02-21 00:02:18,974 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:18,974 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:18,974 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818209061] [2022-02-21 00:02:18,974 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818209061] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:18,974 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:18,974 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:18,975 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315776012] [2022-02-21 00:02:18,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:18,975 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:02:18,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:18,975 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:02:18,986 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:02:18,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:18,987 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:18,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:18,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:18,987 INFO L87 Difference]: Start difference. First operand 3717 states and 5187 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:02:19,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:19,469 INFO L93 Difference]: Finished difference Result 3783 states and 5188 transitions. [2022-02-21 00:02:19,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:19,470 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:02:19,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:19,470 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:02:19,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-02-21 00:02:19,471 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:02:19,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-02-21 00:02:19,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 112 transitions. [2022-02-21 00:02:19,532 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:19,977 INFO L225 Difference]: With dead ends: 3783 [2022-02-21 00:02:19,977 INFO L226 Difference]: Without dead ends: 3783 [2022-02-21 00:02:19,977 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:19,977 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 44 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 136 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:19,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 136 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:19,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3783 states. [2022-02-21 00:02:20,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3783 to 3781. [2022-02-21 00:02:20,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:20,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3783 states. Second operand has 3781 states, 3780 states have (on average 1.3722222222222222) internal successors, (5187), 3780 states have internal predecessors, (5187), 0 states have call successors, (0), 0 states 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:20,033 INFO L74 IsIncluded]: Start isIncluded. First operand 3783 states. Second operand has 3781 states, 3780 states have (on average 1.3722222222222222) internal successors, (5187), 3780 states have internal predecessors, (5187), 0 states have call successors, (0), 0 states 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:20,036 INFO L87 Difference]: Start difference. First operand 3783 states. Second operand has 3781 states, 3780 states have (on average 1.3722222222222222) internal successors, (5187), 3780 states have internal predecessors, (5187), 0 states have call successors, (0), 0 states 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:20,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:20,431 INFO L93 Difference]: Finished difference Result 3783 states and 5188 transitions. [2022-02-21 00:02:20,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3783 states and 5188 transitions. [2022-02-21 00:02:20,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:20,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:20,439 INFO L74 IsIncluded]: Start isIncluded. First operand has 3781 states, 3780 states have (on average 1.3722222222222222) internal successors, (5187), 3780 states have internal predecessors, (5187), 0 states have call successors, (0), 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 3783 states. [2022-02-21 00:02:20,440 INFO L87 Difference]: Start difference. First operand has 3781 states, 3780 states have (on average 1.3722222222222222) internal successors, (5187), 3780 states have internal predecessors, (5187), 0 states have call successors, (0), 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 3783 states. [2022-02-21 00:02:20,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:20,830 INFO L93 Difference]: Finished difference Result 3783 states and 5188 transitions. [2022-02-21 00:02:20,830 INFO L276 IsEmpty]: Start isEmpty. Operand 3783 states and 5188 transitions. [2022-02-21 00:02:20,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:20,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:20,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:20,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:20,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3781 states, 3780 states have (on average 1.3722222222222222) internal successors, (5187), 3780 states have internal predecessors, (5187), 0 states have call successors, (0), 0 states 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:21,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3781 states to 3781 states and 5187 transitions. [2022-02-21 00:02:21,242 INFO L78 Accepts]: Start accepts. Automaton has 3781 states and 5187 transitions. Word has length 24 [2022-02-21 00:02:21,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:21,242 INFO L470 AbstractCegarLoop]: Abstraction has 3781 states and 5187 transitions. [2022-02-21 00:02:21,242 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:02:21,243 INFO L276 IsEmpty]: Start isEmpty. Operand 3781 states and 5187 transitions. [2022-02-21 00:02:21,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-21 00:02:21,244 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:21,244 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:02:21,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-21 00:02:21,245 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:21,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:21,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1342666550, now seen corresponding path program 1 times [2022-02-21 00:02:21,245 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:21,245 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663290692] [2022-02-21 00:02:21,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:21,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:21,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {86725#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(16, 2);call #Ultimate.allocInit(12, 3); {86725#true} is VALID [2022-02-21 00:02:21,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {86725#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_#t~nondet14#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_~p10~0#1, main_~lk10~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;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; {86725#true} is VALID [2022-02-21 00:02:21,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {86725#true} assume !false;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {86725#true} is VALID [2022-02-21 00:02:21,271 INFO L290 TraceCheckUtils]: 3: Hoare triple {86725#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;main_~lk10~0#1 := 0; {86725#true} is VALID [2022-02-21 00:02:21,271 INFO L290 TraceCheckUtils]: 4: Hoare triple {86725#true} assume !(0 != main_~p1~0#1); {86725#true} is VALID [2022-02-21 00:02:21,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {86725#true} assume !(0 != main_~p2~0#1); {86725#true} is VALID [2022-02-21 00:02:21,271 INFO L290 TraceCheckUtils]: 6: Hoare triple {86725#true} assume !(0 != main_~p3~0#1); {86725#true} is VALID [2022-02-21 00:02:21,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {86725#true} assume !(0 != main_~p4~0#1); {86725#true} is VALID [2022-02-21 00:02:21,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {86725#true} assume !(0 != main_~p5~0#1); {86725#true} is VALID [2022-02-21 00:02:21,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {86725#true} assume !(0 != main_~p6~0#1); {86725#true} is VALID [2022-02-21 00:02:21,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {86725#true} assume !(0 != main_~p7~0#1); {86725#true} is VALID [2022-02-21 00:02:21,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {86725#true} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {86727#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:21,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {86727#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {86727#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:21,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {86727#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {86727#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:21,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {86727#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p1~0#1); {86727#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:21,274 INFO L290 TraceCheckUtils]: 15: Hoare triple {86727#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p2~0#1); {86727#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:21,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {86727#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p3~0#1); {86727#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:21,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {86727#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p4~0#1); {86727#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:21,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {86727#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p5~0#1); {86727#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:21,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {86727#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p6~0#1); {86727#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:21,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {86727#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p7~0#1); {86727#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:21,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {86727#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p8~0#1; {86727#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:21,276 INFO L290 TraceCheckUtils]: 22: Hoare triple {86727#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 1 != main_~lk8~0#1; {86726#false} is VALID [2022-02-21 00:02:21,276 INFO L290 TraceCheckUtils]: 23: Hoare triple {86726#false} assume !false; {86726#false} is VALID [2022-02-21 00:02:21,276 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:21,276 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:21,276 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663290692] [2022-02-21 00:02:21,276 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663290692] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:21,276 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:21,277 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:21,278 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129814111] [2022-02-21 00:02:21,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:21,279 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:02:21,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:21,279 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:02:21,291 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:02:21,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:21,292 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:21,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:21,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:21,292 INFO L87 Difference]: Start difference. First operand 3781 states and 5187 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:02:22,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:22,545 INFO L93 Difference]: Finished difference Result 6407 states and 8772 transitions. [2022-02-21 00:02:22,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:22,545 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:02:22,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:22,545 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:02:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2022-02-21 00:02:22,546 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:02:22,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2022-02-21 00:02:22,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 98 transitions. [2022-02-21 00:02:22,614 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:23,838 INFO L225 Difference]: With dead ends: 6407 [2022-02-21 00:02:23,838 INFO L226 Difference]: Without dead ends: 6407 [2022-02-21 00:02:23,838 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:23,839 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 27 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 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:23,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 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:23,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6407 states. [2022-02-21 00:02:23,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6407 to 5637. [2022-02-21 00:02:23,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:23,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6407 states. Second operand has 5637 states, 5636 states have (on average 1.3291341376863024) internal successors, (7491), 5636 states have internal predecessors, (7491), 0 states have call successors, (0), 0 states 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:23,897 INFO L74 IsIncluded]: Start isIncluded. First operand 6407 states. Second operand has 5637 states, 5636 states have (on average 1.3291341376863024) internal successors, (7491), 5636 states have internal predecessors, (7491), 0 states have call successors, (0), 0 states 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:23,902 INFO L87 Difference]: Start difference. First operand 6407 states. Second operand has 5637 states, 5636 states have (on average 1.3291341376863024) internal successors, (7491), 5636 states have internal predecessors, (7491), 0 states have call successors, (0), 0 states 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:25,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:25,223 INFO L93 Difference]: Finished difference Result 6407 states and 8772 transitions. [2022-02-21 00:02:25,223 INFO L276 IsEmpty]: Start isEmpty. Operand 6407 states and 8772 transitions. [2022-02-21 00:02:25,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:25,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:25,235 INFO L74 IsIncluded]: Start isIncluded. First operand has 5637 states, 5636 states have (on average 1.3291341376863024) internal successors, (7491), 5636 states have internal predecessors, (7491), 0 states have call successors, (0), 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 6407 states. [2022-02-21 00:02:25,238 INFO L87 Difference]: Start difference. First operand has 5637 states, 5636 states have (on average 1.3291341376863024) internal successors, (7491), 5636 states have internal predecessors, (7491), 0 states have call successors, (0), 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 6407 states. [2022-02-21 00:02:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:26,466 INFO L93 Difference]: Finished difference Result 6407 states and 8772 transitions. [2022-02-21 00:02:26,466 INFO L276 IsEmpty]: Start isEmpty. Operand 6407 states and 8772 transitions. [2022-02-21 00:02:26,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:26,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:26,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:26,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:26,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5637 states, 5636 states have (on average 1.3291341376863024) internal successors, (7491), 5636 states have internal predecessors, (7491), 0 states have call successors, (0), 0 states 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:27,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5637 states to 5637 states and 7491 transitions. [2022-02-21 00:02:27,306 INFO L78 Accepts]: Start accepts. Automaton has 5637 states and 7491 transitions. Word has length 24 [2022-02-21 00:02:27,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:27,306 INFO L470 AbstractCegarLoop]: Abstraction has 5637 states and 7491 transitions. [2022-02-21 00:02:27,306 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:02:27,306 INFO L276 IsEmpty]: Start isEmpty. Operand 5637 states and 7491 transitions. [2022-02-21 00:02:27,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-21 00:02:27,310 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:27,310 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:02:27,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-21 00:02:27,311 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:27,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:27,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1929472564, now seen corresponding path program 1 times [2022-02-21 00:02:27,311 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:27,311 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243644627] [2022-02-21 00:02:27,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:27,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:27,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {111588#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(16, 2);call #Ultimate.allocInit(12, 3); {111588#true} is VALID [2022-02-21 00:02:27,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {111588#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_#t~nondet14#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_~p10~0#1, main_~lk10~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;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; {111588#true} is VALID [2022-02-21 00:02:27,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {111588#true} assume !false;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {111588#true} is VALID [2022-02-21 00:02:27,342 INFO L290 TraceCheckUtils]: 3: Hoare triple {111588#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;main_~lk10~0#1 := 0; {111588#true} is VALID [2022-02-21 00:02:27,342 INFO L290 TraceCheckUtils]: 4: Hoare triple {111588#true} assume !(0 != main_~p1~0#1); {111588#true} is VALID [2022-02-21 00:02:27,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {111588#true} assume !(0 != main_~p2~0#1); {111588#true} is VALID [2022-02-21 00:02:27,343 INFO L290 TraceCheckUtils]: 6: Hoare triple {111588#true} assume !(0 != main_~p3~0#1); {111588#true} is VALID [2022-02-21 00:02:27,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {111588#true} assume !(0 != main_~p4~0#1); {111588#true} is VALID [2022-02-21 00:02:27,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {111588#true} assume !(0 != main_~p5~0#1); {111588#true} is VALID [2022-02-21 00:02:27,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {111588#true} assume !(0 != main_~p6~0#1); {111588#true} is VALID [2022-02-21 00:02:27,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {111588#true} assume !(0 != main_~p7~0#1); {111588#true} is VALID [2022-02-21 00:02:27,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {111588#true} assume !(0 != main_~p8~0#1); {111590#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:27,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {111590#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {111590#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:27,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {111590#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {111590#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:27,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {111590#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p1~0#1); {111590#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:27,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {111590#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p2~0#1); {111590#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:27,345 INFO L290 TraceCheckUtils]: 16: Hoare triple {111590#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p3~0#1); {111590#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:27,345 INFO L290 TraceCheckUtils]: 17: Hoare triple {111590#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p4~0#1); {111590#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:27,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {111590#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p5~0#1); {111590#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:27,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {111590#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p6~0#1); {111590#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:27,346 INFO L290 TraceCheckUtils]: 20: Hoare triple {111590#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p7~0#1); {111590#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:27,346 INFO L290 TraceCheckUtils]: 21: Hoare triple {111590#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p8~0#1; {111589#false} is VALID [2022-02-21 00:02:27,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {111589#false} assume 1 != main_~lk8~0#1; {111589#false} is VALID [2022-02-21 00:02:27,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {111589#false} assume !false; {111589#false} is VALID [2022-02-21 00:02:27,347 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:27,347 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:27,347 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243644627] [2022-02-21 00:02:27,347 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243644627] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:27,347 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:27,347 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:27,348 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020309333] [2022-02-21 00:02:27,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:27,349 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:02:27,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:27,351 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:02:27,362 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:02:27,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:27,363 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:27,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:27,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:27,363 INFO L87 Difference]: Start difference. First operand 5637 states and 7491 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:02:29,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:29,020 INFO L93 Difference]: Finished difference Result 7303 states and 9476 transitions. [2022-02-21 00:02:29,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:29,021 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:02:29,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:29,021 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:02:29,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-02-21 00:02:29,021 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:02:29,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-02-21 00:02:29,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-02-21 00:02:29,091 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:30,776 INFO L225 Difference]: With dead ends: 7303 [2022-02-21 00:02:30,776 INFO L226 Difference]: Without dead ends: 7303 [2022-02-21 00:02:30,776 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:30,777 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 41 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 150 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:30,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 150 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:30,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7303 states. [2022-02-21 00:02:30,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7303 to 7301. [2022-02-21 00:02:30,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:30,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7303 states. Second operand has 7301 states, 7300 states have (on average 1.297945205479452) internal successors, (9475), 7300 states have internal predecessors, (9475), 0 states have call successors, (0), 0 states 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:30,860 INFO L74 IsIncluded]: Start isIncluded. First operand 7303 states. Second operand has 7301 states, 7300 states have (on average 1.297945205479452) internal successors, (9475), 7300 states have internal predecessors, (9475), 0 states have call successors, (0), 0 states 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:30,867 INFO L87 Difference]: Start difference. First operand 7303 states. Second operand has 7301 states, 7300 states have (on average 1.297945205479452) internal successors, (9475), 7300 states have internal predecessors, (9475), 0 states have call successors, (0), 0 states 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:32,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:32,421 INFO L93 Difference]: Finished difference Result 7303 states and 9476 transitions. [2022-02-21 00:02:32,421 INFO L276 IsEmpty]: Start isEmpty. Operand 7303 states and 9476 transitions. [2022-02-21 00:02:32,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:32,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:32,434 INFO L74 IsIncluded]: Start isIncluded. First operand has 7301 states, 7300 states have (on average 1.297945205479452) internal successors, (9475), 7300 states have internal predecessors, (9475), 0 states have call successors, (0), 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 7303 states. [2022-02-21 00:02:32,440 INFO L87 Difference]: Start difference. First operand has 7301 states, 7300 states have (on average 1.297945205479452) internal successors, (9475), 7300 states have internal predecessors, (9475), 0 states have call successors, (0), 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 7303 states. [2022-02-21 00:02:33,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:33,967 INFO L93 Difference]: Finished difference Result 7303 states and 9476 transitions. [2022-02-21 00:02:33,967 INFO L276 IsEmpty]: Start isEmpty. Operand 7303 states and 9476 transitions. [2022-02-21 00:02:33,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:33,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:33,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:33,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:33,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7301 states, 7300 states have (on average 1.297945205479452) internal successors, (9475), 7300 states have internal predecessors, (9475), 0 states have call successors, (0), 0 states 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:35,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7301 states to 7301 states and 9475 transitions. [2022-02-21 00:02:35,615 INFO L78 Accepts]: Start accepts. Automaton has 7301 states and 9475 transitions. Word has length 24 [2022-02-21 00:02:35,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:35,615 INFO L470 AbstractCegarLoop]: Abstraction has 7301 states and 9475 transitions. [2022-02-21 00:02:35,616 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:02:35,616 INFO L276 IsEmpty]: Start isEmpty. Operand 7301 states and 9475 transitions. [2022-02-21 00:02:35,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-21 00:02:35,619 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:35,619 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:35,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-21 00:02:35,632 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:35,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:35,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1327225645, now seen corresponding path program 1 times [2022-02-21 00:02:35,632 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:35,632 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862194400] [2022-02-21 00:02:35,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:35,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:35,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {140803#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(16, 2);call #Ultimate.allocInit(12, 3); {140803#true} is VALID [2022-02-21 00:02:35,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {140803#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_#t~nondet14#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_~p10~0#1, main_~lk10~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;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; {140803#true} is VALID [2022-02-21 00:02:35,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {140803#true} assume !false;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {140803#true} is VALID [2022-02-21 00:02:35,654 INFO L290 TraceCheckUtils]: 3: Hoare triple {140803#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;main_~lk10~0#1 := 0; {140803#true} is VALID [2022-02-21 00:02:35,654 INFO L290 TraceCheckUtils]: 4: Hoare triple {140803#true} assume !(0 != main_~p1~0#1); {140803#true} is VALID [2022-02-21 00:02:35,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {140803#true} assume !(0 != main_~p2~0#1); {140803#true} is VALID [2022-02-21 00:02:35,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {140803#true} assume !(0 != main_~p3~0#1); {140803#true} is VALID [2022-02-21 00:02:35,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {140803#true} assume !(0 != main_~p4~0#1); {140803#true} is VALID [2022-02-21 00:02:35,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {140803#true} assume !(0 != main_~p5~0#1); {140803#true} is VALID [2022-02-21 00:02:35,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {140803#true} assume !(0 != main_~p6~0#1); {140803#true} is VALID [2022-02-21 00:02:35,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {140803#true} assume !(0 != main_~p7~0#1); {140803#true} is VALID [2022-02-21 00:02:35,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {140803#true} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {140805#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:02:35,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {140805#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {140805#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:02:35,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {140805#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {140805#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:02:35,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {140805#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p1~0#1); {140805#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:02:35,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {140805#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p2~0#1); {140805#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:02:35,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {140805#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p3~0#1); {140805#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:02:35,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {140805#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p4~0#1); {140805#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:02:35,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {140805#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p5~0#1); {140805#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:02:35,657 INFO L290 TraceCheckUtils]: 19: Hoare triple {140805#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p6~0#1); {140805#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:02:35,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {140805#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p7~0#1); {140805#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:02:35,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {140805#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p8~0#1); {140804#false} is VALID [2022-02-21 00:02:35,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {140804#false} assume 0 != main_~p9~0#1; {140804#false} is VALID [2022-02-21 00:02:35,658 INFO L290 TraceCheckUtils]: 23: Hoare triple {140804#false} assume 1 != main_~lk9~0#1; {140804#false} is VALID [2022-02-21 00:02:35,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {140804#false} assume !false; {140804#false} is VALID [2022-02-21 00:02:35,658 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:35,658 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:35,659 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862194400] [2022-02-21 00:02:35,659 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862194400] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:35,659 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:35,659 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:35,659 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959497896] [2022-02-21 00:02:35,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:35,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-21 00:02:35,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:35,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:35,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:35,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:35,673 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:35,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:35,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:35,674 INFO L87 Difference]: Start difference. First operand 7301 states and 9475 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:37,347 INFO L93 Difference]: Finished difference Result 7431 states and 9476 transitions. [2022-02-21 00:02:37,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:37,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-21 00:02:37,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:37,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-02-21 00:02:37,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:37,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-02-21 00:02:37,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2022-02-21 00:02:37,407 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:39,208 INFO L225 Difference]: With dead ends: 7431 [2022-02-21 00:02:39,208 INFO L226 Difference]: Without dead ends: 7431 [2022-02-21 00:02:39,209 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:39,209 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 43 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 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:39,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 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:39,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7431 states. [2022-02-21 00:02:39,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7431 to 7429. [2022-02-21 00:02:39,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:39,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7431 states. Second operand has 7429 states, 7428 states have (on average 1.2755788906838987) internal successors, (9475), 7428 states have internal predecessors, (9475), 0 states have call successors, (0), 0 states 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:39,280 INFO L74 IsIncluded]: Start isIncluded. First operand 7431 states. Second operand has 7429 states, 7428 states have (on average 1.2755788906838987) internal successors, (9475), 7428 states have internal predecessors, (9475), 0 states have call successors, (0), 0 states 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:39,288 INFO L87 Difference]: Start difference. First operand 7431 states. Second operand has 7429 states, 7428 states have (on average 1.2755788906838987) internal successors, (9475), 7428 states have internal predecessors, (9475), 0 states have call successors, (0), 0 states 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,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:40,707 INFO L93 Difference]: Finished difference Result 7431 states and 9476 transitions. [2022-02-21 00:02:40,707 INFO L276 IsEmpty]: Start isEmpty. Operand 7431 states and 9476 transitions. [2022-02-21 00:02:40,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:40,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:40,717 INFO L74 IsIncluded]: Start isIncluded. First operand has 7429 states, 7428 states have (on average 1.2755788906838987) internal successors, (9475), 7428 states have internal predecessors, (9475), 0 states have call successors, (0), 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 7431 states. [2022-02-21 00:02:40,720 INFO L87 Difference]: Start difference. First operand has 7429 states, 7428 states have (on average 1.2755788906838987) internal successors, (9475), 7428 states have internal predecessors, (9475), 0 states have call successors, (0), 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 7431 states. [2022-02-21 00:02:42,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:42,278 INFO L93 Difference]: Finished difference Result 7431 states and 9476 transitions. [2022-02-21 00:02:42,278 INFO L276 IsEmpty]: Start isEmpty. Operand 7431 states and 9476 transitions. [2022-02-21 00:02:42,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:42,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:42,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:42,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:42,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7429 states, 7428 states have (on average 1.2755788906838987) internal successors, (9475), 7428 states have internal predecessors, (9475), 0 states have call successors, (0), 0 states 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,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7429 states to 7429 states and 9475 transitions. [2022-02-21 00:02:43,900 INFO L78 Accepts]: Start accepts. Automaton has 7429 states and 9475 transitions. Word has length 25 [2022-02-21 00:02:43,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:43,900 INFO L470 AbstractCegarLoop]: Abstraction has 7429 states and 9475 transitions. [2022-02-21 00:02:43,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,901 INFO L276 IsEmpty]: Start isEmpty. Operand 7429 states and 9475 transitions. [2022-02-21 00:02:43,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-21 00:02:43,904 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:43,904 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:43,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-21 00:02:43,904 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:43,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:43,905 INFO L85 PathProgramCache]: Analyzing trace with hash 316108395, now seen corresponding path program 1 times [2022-02-21 00:02:43,905 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:43,905 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417402547] [2022-02-21 00:02:43,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:43,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:43,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {170530#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(16, 2);call #Ultimate.allocInit(12, 3); {170530#true} is VALID [2022-02-21 00:02:43,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {170530#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_#t~nondet14#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_~p10~0#1, main_~lk10~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;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; {170530#true} is VALID [2022-02-21 00:02:43,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {170530#true} assume !false;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {170530#true} is VALID [2022-02-21 00:02:43,939 INFO L290 TraceCheckUtils]: 3: Hoare triple {170530#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;main_~lk10~0#1 := 0; {170530#true} is VALID [2022-02-21 00:02:43,939 INFO L290 TraceCheckUtils]: 4: Hoare triple {170530#true} assume !(0 != main_~p1~0#1); {170530#true} is VALID [2022-02-21 00:02:43,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {170530#true} assume !(0 != main_~p2~0#1); {170530#true} is VALID [2022-02-21 00:02:43,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {170530#true} assume !(0 != main_~p3~0#1); {170530#true} is VALID [2022-02-21 00:02:43,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {170530#true} assume !(0 != main_~p4~0#1); {170530#true} is VALID [2022-02-21 00:02:43,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {170530#true} assume !(0 != main_~p5~0#1); {170530#true} is VALID [2022-02-21 00:02:43,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {170530#true} assume !(0 != main_~p6~0#1); {170530#true} is VALID [2022-02-21 00:02:43,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {170530#true} assume !(0 != main_~p7~0#1); {170530#true} is VALID [2022-02-21 00:02:43,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {170530#true} assume !(0 != main_~p8~0#1); {170530#true} is VALID [2022-02-21 00:02:43,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {170530#true} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {170532#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:02:43,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {170532#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {170532#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:02:43,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {170532#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p1~0#1); {170532#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:02:43,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {170532#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p2~0#1); {170532#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:02:43,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {170532#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p3~0#1); {170532#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:02:43,943 INFO L290 TraceCheckUtils]: 17: Hoare triple {170532#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p4~0#1); {170532#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:02:43,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {170532#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p5~0#1); {170532#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:02:43,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {170532#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p6~0#1); {170532#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:02:43,943 INFO L290 TraceCheckUtils]: 20: Hoare triple {170532#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p7~0#1); {170532#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:02:43,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {170532#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p8~0#1); {170532#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:02:43,944 INFO L290 TraceCheckUtils]: 22: Hoare triple {170532#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume 0 != main_~p9~0#1; {170532#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:02:43,944 INFO L290 TraceCheckUtils]: 23: Hoare triple {170532#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume 1 != main_~lk9~0#1; {170531#false} is VALID [2022-02-21 00:02:43,944 INFO L290 TraceCheckUtils]: 24: Hoare triple {170531#false} assume !false; {170531#false} is VALID [2022-02-21 00:02:43,944 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,945 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:43,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417402547] [2022-02-21 00:02:43,945 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417402547] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:43,945 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:43,945 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:43,945 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294831050] [2022-02-21 00:02:43,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:43,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-21 00:02:43,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:43,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:43,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:43,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:43,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:43,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:43,962 INFO L87 Difference]: Start difference. First operand 7429 states and 9475 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:47,936 INFO L93 Difference]: Finished difference Result 12295 states and 15492 transitions. [2022-02-21 00:02:47,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:47,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-21 00:02:47,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:47,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2022-02-21 00:02:47,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2022-02-21 00:02:47,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 94 transitions. [2022-02-21 00:02:47,985 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:52,291 INFO L225 Difference]: With dead ends: 12295 [2022-02-21 00:02:52,291 INFO L226 Difference]: Without dead ends: 12295 [2022-02-21 00:02:52,291 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,292 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 24 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 111 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:52,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 111 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:52,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12295 states. [2022-02-21 00:02:52,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12295 to 11269. [2022-02-21 00:02:52,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:52,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12295 states. Second operand has 11269 states, 11268 states have (on average 1.238462903798367) internal successors, (13955), 11268 states have internal predecessors, (13955), 0 states have call successors, (0), 0 states 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,397 INFO L74 IsIncluded]: Start isIncluded. First operand 12295 states. Second operand has 11269 states, 11268 states have (on average 1.238462903798367) internal successors, (13955), 11268 states have internal predecessors, (13955), 0 states have call successors, (0), 0 states 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,407 INFO L87 Difference]: Start difference. First operand 12295 states. Second operand has 11269 states, 11268 states have (on average 1.238462903798367) internal successors, (13955), 11268 states have internal predecessors, (13955), 0 states have call successors, (0), 0 states 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,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:56,946 INFO L93 Difference]: Finished difference Result 12295 states and 15492 transitions. [2022-02-21 00:02:56,946 INFO L276 IsEmpty]: Start isEmpty. Operand 12295 states and 15492 transitions. [2022-02-21 00:02:56,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:56,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:56,967 INFO L74 IsIncluded]: Start isIncluded. First operand has 11269 states, 11268 states have (on average 1.238462903798367) internal successors, (13955), 11268 states have internal predecessors, (13955), 0 states have call successors, (0), 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 12295 states. [2022-02-21 00:02:56,980 INFO L87 Difference]: Start difference. First operand has 11269 states, 11268 states have (on average 1.238462903798367) internal successors, (13955), 11268 states have internal predecessors, (13955), 0 states have call successors, (0), 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 12295 states. [2022-02-21 00:03:00,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:00,909 INFO L93 Difference]: Finished difference Result 12295 states and 15492 transitions. [2022-02-21 00:03:00,909 INFO L276 IsEmpty]: Start isEmpty. Operand 12295 states and 15492 transitions. [2022-02-21 00:03:00,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:00,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:00,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:00,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:00,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11269 states, 11268 states have (on average 1.238462903798367) internal successors, (13955), 11268 states have internal predecessors, (13955), 0 states have call successors, (0), 0 states 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,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11269 states to 11269 states and 13955 transitions. [2022-02-21 00:03:04,264 INFO L78 Accepts]: Start accepts. Automaton has 11269 states and 13955 transitions. Word has length 25 [2022-02-21 00:03:04,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:04,264 INFO L470 AbstractCegarLoop]: Abstraction has 11269 states and 13955 transitions. [2022-02-21 00:03:04,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,264 INFO L276 IsEmpty]: Start isEmpty. Operand 11269 states and 13955 transitions. [2022-02-21 00:03:04,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-21 00:03:04,269 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:04,269 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:04,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-02-21 00:03:04,269 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:03:04,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:04,270 INFO L85 PathProgramCache]: Analyzing trace with hash -270697619, now seen corresponding path program 1 times [2022-02-21 00:03:04,270 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:04,270 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797012386] [2022-02-21 00:03:04,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:04,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:04,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {218689#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(16, 2);call #Ultimate.allocInit(12, 3); {218689#true} is VALID [2022-02-21 00:03:04,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {218689#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_#t~nondet14#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_~p10~0#1, main_~lk10~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;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; {218689#true} is VALID [2022-02-21 00:03:04,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {218689#true} assume !false;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {218689#true} is VALID [2022-02-21 00:03:04,311 INFO L290 TraceCheckUtils]: 3: Hoare triple {218689#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;main_~lk10~0#1 := 0; {218689#true} is VALID [2022-02-21 00:03:04,312 INFO L290 TraceCheckUtils]: 4: Hoare triple {218689#true} assume !(0 != main_~p1~0#1); {218689#true} is VALID [2022-02-21 00:03:04,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {218689#true} assume !(0 != main_~p2~0#1); {218689#true} is VALID [2022-02-21 00:03:04,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {218689#true} assume !(0 != main_~p3~0#1); {218689#true} is VALID [2022-02-21 00:03:04,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {218689#true} assume !(0 != main_~p4~0#1); {218689#true} is VALID [2022-02-21 00:03:04,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {218689#true} assume !(0 != main_~p5~0#1); {218689#true} is VALID [2022-02-21 00:03:04,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {218689#true} assume !(0 != main_~p6~0#1); {218689#true} is VALID [2022-02-21 00:03:04,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {218689#true} assume !(0 != main_~p7~0#1); {218689#true} is VALID [2022-02-21 00:03:04,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {218689#true} assume !(0 != main_~p8~0#1); {218689#true} is VALID [2022-02-21 00:03:04,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {218689#true} assume !(0 != main_~p9~0#1); {218691#(= |ULTIMATE.start_main_~p9~0#1| 0)} is VALID [2022-02-21 00:03:04,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {218691#(= |ULTIMATE.start_main_~p9~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {218691#(= |ULTIMATE.start_main_~p9~0#1| 0)} is VALID [2022-02-21 00:03:04,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {218691#(= |ULTIMATE.start_main_~p9~0#1| 0)} assume !(0 != main_~p1~0#1); {218691#(= |ULTIMATE.start_main_~p9~0#1| 0)} is VALID [2022-02-21 00:03:04,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {218691#(= |ULTIMATE.start_main_~p9~0#1| 0)} assume !(0 != main_~p2~0#1); {218691#(= |ULTIMATE.start_main_~p9~0#1| 0)} is VALID [2022-02-21 00:03:04,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {218691#(= |ULTIMATE.start_main_~p9~0#1| 0)} assume !(0 != main_~p3~0#1); {218691#(= |ULTIMATE.start_main_~p9~0#1| 0)} is VALID [2022-02-21 00:03:04,314 INFO L290 TraceCheckUtils]: 17: Hoare triple {218691#(= |ULTIMATE.start_main_~p9~0#1| 0)} assume !(0 != main_~p4~0#1); {218691#(= |ULTIMATE.start_main_~p9~0#1| 0)} is VALID [2022-02-21 00:03:04,314 INFO L290 TraceCheckUtils]: 18: Hoare triple {218691#(= |ULTIMATE.start_main_~p9~0#1| 0)} assume !(0 != main_~p5~0#1); {218691#(= |ULTIMATE.start_main_~p9~0#1| 0)} is VALID [2022-02-21 00:03:04,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {218691#(= |ULTIMATE.start_main_~p9~0#1| 0)} assume !(0 != main_~p6~0#1); {218691#(= |ULTIMATE.start_main_~p9~0#1| 0)} is VALID [2022-02-21 00:03:04,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {218691#(= |ULTIMATE.start_main_~p9~0#1| 0)} assume !(0 != main_~p7~0#1); {218691#(= |ULTIMATE.start_main_~p9~0#1| 0)} is VALID [2022-02-21 00:03:04,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {218691#(= |ULTIMATE.start_main_~p9~0#1| 0)} assume !(0 != main_~p8~0#1); {218691#(= |ULTIMATE.start_main_~p9~0#1| 0)} is VALID [2022-02-21 00:03:04,315 INFO L290 TraceCheckUtils]: 22: Hoare triple {218691#(= |ULTIMATE.start_main_~p9~0#1| 0)} assume 0 != main_~p9~0#1; {218690#false} is VALID [2022-02-21 00:03:04,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {218690#false} assume 1 != main_~lk9~0#1; {218690#false} is VALID [2022-02-21 00:03:04,316 INFO L290 TraceCheckUtils]: 24: Hoare triple {218690#false} assume !false; {218690#false} is VALID [2022-02-21 00:03:04,316 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,316 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:04,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797012386] [2022-02-21 00:03:04,316 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797012386] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:04,316 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:04,316 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:03:04,317 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677571062] [2022-02-21 00:03:04,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:04,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-21 00:03:04,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:04,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:04,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:04,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:03:04,330 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:04,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:03:04,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:03:04,330 INFO L87 Difference]: Start difference. First operand 11269 states and 13955 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:10,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:10,417 INFO L93 Difference]: Finished difference Result 14343 states and 17156 transitions. [2022-02-21 00:03:10,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:03:10,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-21 00:03:10,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:10,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:10,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2022-02-21 00:03:10,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:10,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2022-02-21 00:03:10,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 109 transitions. [2022-02-21 00:03:10,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:17,041 INFO L225 Difference]: With dead ends: 14343 [2022-02-21 00:03:17,041 INFO L226 Difference]: Without dead ends: 14343 [2022-02-21 00:03:17,041 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:17,041 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 40 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 151 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:17,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 151 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:17,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14343 states. [2022-02-21 00:03:17,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14343 to 14341. [2022-02-21 00:03:17,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:17,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14343 states. Second operand has 14341 states, 14340 states have (on average 1.1963040446304045) internal successors, (17155), 14340 states have internal predecessors, (17155), 0 states have call successors, (0), 0 states 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:17,207 INFO L74 IsIncluded]: Start isIncluded. First operand 14343 states. Second operand has 14341 states, 14340 states have (on average 1.1963040446304045) internal successors, (17155), 14340 states have internal predecessors, (17155), 0 states have call successors, (0), 0 states 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:17,220 INFO L87 Difference]: Start difference. First operand 14343 states. Second operand has 14341 states, 14340 states have (on average 1.1963040446304045) internal successors, (17155), 14340 states have internal predecessors, (17155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)