./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fabf091179f48b7141dc193b5040f4974c042bd8a2afb03b99137d693bf63ce7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 06:42:47,802 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 06:42:47,805 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 06:42:47,847 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 06:42:47,848 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 06:42:47,849 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 06:42:47,851 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 06:42:47,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 06:42:47,855 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 06:42:47,859 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 06:42:47,860 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 06:42:47,862 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 06:42:47,862 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 06:42:47,863 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 06:42:47,864 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 06:42:47,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 06:42:47,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 06:42:47,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 06:42:47,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 06:42:47,876 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 06:42:47,878 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 06:42:47,879 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 06:42:47,879 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 06:42:47,880 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 06:42:47,881 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 06:42:47,888 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 06:42:47,888 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 06:42:47,889 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 06:42:47,890 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 06:42:47,890 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 06:42:47,891 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 06:42:47,891 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 06:42:47,894 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 06:42:47,894 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 06:42:47,895 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 06:42:47,896 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 06:42:47,896 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 06:42:47,897 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 06:42:47,897 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 06:42:47,897 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 06:42:47,898 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 06:42:47,899 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 06:42:47,900 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 06:42:47,928 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 06:42:47,929 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 06:42:47,929 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 06:42:47,929 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 06:42:47,930 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 06:42:47,930 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 06:42:47,931 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 06:42:47,931 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 06:42:47,931 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 06:42:47,932 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 06:42:47,932 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 06:42:47,932 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 06:42:47,932 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 06:42:47,933 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 06:42:47,933 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 06:42:47,933 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 06:42:47,933 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 06:42:47,933 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 06:42:47,933 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 06:42:47,934 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 06:42:47,935 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 06:42:47,935 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 06:42:47,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 06:42:47,935 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 06:42:47,935 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 06:42:47,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:42:47,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 06:42:47,936 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 06:42:47,936 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 06:42:47,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 06:42:47,937 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 -> fabf091179f48b7141dc193b5040f4974c042bd8a2afb03b99137d693bf63ce7 [2022-07-23 06:42:48,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 06:42:48,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 06:42:48,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 06:42:48,157 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 06:42:48,158 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 06:42:48,159 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i [2022-07-23 06:42:48,219 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2939fb40/ccd7575669404b53908e8681fe68829f/FLAGaef6fe57b [2022-07-23 06:42:48,626 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 06:42:48,626 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i [2022-07-23 06:42:48,638 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2939fb40/ccd7575669404b53908e8681fe68829f/FLAGaef6fe57b [2022-07-23 06:42:48,972 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2939fb40/ccd7575669404b53908e8681fe68829f [2022-07-23 06:42:48,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 06:42:48,975 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 06:42:48,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 06:42:48,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 06:42:48,986 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 06:42:48,986 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:42:48" (1/1) ... [2022-07-23 06:42:48,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34ef268c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:42:48, skipping insertion in model container [2022-07-23 06:42:48,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:42:48" (1/1) ... [2022-07-23 06:42:48,993 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 06:42:49,022 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:42:49,323 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/list-ext3-properties/sll_of_sll_nondet_append-1.i[24987,25000] [2022-07-23 06:42:49,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:42:49,336 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 06:42:49,379 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/list-ext3-properties/sll_of_sll_nondet_append-1.i[24987,25000] [2022-07-23 06:42:49,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:42:49,403 INFO L208 MainTranslator]: Completed translation [2022-07-23 06:42:49,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:42:49 WrapperNode [2022-07-23 06:42:49,404 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 06:42:49,405 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 06:42:49,406 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 06:42:49,406 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 06:42:49,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:42:49" (1/1) ... [2022-07-23 06:42:49,424 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:42:49" (1/1) ... [2022-07-23 06:42:49,447 INFO L137 Inliner]: procedures = 129, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 185 [2022-07-23 06:42:49,448 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 06:42:49,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 06:42:49,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 06:42:49,449 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 06:42:49,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:42:49" (1/1) ... [2022-07-23 06:42:49,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:42:49" (1/1) ... [2022-07-23 06:42:49,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:42:49" (1/1) ... [2022-07-23 06:42:49,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:42:49" (1/1) ... [2022-07-23 06:42:49,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:42:49" (1/1) ... [2022-07-23 06:42:49,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:42:49" (1/1) ... [2022-07-23 06:42:49,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:42:49" (1/1) ... [2022-07-23 06:42:49,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 06:42:49,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 06:42:49,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 06:42:49,481 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 06:42:49,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:42:49" (1/1) ... [2022-07-23 06:42:49,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:42:49,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:42:49,516 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-07-23 06:42:49,518 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-07-23 06:42:49,550 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-23 06:42:49,551 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-23 06:42:49,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 06:42:49,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 06:42:49,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 06:42:49,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 06:42:49,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 06:42:49,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 06:42:49,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 06:42:49,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 06:42:49,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 06:42:49,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 06:42:49,703 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 06:42:49,720 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 06:42:49,753 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-23 06:42:50,116 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 06:42:50,123 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 06:42:50,123 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-07-23 06:42:50,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:42:50 BoogieIcfgContainer [2022-07-23 06:42:50,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 06:42:50,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 06:42:50,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 06:42:50,134 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 06:42:50,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 06:42:48" (1/3) ... [2022-07-23 06:42:50,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52dbce20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:42:50, skipping insertion in model container [2022-07-23 06:42:50,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:42:49" (2/3) ... [2022-07-23 06:42:50,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52dbce20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:42:50, skipping insertion in model container [2022-07-23 06:42:50,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:42:50" (3/3) ... [2022-07-23 06:42:50,137 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-1.i [2022-07-23 06:42:50,149 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 06:42:50,150 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2022-07-23 06:42:50,206 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 06:42:50,212 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@31c3fabb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5885e876 [2022-07-23 06:42:50,212 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2022-07-23 06:42:50,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 115 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:50,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-23 06:42:50,220 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:42:50,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-23 06:42:50,221 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 06:42:50,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:42:50,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1083078, now seen corresponding path program 1 times [2022-07-23 06:42:50,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:42:50,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253801066] [2022-07-23 06:42:50,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:42:50,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:42:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:42:50,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:42:50,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:42:50,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253801066] [2022-07-23 06:42:50,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253801066] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:42:50,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:42:50,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:42:50,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858806910] [2022-07-23 06:42:50,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:42:50,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-23 06:42:50,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:42:50,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-23 06:42:50,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-23 06:42:50,432 INFO L87 Difference]: Start difference. First operand has 117 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 115 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 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.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:50,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:42:50,449 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2022-07-23 06:42:50,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-23 06:42:50,452 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-07-23 06:42:50,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:42:50,458 INFO L225 Difference]: With dead ends: 117 [2022-07-23 06:42:50,459 INFO L226 Difference]: Without dead ends: 111 [2022-07-23 06:42:50,460 INFO L412 NwaCegarLoop]: 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-07-23 06:42:50,463 INFO L413 NwaCegarLoop]: 132 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, 132 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-07-23 06:42:50,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:42:50,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-23 06:42:50,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-07-23 06:42:50,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 69 states have (on average 1.7971014492753623) internal successors, (124), 110 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-07-23 06:42:50,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2022-07-23 06:42:50,494 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 4 [2022-07-23 06:42:50,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:42:50,494 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2022-07-23 06:42:50,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:50,495 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2022-07-23 06:42:50,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-23 06:42:50,495 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:42:50,495 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-23 06:42:50,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 06:42:50,496 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 06:42:50,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:42:50,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1079730, now seen corresponding path program 1 times [2022-07-23 06:42:50,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:42:50,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008774519] [2022-07-23 06:42:50,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:42:50,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:42:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:42:50,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:42:50,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:42:50,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008774519] [2022-07-23 06:42:50,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008774519] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:42:50,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:42:50,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:42:50,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960618980] [2022-07-23 06:42:50,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:42:50,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:42:50,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:42:50,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:42:50,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:42:50,541 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:50,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:42:50,635 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2022-07-23 06:42:50,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:42:50,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-07-23 06:42:50,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:42:50,637 INFO L225 Difference]: With dead ends: 136 [2022-07-23 06:42:50,637 INFO L226 Difference]: Without dead ends: 136 [2022-07-23 06:42:50,638 INFO L412 NwaCegarLoop]: 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-07-23 06:42:50,639 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 113 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:42:50,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 99 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:42:50,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-23 06:42:50,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 109. [2022-07-23 06:42:50,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 69 states have (on average 1.7681159420289856) internal successors, (122), 108 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-07-23 06:42:50,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2022-07-23 06:42:50,651 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 4 [2022-07-23 06:42:50,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:42:50,651 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2022-07-23 06:42:50,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:50,652 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2022-07-23 06:42:50,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-23 06:42:50,652 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:42:50,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-23 06:42:50,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 06:42:50,653 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 06:42:50,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:42:50,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1079731, now seen corresponding path program 1 times [2022-07-23 06:42:50,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:42:50,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336548270] [2022-07-23 06:42:50,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:42:50,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:42:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:42:50,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:42:50,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:42:50,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336548270] [2022-07-23 06:42:50,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336548270] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:42:50,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:42:50,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:42:50,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177842163] [2022-07-23 06:42:50,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:42:50,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:42:50,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:42:50,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:42:50,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:42:50,722 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:50,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:42:50,746 INFO L93 Difference]: Finished difference Result 157 states and 175 transitions. [2022-07-23 06:42:50,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:42:50,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-07-23 06:42:50,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:42:50,748 INFO L225 Difference]: With dead ends: 157 [2022-07-23 06:42:50,748 INFO L226 Difference]: Without dead ends: 157 [2022-07-23 06:42:50,749 INFO L412 NwaCegarLoop]: 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-07-23 06:42:50,750 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 52 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:42:50,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 226 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:42:50,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-23 06:42:50,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 110. [2022-07-23 06:42:50,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 70 states have (on average 1.7571428571428571) internal successors, (123), 109 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:50,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 123 transitions. [2022-07-23 06:42:50,759 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 123 transitions. Word has length 4 [2022-07-23 06:42:50,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:42:50,759 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 123 transitions. [2022-07-23 06:42:50,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:50,759 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2022-07-23 06:42:50,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-23 06:42:50,760 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:42:50,760 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:42:50,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 06:42:50,761 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 06:42:50,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:42:50,761 INFO L85 PathProgramCache]: Analyzing trace with hash -336207078, now seen corresponding path program 1 times [2022-07-23 06:42:50,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:42:50,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319124167] [2022-07-23 06:42:50,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:42:50,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:42:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:42:50,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:42:50,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:42:50,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319124167] [2022-07-23 06:42:50,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319124167] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:42:50,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310125397] [2022-07-23 06:42:50,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:42:50,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:42:50,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:42:50,813 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:42:50,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-23 06:42:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:42:50,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 06:42:50,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:42:50,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:42:50,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:42:51,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:42:51,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310125397] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:42:51,013 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:42:51,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-23 06:42:51,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51262912] [2022-07-23 06:42:51,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:42:51,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:42:51,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:42:51,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:42:51,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:42:51,018 INFO L87 Difference]: Start difference. First operand 110 states and 123 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-07-23 06:42:51,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:42:51,086 INFO L93 Difference]: Finished difference Result 244 states and 268 transitions. [2022-07-23 06:42:51,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:42:51,088 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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 9 [2022-07-23 06:42:51,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:42:51,092 INFO L225 Difference]: With dead ends: 244 [2022-07-23 06:42:51,094 INFO L226 Difference]: Without dead ends: 244 [2022-07-23 06:42:51,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:42:51,095 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 319 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:42:51,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 603 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:42:51,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-23 06:42:51,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 173. [2022-07-23 06:42:51,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 133 states have (on average 1.7518796992481203) internal successors, (233), 172 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:51,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 233 transitions. [2022-07-23 06:42:51,123 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 233 transitions. Word has length 9 [2022-07-23 06:42:51,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:42:51,123 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 233 transitions. [2022-07-23 06:42:51,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-07-23 06:42:51,124 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 233 transitions. [2022-07-23 06:42:51,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 06:42:51,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:42:51,125 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:42:51,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-23 06:42:51,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:42:51,338 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 06:42:51,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:42:51,339 INFO L85 PathProgramCache]: Analyzing trace with hash -991177183, now seen corresponding path program 1 times [2022-07-23 06:42:51,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:42:51,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020661859] [2022-07-23 06:42:51,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:42:51,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:42:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:42:51,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:42:51,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:42:51,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020661859] [2022-07-23 06:42:51,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020661859] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:42:51,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:42:51,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:42:51,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64756895] [2022-07-23 06:42:51,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:42:51,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:42:51,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:42:51,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:42:51,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:42:51,426 INFO L87 Difference]: Start difference. First operand 173 states and 233 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:51,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:42:51,520 INFO L93 Difference]: Finished difference Result 329 states and 444 transitions. [2022-07-23 06:42:51,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:42:51,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-23 06:42:51,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:42:51,523 INFO L225 Difference]: With dead ends: 329 [2022-07-23 06:42:51,523 INFO L226 Difference]: Without dead ends: 329 [2022-07-23 06:42:51,524 INFO L412 NwaCegarLoop]: 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-07-23 06:42:51,525 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 111 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:42:51,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 270 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:42:51,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-07-23 06:42:51,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 172. [2022-07-23 06:42:51,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 133 states have (on average 1.7293233082706767) internal successors, (230), 171 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:51,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 230 transitions. [2022-07-23 06:42:51,535 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 230 transitions. Word has length 11 [2022-07-23 06:42:51,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:42:51,536 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 230 transitions. [2022-07-23 06:42:51,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:51,536 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 230 transitions. [2022-07-23 06:42:51,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 06:42:51,537 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:42:51,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:42:51,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 06:42:51,537 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 06:42:51,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:42:51,538 INFO L85 PathProgramCache]: Analyzing trace with hash -991177182, now seen corresponding path program 1 times [2022-07-23 06:42:51,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:42:51,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073840179] [2022-07-23 06:42:51,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:42:51,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:42:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:42:51,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:42:51,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:42:51,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073840179] [2022-07-23 06:42:51,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073840179] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:42:51,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:42:51,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:42:51,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827160274] [2022-07-23 06:42:51,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:42:51,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:42:51,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:42:51,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:42:51,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:42:51,596 INFO L87 Difference]: Start difference. First operand 172 states and 230 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:51,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:42:51,699 INFO L93 Difference]: Finished difference Result 330 states and 442 transitions. [2022-07-23 06:42:51,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:42:51,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-23 06:42:51,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:42:51,701 INFO L225 Difference]: With dead ends: 330 [2022-07-23 06:42:51,702 INFO L226 Difference]: Without dead ends: 330 [2022-07-23 06:42:51,702 INFO L412 NwaCegarLoop]: 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-07-23 06:42:51,705 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 114 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:42:51,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 278 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:42:51,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-07-23 06:42:51,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 171. [2022-07-23 06:42:51,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 133 states have (on average 1.7067669172932332) internal successors, (227), 170 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:51,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 227 transitions. [2022-07-23 06:42:51,727 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 227 transitions. Word has length 11 [2022-07-23 06:42:51,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:42:51,728 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 227 transitions. [2022-07-23 06:42:51,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:51,728 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 227 transitions. [2022-07-23 06:42:51,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-23 06:42:51,729 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:42:51,729 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:42:51,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 06:42:51,729 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 06:42:51,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:42:51,730 INFO L85 PathProgramCache]: Analyzing trace with hash -661772220, now seen corresponding path program 1 times [2022-07-23 06:42:51,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:42:51,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557445636] [2022-07-23 06:42:51,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:42:51,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:42:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:42:51,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:42:51,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:42:51,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557445636] [2022-07-23 06:42:51,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557445636] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:42:51,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:42:51,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:42:51,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072426376] [2022-07-23 06:42:51,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:42:51,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:42:51,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:42:51,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:42:51,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:42:51,787 INFO L87 Difference]: Start difference. First operand 171 states and 227 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:51,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:42:51,853 INFO L93 Difference]: Finished difference Result 244 states and 312 transitions. [2022-07-23 06:42:51,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:42:51,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-23 06:42:51,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:42:51,855 INFO L225 Difference]: With dead ends: 244 [2022-07-23 06:42:51,855 INFO L226 Difference]: Without dead ends: 244 [2022-07-23 06:42:51,855 INFO L412 NwaCegarLoop]: 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-07-23 06:42:51,857 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 105 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:42:51,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 204 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:42:51,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-23 06:42:51,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 169. [2022-07-23 06:42:51,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 133 states have (on average 1.6616541353383458) internal successors, (221), 168 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:51,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 221 transitions. [2022-07-23 06:42:51,862 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 221 transitions. Word has length 12 [2022-07-23 06:42:51,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:42:51,863 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 221 transitions. [2022-07-23 06:42:51,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:51,863 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 221 transitions. [2022-07-23 06:42:51,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-23 06:42:51,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:42:51,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:42:51,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 06:42:51,865 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 06:42:51,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:42:51,866 INFO L85 PathProgramCache]: Analyzing trace with hash -661772219, now seen corresponding path program 1 times [2022-07-23 06:42:51,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:42:51,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330712023] [2022-07-23 06:42:51,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:42:51,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:42:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:42:51,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:42:51,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:42:51,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330712023] [2022-07-23 06:42:51,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330712023] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:42:51,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:42:51,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:42:51,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140502870] [2022-07-23 06:42:51,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:42:51,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:42:51,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:42:51,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:42:51,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:42:51,919 INFO L87 Difference]: Start difference. First operand 169 states and 221 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:51,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:42:51,993 INFO L93 Difference]: Finished difference Result 376 states and 459 transitions. [2022-07-23 06:42:51,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:42:51,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-23 06:42:51,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:42:51,995 INFO L225 Difference]: With dead ends: 376 [2022-07-23 06:42:51,995 INFO L226 Difference]: Without dead ends: 376 [2022-07-23 06:42:51,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:42:51,996 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 231 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:42:51,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 812 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:42:51,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-07-23 06:42:52,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 172. [2022-07-23 06:42:52,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 136 states have (on average 1.6470588235294117) internal successors, (224), 171 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:52,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 224 transitions. [2022-07-23 06:42:52,002 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 224 transitions. Word has length 12 [2022-07-23 06:42:52,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:42:52,002 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 224 transitions. [2022-07-23 06:42:52,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:52,002 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 224 transitions. [2022-07-23 06:42:52,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-23 06:42:52,003 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:42:52,003 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:42:52,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 06:42:52,003 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 06:42:52,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:42:52,004 INFO L85 PathProgramCache]: Analyzing trace with hash -51661170, now seen corresponding path program 1 times [2022-07-23 06:42:52,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:42:52,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525570244] [2022-07-23 06:42:52,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:42:52,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:42:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:42:52,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:42:52,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:42:52,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525570244] [2022-07-23 06:42:52,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525570244] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:42:52,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57970662] [2022-07-23 06:42:52,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:42:52,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:42:52,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:42:52,049 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:42:52,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-23 06:42:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:42:52,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 06:42:52,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:42:52,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:42:52,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:42:52,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:42:52,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57970662] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:42:52,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:42:52,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-07-23 06:42:52,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590398497] [2022-07-23 06:42:52,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:42:52,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 06:42:52,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:42:52,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 06:42:52,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:42:52,210 INFO L87 Difference]: Start difference. First operand 172 states and 224 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:52,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:42:52,303 INFO L93 Difference]: Finished difference Result 391 states and 474 transitions. [2022-07-23 06:42:52,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:42:52,303 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-23 06:42:52,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:42:52,305 INFO L225 Difference]: With dead ends: 391 [2022-07-23 06:42:52,305 INFO L226 Difference]: Without dead ends: 391 [2022-07-23 06:42:52,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:42:52,306 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 477 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:42:52,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 814 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:42:52,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-07-23 06:42:52,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 196. [2022-07-23 06:42:52,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 160 states have (on average 1.55) internal successors, (248), 195 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:52,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 248 transitions. [2022-07-23 06:42:52,311 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 248 transitions. Word has length 16 [2022-07-23 06:42:52,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:42:52,312 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 248 transitions. [2022-07-23 06:42:52,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:52,312 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 248 transitions. [2022-07-23 06:42:52,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-23 06:42:52,313 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:42:52,313 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1] [2022-07-23 06:42:52,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-23 06:42:52,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-23 06:42:52,532 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 06:42:52,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:42:52,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1254577850, now seen corresponding path program 2 times [2022-07-23 06:42:52,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:42:52,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488167344] [2022-07-23 06:42:52,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:42:52,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:42:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:42:52,563 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-23 06:42:52,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:42:52,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488167344] [2022-07-23 06:42:52,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488167344] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:42:52,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:42:52,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:42:52,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658537934] [2022-07-23 06:42:52,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:42:52,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:42:52,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:42:52,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:42:52,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:42:52,565 INFO L87 Difference]: Start difference. First operand 196 states and 248 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:52,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:42:52,613 INFO L93 Difference]: Finished difference Result 269 states and 337 transitions. [2022-07-23 06:42:52,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:42:52,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-23 06:42:52,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:42:52,616 INFO L225 Difference]: With dead ends: 269 [2022-07-23 06:42:52,616 INFO L226 Difference]: Without dead ends: 269 [2022-07-23 06:42:52,616 INFO L412 NwaCegarLoop]: 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-07-23 06:42:52,617 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 63 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:42:52,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 182 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:42:52,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-07-23 06:42:52,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 233. [2022-07-23 06:42:52,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 197 states have (on average 1.5532994923857868) internal successors, (306), 232 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:52,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 306 transitions. [2022-07-23 06:42:52,622 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 306 transitions. Word has length 19 [2022-07-23 06:42:52,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:42:52,623 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 306 transitions. [2022-07-23 06:42:52,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:52,623 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 306 transitions. [2022-07-23 06:42:52,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-23 06:42:52,627 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:42:52,627 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:42:52,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 06:42:52,628 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 06:42:52,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:42:52,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1435011604, now seen corresponding path program 1 times [2022-07-23 06:42:52,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:42:52,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782918695] [2022-07-23 06:42:52,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:42:52,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:42:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:42:52,698 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-23 06:42:52,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:42:52,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782918695] [2022-07-23 06:42:52,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782918695] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:42:52,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:42:52,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:42:52,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327502782] [2022-07-23 06:42:52,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:42:52,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:42:52,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:42:52,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:42:52,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:42:52,701 INFO L87 Difference]: Start difference. First operand 233 states and 306 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:52,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:42:52,759 INFO L93 Difference]: Finished difference Result 260 states and 321 transitions. [2022-07-23 06:42:52,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:42:52,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-23 06:42:52,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:42:52,761 INFO L225 Difference]: With dead ends: 260 [2022-07-23 06:42:52,761 INFO L226 Difference]: Without dead ends: 260 [2022-07-23 06:42:52,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:42:52,762 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 103 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:42:52,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 380 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:42:52,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-07-23 06:42:52,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 217. [2022-07-23 06:42:52,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 181 states have (on average 1.5248618784530388) internal successors, (276), 216 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:52,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 276 transitions. [2022-07-23 06:42:52,767 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 276 transitions. Word has length 23 [2022-07-23 06:42:52,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:42:52,767 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 276 transitions. [2022-07-23 06:42:52,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:52,768 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 276 transitions. [2022-07-23 06:42:52,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-23 06:42:52,769 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:42:52,770 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:42:52,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 06:42:52,770 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 06:42:52,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:42:52,771 INFO L85 PathProgramCache]: Analyzing trace with hash 877276576, now seen corresponding path program 2 times [2022-07-23 06:42:52,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:42:52,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295139772] [2022-07-23 06:42:52,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:42:52,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:42:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:42:52,898 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-23 06:42:52,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:42:52,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295139772] [2022-07-23 06:42:52,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295139772] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:42:52,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933222029] [2022-07-23 06:42:52,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:42:52,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:42:52,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:42:52,901 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:42:52,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-23 06:42:52,995 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 06:42:52,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:42:52,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-23 06:42:53,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:42:53,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:42:53,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:42:53,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:42:53,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 06:42:53,119 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:42:53,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-23 06:42:53,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:42:53,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 06:42:53,167 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:42:53,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:42:53,212 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:42:53,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-23 06:42:53,257 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-23 06:42:53,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:42:53,674 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:42:53,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933222029] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:42:53,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:42:53,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 9 [2022-07-23 06:42:53,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922499521] [2022-07-23 06:42:53,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:42:53,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 06:42:53,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:42:53,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 06:42:53,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:42:53,676 INFO L87 Difference]: Start difference. First operand 217 states and 276 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:53,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:42:53,775 INFO L93 Difference]: Finished difference Result 272 states and 330 transitions. [2022-07-23 06:42:53,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:42:53,776 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-23 06:42:53,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:42:53,777 INFO L225 Difference]: With dead ends: 272 [2022-07-23 06:42:53,778 INFO L226 Difference]: Without dead ends: 272 [2022-07-23 06:42:53,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:42:53,778 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 480 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:42:53,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 262 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 94 Invalid, 0 Unknown, 47 Unchecked, 0.1s Time] [2022-07-23 06:42:53,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-07-23 06:42:53,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 215. [2022-07-23 06:42:53,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 181 states have (on average 1.4917127071823204) internal successors, (270), 214 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:53,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 270 transitions. [2022-07-23 06:42:53,783 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 270 transitions. Word has length 24 [2022-07-23 06:42:53,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:42:53,783 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 270 transitions. [2022-07-23 06:42:53,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:53,784 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 270 transitions. [2022-07-23 06:42:53,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-23 06:42:53,784 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:42:53,785 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:42:53,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-23 06:42:54,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:42:54,011 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 06:42:54,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:42:54,011 INFO L85 PathProgramCache]: Analyzing trace with hash 361607171, now seen corresponding path program 1 times [2022-07-23 06:42:54,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:42:54,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247647636] [2022-07-23 06:42:54,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:42:54,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:42:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:42:54,063 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-23 06:42:54,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:42:54,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247647636] [2022-07-23 06:42:54,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247647636] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:42:54,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:42:54,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:42:54,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838596753] [2022-07-23 06:42:54,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:42:54,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:42:54,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:42:54,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:42:54,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:42:54,066 INFO L87 Difference]: Start difference. First operand 215 states and 270 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:54,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:42:54,139 INFO L93 Difference]: Finished difference Result 233 states and 288 transitions. [2022-07-23 06:42:54,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:42:54,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-23 06:42:54,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:42:54,141 INFO L225 Difference]: With dead ends: 233 [2022-07-23 06:42:54,141 INFO L226 Difference]: Without dead ends: 233 [2022-07-23 06:42:54,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:42:54,142 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 14 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:42:54,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 407 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:42:54,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-23 06:42:54,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 217. [2022-07-23 06:42:54,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 183 states have (on average 1.4863387978142077) internal successors, (272), 216 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:54,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 272 transitions. [2022-07-23 06:42:54,148 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 272 transitions. Word has length 25 [2022-07-23 06:42:54,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:42:54,148 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 272 transitions. [2022-07-23 06:42:54,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:54,149 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 272 transitions. [2022-07-23 06:42:54,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-23 06:42:54,149 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:42:54,149 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:42:54,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 06:42:54,150 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 06:42:54,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:42:54,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1675080075, now seen corresponding path program 1 times [2022-07-23 06:42:54,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:42:54,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116964640] [2022-07-23 06:42:54,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:42:54,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:42:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:42:54,193 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-23 06:42:54,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:42:54,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116964640] [2022-07-23 06:42:54,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116964640] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:42:54,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:42:54,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:42:54,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797182284] [2022-07-23 06:42:54,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:42:54,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:42:54,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:42:54,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:42:54,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:42:54,196 INFO L87 Difference]: Start difference. First operand 217 states and 272 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:54,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:42:54,253 INFO L93 Difference]: Finished difference Result 219 states and 273 transitions. [2022-07-23 06:42:54,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:42:54,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-23 06:42:54,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:42:54,254 INFO L225 Difference]: With dead ends: 219 [2022-07-23 06:42:54,254 INFO L226 Difference]: Without dead ends: 211 [2022-07-23 06:42:54,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:42:54,255 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:42:54,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 264 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:42:54,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-23 06:42:54,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2022-07-23 06:42:54,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 175 states have (on average 1.502857142857143) internal successors, (263), 208 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:54,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 263 transitions. [2022-07-23 06:42:54,260 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 263 transitions. Word has length 26 [2022-07-23 06:42:54,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:42:54,260 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 263 transitions. [2022-07-23 06:42:54,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:54,260 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 263 transitions. [2022-07-23 06:42:54,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-23 06:42:54,261 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:42:54,261 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:42:54,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-23 06:42:54,261 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 06:42:54,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:42:54,262 INFO L85 PathProgramCache]: Analyzing trace with hash -981051253, now seen corresponding path program 1 times [2022-07-23 06:42:54,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:42:54,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305541358] [2022-07-23 06:42:54,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:42:54,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:42:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:42:54,301 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-23 06:42:54,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:42:54,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305541358] [2022-07-23 06:42:54,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305541358] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:42:54,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:42:54,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:42:54,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893485665] [2022-07-23 06:42:54,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:42:54,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:42:54,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:42:54,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:42:54,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:42:54,304 INFO L87 Difference]: Start difference. First operand 209 states and 263 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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-07-23 06:42:54,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:42:54,387 INFO L93 Difference]: Finished difference Result 235 states and 289 transitions. [2022-07-23 06:42:54,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:42:54,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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 29 [2022-07-23 06:42:54,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:42:54,389 INFO L225 Difference]: With dead ends: 235 [2022-07-23 06:42:54,390 INFO L226 Difference]: Without dead ends: 235 [2022-07-23 06:42:54,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:42:54,392 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 293 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:42:54,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 169 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:42:54,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-07-23 06:42:54,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 208. [2022-07-23 06:42:54,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 175 states have (on average 1.4857142857142858) internal successors, (260), 207 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:54,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 260 transitions. [2022-07-23 06:42:54,396 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 260 transitions. Word has length 29 [2022-07-23 06:42:54,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:42:54,396 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 260 transitions. [2022-07-23 06:42:54,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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-07-23 06:42:54,396 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 260 transitions. [2022-07-23 06:42:54,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-23 06:42:54,397 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:42:54,398 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:42:54,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-23 06:42:54,398 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 06:42:54,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:42:54,398 INFO L85 PathProgramCache]: Analyzing trace with hash -981051252, now seen corresponding path program 1 times [2022-07-23 06:42:54,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:42:54,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34400305] [2022-07-23 06:42:54,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:42:54,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:42:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:42:54,476 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-23 06:42:54,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:42:54,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34400305] [2022-07-23 06:42:54,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34400305] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:42:54,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:42:54,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:42:54,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657101273] [2022-07-23 06:42:54,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:42:54,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:42:54,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:42:54,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:42:54,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:42:54,479 INFO L87 Difference]: Start difference. First operand 208 states and 260 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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-07-23 06:42:54,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:42:54,546 INFO L93 Difference]: Finished difference Result 207 states and 257 transitions. [2022-07-23 06:42:54,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:42:54,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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 29 [2022-07-23 06:42:54,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:42:54,548 INFO L225 Difference]: With dead ends: 207 [2022-07-23 06:42:54,548 INFO L226 Difference]: Without dead ends: 207 [2022-07-23 06:42:54,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:42:54,549 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 305 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:42:54,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 126 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:42:54,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-23 06:42:54,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-07-23 06:42:54,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 175 states have (on average 1.4685714285714286) internal successors, (257), 206 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:54,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 257 transitions. [2022-07-23 06:42:54,554 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 257 transitions. Word has length 29 [2022-07-23 06:42:54,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:42:54,554 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 257 transitions. [2022-07-23 06:42:54,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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-07-23 06:42:54,554 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 257 transitions. [2022-07-23 06:42:54,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:42:54,554 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:42:54,554 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:42:54,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-23 06:42:54,555 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 06:42:54,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:42:54,555 INFO L85 PathProgramCache]: Analyzing trace with hash -347817722, now seen corresponding path program 1 times [2022-07-23 06:42:54,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:42:54,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259616720] [2022-07-23 06:42:54,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:42:54,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:42:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:42:54,635 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-23 06:42:54,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:42:54,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259616720] [2022-07-23 06:42:54,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259616720] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:42:54,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348265703] [2022-07-23 06:42:54,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:42:54,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:42:54,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:42:54,640 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:42:54,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-23 06:42:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:42:54,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-23 06:42:54,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:42:54,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:42:54,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:42:54,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 06:42:54,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:42:54,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 06:42:54,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:42:54,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 06:42:54,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:42:54,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 06:42:54,918 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-23 06:42:54,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:42:57,429 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-23 06:42:57,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348265703] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:42:57,429 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:42:57,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-07-23 06:42:57,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891615765] [2022-07-23 06:42:57,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:42:57,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 06:42:57,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:42:57,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 06:42:57,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:42:57,431 INFO L87 Difference]: Start difference. First operand 207 states and 257 transitions. Second operand has 11 states, 10 states have (on average 7.6) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:57,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:42:57,561 INFO L93 Difference]: Finished difference Result 395 states and 483 transitions. [2022-07-23 06:42:57,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:42:57,562 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.6) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 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 30 [2022-07-23 06:42:57,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:42:57,563 INFO L225 Difference]: With dead ends: 395 [2022-07-23 06:42:57,563 INFO L226 Difference]: Without dead ends: 395 [2022-07-23 06:42:57,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:42:57,564 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 403 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:42:57,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 404 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 79 Unchecked, 0.1s Time] [2022-07-23 06:42:57,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-07-23 06:42:57,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 278. [2022-07-23 06:42:57,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 247 states have (on average 1.3441295546558705) internal successors, (332), 277 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:57,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 332 transitions. [2022-07-23 06:42:57,569 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 332 transitions. Word has length 30 [2022-07-23 06:42:57,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:42:57,570 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 332 transitions. [2022-07-23 06:42:57,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.6) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:57,570 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 332 transitions. [2022-07-23 06:42:57,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:42:57,570 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:42:57,570 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:42:57,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-23 06:42:57,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-23 06:42:57,791 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 06:42:57,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:42:57,792 INFO L85 PathProgramCache]: Analyzing trace with hash -347817723, now seen corresponding path program 1 times [2022-07-23 06:42:57,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:42:57,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448546208] [2022-07-23 06:42:57,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:42:57,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:42:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:42:57,900 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-23 06:42:57,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:42:57,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448546208] [2022-07-23 06:42:57,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448546208] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:42:57,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747441532] [2022-07-23 06:42:57,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:42:57,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:42:57,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:42:57,902 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:42:57,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-23 06:42:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:42:58,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-23 06:42:58,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:42:58,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:42:58,035 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:42:58,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-23 06:42:58,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:42:58,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 06:42:58,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:42:58,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 06:42:58,119 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:42:58,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-23 06:42:58,231 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:42:58,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:42:58,479 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 06:42:58,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747441532] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:42:58,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:42:58,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 15 [2022-07-23 06:42:58,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642877392] [2022-07-23 06:42:58,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:42:58,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-23 06:42:58,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:42:58,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-23 06:42:58,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-07-23 06:42:58,482 INFO L87 Difference]: Start difference. First operand 278 states and 332 transitions. Second operand has 16 states, 15 states have (on average 5.0) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:58,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:42:58,653 INFO L93 Difference]: Finished difference Result 303 states and 352 transitions. [2022-07-23 06:42:58,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:42:58,654 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.0) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 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 30 [2022-07-23 06:42:58,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:42:58,655 INFO L225 Difference]: With dead ends: 303 [2022-07-23 06:42:58,655 INFO L226 Difference]: Without dead ends: 303 [2022-07-23 06:42:58,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2022-07-23 06:42:58,656 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 775 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:42:58,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 285 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 134 Invalid, 0 Unknown, 60 Unchecked, 0.1s Time] [2022-07-23 06:42:58,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-07-23 06:42:58,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 276. [2022-07-23 06:42:58,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 247 states have (on average 1.3076923076923077) internal successors, (323), 275 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:58,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 323 transitions. [2022-07-23 06:42:58,661 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 323 transitions. Word has length 30 [2022-07-23 06:42:58,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:42:58,661 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 323 transitions. [2022-07-23 06:42:58,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.0) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:42:58,661 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 323 transitions. [2022-07-23 06:42:58,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-23 06:42:58,662 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:42:58,662 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:42:58,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-23 06:42:58,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-23 06:42:58,875 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 06:42:58,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:42:58,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1918350099, now seen corresponding path program 1 times [2022-07-23 06:42:58,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:42:58,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654732745] [2022-07-23 06:42:58,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:42:58,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:42:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:42:59,122 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-23 06:42:59,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:42:59,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654732745] [2022-07-23 06:42:59,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654732745] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:42:59,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400663657] [2022-07-23 06:42:59,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:42:59,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:42:59,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:42:59,128 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:42:59,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-23 06:42:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:42:59,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-23 06:42:59,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:42:59,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:42:59,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:42:59,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:42:59,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:42:59,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:42:59,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:42:59,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:42:59,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-23 06:42:59,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:42:59,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:42:59,703 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:42:59,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2022-07-23 06:42:59,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:42:59,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:42:59,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:42:59,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:42:59,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:42:59,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:42:59,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:42:59,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:42:59,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:42:59,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:42:59,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:42:59,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:42:59,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:42:59,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:42:59,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:42:59,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:42:59,931 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:42:59,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:42:59,947 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) is different from false [2022-07-23 06:42:59,960 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (not (<= |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| |c_ULTIMATE.start_node_create_with_sublist_#res#1.base|)))) (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (not (<= |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| |c_ULTIMATE.start_node_create_with_sublist_#res#1.base|)) (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-23 06:42:59,979 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))) (forall ((v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) is different from false [2022-07-23 06:42:59,992 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) is different from false [2022-07-23 06:43:00,072 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) is different from false [2022-07-23 06:43:00,105 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))))) is different from false [2022-07-23 06:43:00,152 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_495 (Array Int Int))) (or (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|))))) is different from false [2022-07-23 06:43:00,217 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_495 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|))))) is different from false [2022-07-23 06:43:00,261 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_495 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|))))) is different from false [2022-07-23 06:43:00,313 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_492 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_495 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))))))) (forall ((v_ArrVal_493 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_493))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|))))) is different from false [2022-07-23 06:43:00,428 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_493 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_493))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_492 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_495 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|))))) is different from false [2022-07-23 06:43:00,623 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_492 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_495 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))))))))) (not (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_493 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_493))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |c_#StackHeapBarrier|))))) is different from false [2022-07-23 06:43:00,910 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-07-23 06:43:00,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400663657] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:43:00,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:43:00,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 17] total 36 [2022-07-23 06:43:00,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319286192] [2022-07-23 06:43:00,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:43:00,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-23 06:43:00,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:43:00,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-23 06:43:00,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=450, Unknown=12, NotChecked=660, Total=1260 [2022-07-23 06:43:00,913 INFO L87 Difference]: Start difference. First operand 276 states and 323 transitions. Second operand has 36 states, 36 states have (on average 2.388888888888889) internal successors, (86), 36 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-07-23 06:43:00,934 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (forall ((|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_492 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_495 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))))))))) (not (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |c_#StackHeapBarrier|)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (forall ((|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_493 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_493))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#head~1#1.base|)) is different from false [2022-07-23 06:43:00,944 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_493 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_493))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_492 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_495 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2022-07-23 06:43:00,951 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((v_ArrVal_492 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_495 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))))))) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (forall ((v_ArrVal_493 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_493))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2022-07-23 06:43:02,968 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)))) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_495 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2022-07-23 06:43:04,972 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_495 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)))) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-23 06:43:07,016 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (and (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0) 0))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2022-07-23 06:43:09,020 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (and (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0) 0))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-23 06:43:09,219 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| 1) |c_ULTIMATE.start_sll_append_~head#1.base|)) is different from false [2022-07-23 06:43:09,225 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (not (<= |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| |c_ULTIMATE.start_node_create_with_sublist_#res#1.base|)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< (+ |c_ULTIMATE.start_node_create_with_sublist_#res#1.base| 1) |c_ULTIMATE.start_sll_append_~head#1.base|) (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (not (<= |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| |c_ULTIMATE.start_node_create_with_sublist_#res#1.base|)) (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-23 06:43:09,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:43:09,364 INFO L93 Difference]: Finished difference Result 313 states and 362 transitions. [2022-07-23 06:43:09,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-23 06:43:09,365 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.388888888888889) internal successors, (86), 36 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) Word has length 33 [2022-07-23 06:43:09,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:43:09,366 INFO L225 Difference]: With dead ends: 313 [2022-07-23 06:43:09,366 INFO L226 Difference]: Without dead ends: 313 [2022-07-23 06:43:09,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=205, Invalid=670, Unknown=21, NotChecked=1554, Total=2450 [2022-07-23 06:43:09,367 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 14 mSDsluCounter, 1442 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 408 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:43:09,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1531 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 168 Invalid, 0 Unknown, 408 Unchecked, 0.1s Time] [2022-07-23 06:43:09,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-07-23 06:43:09,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 303. [2022-07-23 06:43:09,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 274 states have (on average 1.2846715328467153) internal successors, (352), 302 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:43:09,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 352 transitions. [2022-07-23 06:43:09,373 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 352 transitions. Word has length 33 [2022-07-23 06:43:09,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:43:09,373 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 352 transitions. [2022-07-23 06:43:09,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.388888888888889) internal successors, (86), 36 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-07-23 06:43:09,373 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 352 transitions. [2022-07-23 06:43:09,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-23 06:43:09,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:43:09,374 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:43:09,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-23 06:43:09,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:43:09,575 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 06:43:09,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:43:09,575 INFO L85 PathProgramCache]: Analyzing trace with hash -990413803, now seen corresponding path program 1 times [2022-07-23 06:43:09,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:43:09,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198685577] [2022-07-23 06:43:09,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:43:09,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:43:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:43:09,618 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-23 06:43:09,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:43:09,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198685577] [2022-07-23 06:43:09,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198685577] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:43:09,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:43:09,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:43:09,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047477014] [2022-07-23 06:43:09,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:43:09,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:43:09,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:43:09,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:43:09,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:43:09,620 INFO L87 Difference]: Start difference. First operand 303 states and 352 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-07-23 06:43:09,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:43:09,628 INFO L93 Difference]: Finished difference Result 284 states and 331 transitions. [2022-07-23 06:43:09,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:43:09,629 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 33 [2022-07-23 06:43:09,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:43:09,631 INFO L225 Difference]: With dead ends: 284 [2022-07-23 06:43:09,631 INFO L226 Difference]: Without dead ends: 284 [2022-07-23 06:43:09,631 INFO L412 NwaCegarLoop]: 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-07-23 06:43:09,632 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:43:09,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:43:09,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-07-23 06:43:09,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 283. [2022-07-23 06:43:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 254 states have (on average 1.2992125984251968) internal successors, (330), 282 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:43:09,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 330 transitions. [2022-07-23 06:43:09,642 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 330 transitions. Word has length 33 [2022-07-23 06:43:09,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:43:09,643 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 330 transitions. [2022-07-23 06:43:09,643 INFO L496 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-07-23 06:43:09,643 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 330 transitions. [2022-07-23 06:43:09,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-23 06:43:09,643 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:43:09,644 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:43:09,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-23 06:43:09,644 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 06:43:09,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:43:09,645 INFO L85 PathProgramCache]: Analyzing trace with hash 74446604, now seen corresponding path program 1 times [2022-07-23 06:43:09,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:43:09,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028546347] [2022-07-23 06:43:09,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:43:09,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:43:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:43:09,720 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:43:09,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:43:09,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028546347] [2022-07-23 06:43:09,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028546347] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:43:09,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840834721] [2022-07-23 06:43:09,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:43:09,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:43:09,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:43:09,724 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:43:09,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-23 06:43:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:43:09,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-23 06:43:09,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:43:09,867 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:43:09,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:43:09,907 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:43:09,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840834721] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:43:09,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:43:09,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2022-07-23 06:43:09,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110618273] [2022-07-23 06:43:09,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:43:09,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 06:43:09,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:43:09,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 06:43:09,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:43:09,910 INFO L87 Difference]: Start difference. First operand 283 states and 330 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:43:10,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:43:10,054 INFO L93 Difference]: Finished difference Result 502 states and 569 transitions. [2022-07-23 06:43:10,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 06:43:10,055 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-07-23 06:43:10,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:43:10,057 INFO L225 Difference]: With dead ends: 502 [2022-07-23 06:43:10,057 INFO L226 Difference]: Without dead ends: 502 [2022-07-23 06:43:10,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2022-07-23 06:43:10,057 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 264 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:43:10,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1334 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:43:10,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2022-07-23 06:43:10,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 317. [2022-07-23 06:43:10,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 288 states have (on average 1.3090277777777777) internal successors, (377), 316 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:43:10,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 377 transitions. [2022-07-23 06:43:10,065 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 377 transitions. Word has length 38 [2022-07-23 06:43:10,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:43:10,065 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 377 transitions. [2022-07-23 06:43:10,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:43:10,066 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 377 transitions. [2022-07-23 06:43:10,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-23 06:43:10,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:43:10,067 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:43:10,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-23 06:43:10,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:43:10,275 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 06:43:10,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:43:10,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1481327645, now seen corresponding path program 2 times [2022-07-23 06:43:10,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:43:10,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936995168] [2022-07-23 06:43:10,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:43:10,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:43:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:43:10,553 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-23 06:43:10,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:43:10,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936995168] [2022-07-23 06:43:10,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936995168] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:43:10,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191431121] [2022-07-23 06:43:10,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:43:10,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:43:10,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:43:10,556 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:43:10,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-23 06:43:10,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 06:43:10,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:43:10,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-23 06:43:10,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:43:10,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:10,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:43:10,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:10,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:43:11,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:11,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-23 06:43:11,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:11,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:43:11,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:11,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:43:11,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:11,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:11,218 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-23 06:43:11,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2022-07-23 06:43:11,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:11,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:43:11,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:11,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:11,381 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:43:11,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2022-07-23 06:43:11,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:11,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:43:11,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:11,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:43:11,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:11,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:43:11,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:11,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:43:11,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:11,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:43:11,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:11,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:43:11,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:43:11,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:43:11,607 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-23 06:43:11,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:43:11,621 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_766 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_765 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) is different from false [2022-07-23 06:43:11,634 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int)) (or (not (<= |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| |c_ULTIMATE.start_node_create_with_sublist_#res#1.base|)) (forall ((v_ArrVal_766 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int)) (or (forall ((v_ArrVal_765 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (not (<= |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| |c_ULTIMATE.start_node_create_with_sublist_#res#1.base|))))) is different from false [2022-07-23 06:43:11,652 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_765 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (forall ((v_ArrVal_766 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) is different from false [2022-07-23 06:43:11,668 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_765 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_764 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|))) (forall ((v_ArrVal_766 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_763 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) is different from false [2022-07-23 06:43:11,741 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_765 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_763 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) is different from false [2022-07-23 06:43:11,775 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_765 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_763 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|)))))) is different from false [2022-07-23 06:43:11,817 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_757 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_763 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|))))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_765 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|)))))) is different from false [2022-07-23 06:43:11,888 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_765 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|))))))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_757 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_763 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))))))) is different from false [2022-07-23 06:43:11,931 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_765 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|))))))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_757 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_763 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))))))) is different from false [2022-07-23 06:43:11,975 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_765 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int) (v_ArrVal_753 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_757 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_763 (Array Int Int))) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|)))))))) is different from false [2022-07-23 06:43:12,074 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_765 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))))))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int) (v_ArrVal_753 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_757 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_763 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))))))))) is different from false [2022-07-23 06:43:12,160 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_765 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))))))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int) (v_ArrVal_753 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_757 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_763 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))))))))) is different from false [2022-07-23 06:43:12,417 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (v_ArrVal_752 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_765 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store (store (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_752))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (v_ArrVal_751 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int) (v_ArrVal_753 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_757 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_763 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_751) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))))))))) is different from false [2022-07-23 06:43:12,627 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (v_ArrVal_752 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_765 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (or (= (select (select (store (store (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| v_ArrVal_752))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) 0 0))))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|))))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (v_ArrVal_751 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int) (v_ArrVal_753 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_757 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_763 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| v_ArrVal_751) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| |c_#StackHeapBarrier|))))) is different from false [2022-07-23 06:43:12,872 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| Int)) (or (not (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (v_ArrVal_752 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_765 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (or (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store (store (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| v_ArrVal_752))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) 0 0))))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| |c_#StackHeapBarrier|)))))) (forall ((|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| Int)) (or (not (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (v_ArrVal_751 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int) (v_ArrVal_753 (Array Int Int))) (or (forall ((v_ArrVal_757 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_763 (Array Int Int))) (or (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| v_ArrVal_751) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| |c_#StackHeapBarrier|))))))) is different from false [2022-07-23 06:43:13,637 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 28 not checked. [2022-07-23 06:43:13,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191431121] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:43:13,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:43:13,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19, 20] total 42 [2022-07-23 06:43:13,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552857558] [2022-07-23 06:43:13,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:43:13,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-23 06:43:13,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:43:13,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-23 06:43:13,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=565, Unknown=15, NotChecked=960, Total=1722 [2022-07-23 06:43:13,640 INFO L87 Difference]: Start difference. First operand 317 states and 377 transitions. Second operand has 42 states, 42 states have (on average 2.380952380952381) internal successors, (100), 42 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:43:13,670 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (forall ((|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| Int)) (or (not (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (v_ArrVal_752 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_765 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (or (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store (store (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| v_ArrVal_752))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) 0 0))))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| |c_#StackHeapBarrier|)))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (forall ((|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| Int)) (or (not (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (v_ArrVal_751 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int) (v_ArrVal_753 (Array Int Int))) (or (forall ((v_ArrVal_757 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_763 (Array Int Int))) (or (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| v_ArrVal_751) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| |c_#StackHeapBarrier|)))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#head~1#1.base|)) is different from false [2022-07-23 06:43:13,682 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (v_ArrVal_752 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_765 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (or (= (select (select (store (store (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| v_ArrVal_752))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) 0 0))))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|))))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (v_ArrVal_751 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int) (v_ArrVal_753 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_757 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_763 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| v_ArrVal_751) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2022-07-23 06:43:13,695 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (v_ArrVal_752 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_765 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store (store (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_752))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (v_ArrVal_751 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int) (v_ArrVal_753 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_757 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_763 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_751) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))))))) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2022-07-23 06:43:15,700 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_765 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int) (v_ArrVal_753 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_757 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_763 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))))))))) is different from false [2022-07-23 06:43:17,705 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_765 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int) (v_ArrVal_753 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_757 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_763 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))))))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-23 06:43:19,710 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_765 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int) (v_ArrVal_753 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_757 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_763 (Array Int Int))) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|)))))))) is different from false [2022-07-23 06:43:21,714 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_765 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|))))))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_757 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_763 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))))) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|) 0) (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2022-07-23 06:43:23,719 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_765 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|))))))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_757 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_763 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (and (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) 0))) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-23 06:43:25,789 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_765 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|) 0) (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_763 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2022-07-23 06:43:27,793 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_765 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_763 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (and (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) 0))) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-23 06:43:28,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:43:28,074 INFO L93 Difference]: Finished difference Result 399 states and 465 transitions. [2022-07-23 06:43:28,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-23 06:43:28,075 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.380952380952381) internal successors, (100), 42 states have internal predecessors, (100), 0 states have call successors, (0), 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 42 [2022-07-23 06:43:28,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:43:28,076 INFO L225 Difference]: With dead ends: 399 [2022-07-23 06:43:28,076 INFO L226 Difference]: Without dead ends: 399 [2022-07-23 06:43:28,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 25 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=247, Invalid=758, Unknown=25, NotChecked=2050, Total=3080 [2022-07-23 06:43:28,078 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 19 mSDsluCounter, 2048 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 2136 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 489 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:43:28,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 2136 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 324 Invalid, 0 Unknown, 489 Unchecked, 0.2s Time] [2022-07-23 06:43:28,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-07-23 06:43:28,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 387. [2022-07-23 06:43:28,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 358 states have (on average 1.26536312849162) internal successors, (453), 386 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:43:28,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 453 transitions. [2022-07-23 06:43:28,084 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 453 transitions. Word has length 42 [2022-07-23 06:43:28,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:43:28,085 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 453 transitions. [2022-07-23 06:43:28,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.380952380952381) internal successors, (100), 42 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:43:28,085 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 453 transitions. [2022-07-23 06:43:28,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-23 06:43:28,086 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:43:28,086 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:43:28,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-23 06:43:28,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-23 06:43:28,287 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 06:43:28,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:43:28,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1784280353, now seen corresponding path program 1 times [2022-07-23 06:43:28,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:43:28,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233882950] [2022-07-23 06:43:28,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:43:28,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:43:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:43:28,308 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-23 06:43:28,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:43:28,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233882950] [2022-07-23 06:43:28,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233882950] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:43:28,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:43:28,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:43:28,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202226510] [2022-07-23 06:43:28,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:43:28,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:43:28,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:43:28,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:43:28,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:43:28,311 INFO L87 Difference]: Start difference. First operand 387 states and 453 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:43:28,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:43:28,326 INFO L93 Difference]: Finished difference Result 497 states and 591 transitions. [2022-07-23 06:43:28,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:43:28,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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 42 [2022-07-23 06:43:28,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:43:28,329 INFO L225 Difference]: With dead ends: 497 [2022-07-23 06:43:28,329 INFO L226 Difference]: Without dead ends: 497 [2022-07-23 06:43:28,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:43:28,330 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 105 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:43:28,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 349 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:43:28,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2022-07-23 06:43:28,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 323. [2022-07-23 06:43:28,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 294 states have (on average 1.2925170068027212) internal successors, (380), 322 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:43:28,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 380 transitions. [2022-07-23 06:43:28,336 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 380 transitions. Word has length 42 [2022-07-23 06:43:28,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:43:28,336 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 380 transitions. [2022-07-23 06:43:28,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:43:28,337 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 380 transitions. [2022-07-23 06:43:28,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-23 06:43:28,337 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:43:28,337 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:43:28,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-23 06:43:28,338 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 06:43:28,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:43:28,338 INFO L85 PathProgramCache]: Analyzing trace with hash -788824226, now seen corresponding path program 1 times [2022-07-23 06:43:28,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:43:28,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753865536] [2022-07-23 06:43:28,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:43:28,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:43:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:43:28,467 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-23 06:43:28,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:43:28,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753865536] [2022-07-23 06:43:28,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753865536] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:43:28,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185723313] [2022-07-23 06:43:28,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:43:28,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:43:28,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:43:28,470 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:43:28,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-23 06:43:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:43:28,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-23 06:43:28,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:43:28,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:43:28,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:43:28,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:28,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 06:43:28,678 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:43:28,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-23 06:43:28,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:28,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 06:43:28,745 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 06:43:28,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 06:43:28,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:28,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 06:43:28,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:28,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 06:43:28,920 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-23 06:43:28,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:43:35,541 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-23 06:43:35,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185723313] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:43:35,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:43:35,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2022-07-23 06:43:35,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979660572] [2022-07-23 06:43:35,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:43:35,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 06:43:35,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:43:35,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 06:43:35,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-07-23 06:43:35,544 INFO L87 Difference]: Start difference. First operand 323 states and 380 transitions. Second operand has 14 states, 13 states have (on average 8.076923076923077) internal successors, (105), 14 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:43:35,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:43:35,696 INFO L93 Difference]: Finished difference Result 347 states and 404 transitions. [2022-07-23 06:43:35,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:43:35,697 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 8.076923076923077) internal successors, (105), 14 states have internal predecessors, (105), 0 states have call successors, (0), 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 51 [2022-07-23 06:43:35,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:43:35,698 INFO L225 Difference]: With dead ends: 347 [2022-07-23 06:43:35,698 INFO L226 Difference]: Without dead ends: 347 [2022-07-23 06:43:35,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 95 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2022-07-23 06:43:35,699 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 759 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:43:35,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 163 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 73 Invalid, 0 Unknown, 99 Unchecked, 0.1s Time] [2022-07-23 06:43:35,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-07-23 06:43:35,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 320. [2022-07-23 06:43:35,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 294 states have (on average 1.2755102040816326) internal successors, (375), 319 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:43:35,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 375 transitions. [2022-07-23 06:43:35,705 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 375 transitions. Word has length 51 [2022-07-23 06:43:35,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:43:35,705 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 375 transitions. [2022-07-23 06:43:35,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 8.076923076923077) internal successors, (105), 14 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:43:35,705 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 375 transitions. [2022-07-23 06:43:35,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-23 06:43:35,706 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:43:35,706 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:43:35,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-23 06:43:35,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-23 06:43:35,931 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 06:43:35,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:43:35,931 INFO L85 PathProgramCache]: Analyzing trace with hash -563101512, now seen corresponding path program 1 times [2022-07-23 06:43:35,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:43:35,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568668677] [2022-07-23 06:43:35,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:43:35,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:43:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:43:35,980 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-23 06:43:35,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:43:35,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568668677] [2022-07-23 06:43:35,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568668677] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:43:35,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:43:35,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:43:35,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010193676] [2022-07-23 06:43:35,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:43:35,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:43:35,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:43:35,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:43:35,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:43:35,986 INFO L87 Difference]: Start difference. First operand 320 states and 375 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:43:36,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:43:36,021 INFO L93 Difference]: Finished difference Result 380 states and 433 transitions. [2022-07-23 06:43:36,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:43:36,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 55 [2022-07-23 06:43:36,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:43:36,023 INFO L225 Difference]: With dead ends: 380 [2022-07-23 06:43:36,023 INFO L226 Difference]: Without dead ends: 380 [2022-07-23 06:43:36,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:43:36,024 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 248 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:43:36,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 188 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:43:36,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-07-23 06:43:36,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 318. [2022-07-23 06:43:36,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 292 states have (on average 1.2705479452054795) internal successors, (371), 317 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:43:36,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 371 transitions. [2022-07-23 06:43:36,030 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 371 transitions. Word has length 55 [2022-07-23 06:43:36,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:43:36,030 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 371 transitions. [2022-07-23 06:43:36,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:43:36,035 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 371 transitions. [2022-07-23 06:43:36,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-23 06:43:36,035 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:43:36,035 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:43:36,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-23 06:43:36,036 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 06:43:36,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:43:36,036 INFO L85 PathProgramCache]: Analyzing trace with hash -276278871, now seen corresponding path program 1 times [2022-07-23 06:43:36,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:43:36,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162800972] [2022-07-23 06:43:36,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:43:36,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:43:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:43:36,131 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-23 06:43:36,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:43:36,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162800972] [2022-07-23 06:43:36,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162800972] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:43:36,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:43:36,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 06:43:36,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400227133] [2022-07-23 06:43:36,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:43:36,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 06:43:36,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:43:36,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 06:43:36,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:43:36,133 INFO L87 Difference]: Start difference. First operand 318 states and 371 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:43:36,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:43:36,398 INFO L93 Difference]: Finished difference Result 536 states and 627 transitions. [2022-07-23 06:43:36,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 06:43:36,399 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 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 56 [2022-07-23 06:43:36,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:43:36,400 INFO L225 Difference]: With dead ends: 536 [2022-07-23 06:43:36,400 INFO L226 Difference]: Without dead ends: 536 [2022-07-23 06:43:36,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2022-07-23 06:43:36,401 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 798 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:43:36,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 409 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:43:36,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2022-07-23 06:43:36,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 353. [2022-07-23 06:43:36,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 328 states have (on average 1.271341463414634) internal successors, (417), 352 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:43:36,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 417 transitions. [2022-07-23 06:43:36,408 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 417 transitions. Word has length 56 [2022-07-23 06:43:36,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:43:36,408 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 417 transitions. [2022-07-23 06:43:36,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:43:36,408 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 417 transitions. [2022-07-23 06:43:36,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-23 06:43:36,409 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:43:36,409 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:43:36,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-23 06:43:36,410 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 06:43:36,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:43:36,410 INFO L85 PathProgramCache]: Analyzing trace with hash -276278870, now seen corresponding path program 1 times [2022-07-23 06:43:36,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:43:36,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749945056] [2022-07-23 06:43:36,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:43:36,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:43:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:43:36,533 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-23 06:43:36,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:43:36,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749945056] [2022-07-23 06:43:36,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749945056] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:43:36,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:43:36,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 06:43:36,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868392808] [2022-07-23 06:43:36,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:43:36,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 06:43:36,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:43:36,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 06:43:36,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:43:36,535 INFO L87 Difference]: Start difference. First operand 353 states and 417 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:43:36,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:43:36,775 INFO L93 Difference]: Finished difference Result 517 states and 619 transitions. [2022-07-23 06:43:36,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:43:36,775 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 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 56 [2022-07-23 06:43:36,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:43:36,777 INFO L225 Difference]: With dead ends: 517 [2022-07-23 06:43:36,777 INFO L226 Difference]: Without dead ends: 517 [2022-07-23 06:43:36,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2022-07-23 06:43:36,778 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 822 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:43:36,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 347 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:43:36,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2022-07-23 06:43:36,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 386. [2022-07-23 06:43:36,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 361 states have (on average 1.293628808864266) internal successors, (467), 385 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:43:36,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 467 transitions. [2022-07-23 06:43:36,785 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 467 transitions. Word has length 56 [2022-07-23 06:43:36,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:43:36,785 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 467 transitions. [2022-07-23 06:43:36,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:43:36,786 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 467 transitions. [2022-07-23 06:43:36,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-23 06:43:36,786 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:43:36,786 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:43:36,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-23 06:43:36,786 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 06:43:36,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:43:36,787 INFO L85 PathProgramCache]: Analyzing trace with hash 25284007, now seen corresponding path program 1 times [2022-07-23 06:43:36,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:43:36,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312122543] [2022-07-23 06:43:36,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:43:36,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:43:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:43:36,863 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-23 06:43:36,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:43:36,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312122543] [2022-07-23 06:43:36,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312122543] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:43:36,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:43:36,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 06:43:36,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794561647] [2022-07-23 06:43:36,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:43:36,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:43:36,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:43:36,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:43:36,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:43:36,865 INFO L87 Difference]: Start difference. First operand 386 states and 467 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:43:36,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:43:36,988 INFO L93 Difference]: Finished difference Result 436 states and 535 transitions. [2022-07-23 06:43:36,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:43:36,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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 57 [2022-07-23 06:43:36,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:43:36,991 INFO L225 Difference]: With dead ends: 436 [2022-07-23 06:43:36,991 INFO L226 Difference]: Without dead ends: 436 [2022-07-23 06:43:36,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:43:36,992 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 51 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:43:36,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 507 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:43:36,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2022-07-23 06:43:36,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 424. [2022-07-23 06:43:36,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 399 states have (on average 1.3208020050125313) internal successors, (527), 423 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:43:36,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 527 transitions. [2022-07-23 06:43:36,998 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 527 transitions. Word has length 57 [2022-07-23 06:43:36,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:43:36,999 INFO L495 AbstractCegarLoop]: Abstraction has 424 states and 527 transitions. [2022-07-23 06:43:36,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:43:36,999 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 527 transitions. [2022-07-23 06:43:37,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-23 06:43:37,000 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:43:37,000 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:43:37,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-23 06:43:37,000 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 06:43:37,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:43:37,001 INFO L85 PathProgramCache]: Analyzing trace with hash 783803729, now seen corresponding path program 1 times [2022-07-23 06:43:37,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:43:37,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514473620] [2022-07-23 06:43:37,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:43:37,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:43:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:43:37,088 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-23 06:43:37,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:43:37,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514473620] [2022-07-23 06:43:37,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514473620] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:43:37,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:43:37,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 06:43:37,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236175364] [2022-07-23 06:43:37,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:43:37,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:43:37,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:43:37,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:43:37,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:43:37,091 INFO L87 Difference]: Start difference. First operand 424 states and 527 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:43:37,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:43:37,238 INFO L93 Difference]: Finished difference Result 522 states and 640 transitions. [2022-07-23 06:43:37,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:43:37,239 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 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 58 [2022-07-23 06:43:37,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:43:37,241 INFO L225 Difference]: With dead ends: 522 [2022-07-23 06:43:37,241 INFO L226 Difference]: Without dead ends: 522 [2022-07-23 06:43:37,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-07-23 06:43:37,242 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 654 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:43:37,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 408 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:43:37,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-07-23 06:43:37,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 424. [2022-07-23 06:43:37,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 399 states have (on average 1.3082706766917294) internal successors, (522), 423 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:43:37,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 522 transitions. [2022-07-23 06:43:37,249 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 522 transitions. Word has length 58 [2022-07-23 06:43:37,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:43:37,250 INFO L495 AbstractCegarLoop]: Abstraction has 424 states and 522 transitions. [2022-07-23 06:43:37,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:43:37,250 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 522 transitions. [2022-07-23 06:43:37,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-23 06:43:37,253 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:43:37,253 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:43:37,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-23 06:43:37,254 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 06:43:37,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:43:37,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1466385390, now seen corresponding path program 1 times [2022-07-23 06:43:37,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:43:37,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313190272] [2022-07-23 06:43:37,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:43:37,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:43:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:43:37,606 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-23 06:43:37,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:43:37,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313190272] [2022-07-23 06:43:37,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313190272] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:43:37,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924673259] [2022-07-23 06:43:37,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:43:37,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:43:37,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:43:37,609 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:43:37,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-23 06:43:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:43:37,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-23 06:43:37,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:43:37,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:43:37,779 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:43:37,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:43:37,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:43:38,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:43:38,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:38,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 06:43:38,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:43:38,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:43:38,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-23 06:43:38,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 06:43:38,666 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:43:38,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:43:38,672 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-07-23 06:43:38,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 42 [2022-07-23 06:43:38,678 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 06:43:38,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 15 [2022-07-23 06:43:38,685 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-23 06:43:38,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:43:39,051 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:43:39,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1486 treesize of output 1469