/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 05:43:02,763 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 05:43:02,767 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 05:43:02,804 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 05:43:02,805 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 05:43:02,807 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 05:43:02,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 05:43:02,821 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 05:43:02,826 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 05:43:02,828 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 05:43:02,829 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 05:43:02,831 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 05:43:02,832 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 05:43:02,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 05:43:02,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 05:43:02,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 05:43:02,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 05:43:02,839 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 05:43:02,841 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 05:43:02,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 05:43:02,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 05:43:02,848 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 05:43:02,849 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 05:43:02,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 05:43:02,855 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 05:43:02,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 05:43:02,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 05:43:02,858 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 05:43:02,859 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 05:43:02,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 05:43:02,860 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 05:43:02,862 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 05:43:02,863 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 05:43:02,864 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 05:43:02,866 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 05:43:02,866 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 05:43:02,867 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 05:43:02,868 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 05:43:02,868 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 05:43:02,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 05:43:02,871 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 05:43:02,872 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-16 05:43:02,903 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 05:43:02,904 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 05:43:02,904 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 05:43:02,904 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 05:43:02,905 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 05:43:02,906 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 05:43:02,907 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 05:43:02,907 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 05:43:02,907 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 05:43:02,908 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 05:43:02,908 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 05:43:02,908 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 05:43:02,909 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 05:43:02,909 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 05:43:02,909 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 05:43:02,909 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-16 05:43:02,910 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-16 05:43:02,910 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-16 05:43:02,910 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 05:43:02,910 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-16 05:43:02,911 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 05:43:02,911 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 05:43:02,911 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 05:43:02,911 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 05:43:02,912 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 05:43:02,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 05:43:02,912 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 05:43:02,913 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 05:43:02,913 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 05:43:02,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 05:43:02,913 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 [2022-10-16 05:43:03,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 05:43:03,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 05:43:03,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 05:43:03,399 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 05:43:03,400 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 05:43:03,403 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-2.i [2022-10-16 05:43:03,486 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be9e194e1/b4de0d64f0ee42ce9bfa3d60efd6dfbd/FLAG082771d96 [2022-10-16 05:43:04,205 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 05:43:04,205 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2022-10-16 05:43:04,224 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be9e194e1/b4de0d64f0ee42ce9bfa3d60efd6dfbd/FLAG082771d96 [2022-10-16 05:43:04,457 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be9e194e1/b4de0d64f0ee42ce9bfa3d60efd6dfbd [2022-10-16 05:43:04,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 05:43:04,465 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 05:43:04,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 05:43:04,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 05:43:04,471 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 05:43:04,472 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:43:04" (1/1) ... [2022-10-16 05:43:04,473 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e501310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:43:04, skipping insertion in model container [2022-10-16 05:43:04,473 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:43:04" (1/1) ... [2022-10-16 05:43:04,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 05:43:04,524 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 05:43:04,848 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-2.i[25013,25026] [2022-10-16 05:43:04,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 05:43:04,861 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 05:43:04,927 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-2.i[25013,25026] [2022-10-16 05:43:04,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 05:43:04,966 INFO L208 MainTranslator]: Completed translation [2022-10-16 05:43:04,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:43:04 WrapperNode [2022-10-16 05:43:04,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 05:43:04,968 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 05:43:04,968 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 05:43:04,968 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 05:43:04,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:43:04" (1/1) ... [2022-10-16 05:43:05,002 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:43:04" (1/1) ... [2022-10-16 05:43:05,036 INFO L138 Inliner]: procedures = 129, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 186 [2022-10-16 05:43:05,037 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 05:43:05,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 05:43:05,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 05:43:05,038 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 05:43:05,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:43:04" (1/1) ... [2022-10-16 05:43:05,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:43:04" (1/1) ... [2022-10-16 05:43:05,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:43:04" (1/1) ... [2022-10-16 05:43:05,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:43:04" (1/1) ... [2022-10-16 05:43:05,080 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:43:04" (1/1) ... [2022-10-16 05:43:05,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:43:04" (1/1) ... [2022-10-16 05:43:05,099 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:43:04" (1/1) ... [2022-10-16 05:43:05,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:43:04" (1/1) ... [2022-10-16 05:43:05,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 05:43:05,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 05:43:05,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 05:43:05,113 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 05:43:05,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:43:04" (1/1) ... [2022-10-16 05:43:05,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 05:43:05,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 05:43:05,152 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-10-16 05:43:05,173 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-10-16 05:43:05,213 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-10-16 05:43:05,213 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-10-16 05:43:05,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 05:43:05,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 05:43:05,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 05:43:05,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-16 05:43:05,214 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2022-10-16 05:43:05,214 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2022-10-16 05:43:05,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-16 05:43:05,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 05:43:05,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-16 05:43:05,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 05:43:05,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 05:43:05,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 05:43:05,411 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 05:43:05,417 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 05:43:05,498 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-10-16 05:43:05,911 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 05:43:05,921 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 05:43:05,921 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-10-16 05:43:05,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:43:05 BoogieIcfgContainer [2022-10-16 05:43:05,924 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 05:43:05,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 05:43:05,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 05:43:05,931 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 05:43:05,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 05:43:04" (1/3) ... [2022-10-16 05:43:05,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64042dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:43:05, skipping insertion in model container [2022-10-16 05:43:05,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:43:04" (2/3) ... [2022-10-16 05:43:05,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64042dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:43:05, skipping insertion in model container [2022-10-16 05:43:05,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:43:05" (3/3) ... [2022-10-16 05:43:05,935 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-2.i [2022-10-16 05:43:05,959 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 05:43:05,959 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2022-10-16 05:43:06,021 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 05:43:06,031 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6b18107, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 05:43:06,031 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2022-10-16 05:43:06,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 73 states have (on average 1.9315068493150684) internal successors, (141), 116 states have internal predecessors, (141), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 05:43:06,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-16 05:43:06,047 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 05:43:06,048 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 05:43:06,049 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-16 05:43:06,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 05:43:06,057 INFO L85 PathProgramCache]: Analyzing trace with hash -46006015, now seen corresponding path program 1 times [2022-10-16 05:43:06,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 05:43:06,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028466593] [2022-10-16 05:43:06,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:43:06,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 05:43:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:43:06,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 05:43:06,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 05:43:06,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028466593] [2022-10-16 05:43:06,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028466593] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 05:43:06,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 05:43:06,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 05:43:06,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958759060] [2022-10-16 05:43:06,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 05:43:06,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 05:43:06,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 05:43:06,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 05:43:06,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 05:43:06,450 INFO L87 Difference]: Start difference. First operand has 121 states, 73 states have (on average 1.9315068493150684) internal successors, (141), 116 states have internal predecessors, (141), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:43:06,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 05:43:06,518 INFO L93 Difference]: Finished difference Result 128 states and 147 transitions. [2022-10-16 05:43:06,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 05:43:06,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-16 05:43:06,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 05:43:06,531 INFO L225 Difference]: With dead ends: 128 [2022-10-16 05:43:06,531 INFO L226 Difference]: Without dead ends: 122 [2022-10-16 05:43:06,533 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-10-16 05:43:06,538 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 7 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 05:43:06,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 258 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 05:43:06,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-10-16 05:43:06,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 116. [2022-10-16 05:43:06,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 71 states have (on average 1.7746478873239437) internal successors, (126), 112 states have internal predecessors, (126), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 05:43:06,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 130 transitions. [2022-10-16 05:43:06,600 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 130 transitions. Word has length 10 [2022-10-16 05:43:06,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 05:43:06,601 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 130 transitions. [2022-10-16 05:43:06,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:43:06,601 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 130 transitions. [2022-10-16 05:43:06,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 05:43:06,602 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 05:43:06,602 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 05:43:06,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 05:43:06,604 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-16 05:43:06,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 05:43:06,606 INFO L85 PathProgramCache]: Analyzing trace with hash 244152622, now seen corresponding path program 1 times [2022-10-16 05:43:06,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 05:43:06,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928271307] [2022-10-16 05:43:06,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:43:06,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 05:43:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:43:06,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 05:43:06,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 05:43:06,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928271307] [2022-10-16 05:43:06,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928271307] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 05:43:06,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 05:43:06,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 05:43:06,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950776721] [2022-10-16 05:43:06,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 05:43:06,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 05:43:06,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 05:43:06,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 05:43:06,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 05:43:06,847 INFO L87 Difference]: Start difference. First operand 116 states and 130 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:43:06,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 05:43:06,994 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2022-10-16 05:43:06,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 05:43:06,995 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-16 05:43:06,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 05:43:06,999 INFO L225 Difference]: With dead ends: 151 [2022-10-16 05:43:06,999 INFO L226 Difference]: Without dead ends: 151 [2022-10-16 05:43:07,000 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-10-16 05:43:07,002 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 40 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 05:43:07,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 234 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 05:43:07,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-10-16 05:43:07,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 115. [2022-10-16 05:43:07,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 71 states have (on average 1.7605633802816902) internal successors, (125), 111 states have internal predecessors, (125), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 05:43:07,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2022-10-16 05:43:07,020 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 13 [2022-10-16 05:43:07,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 05:43:07,021 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2022-10-16 05:43:07,021 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:43:07,021 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2022-10-16 05:43:07,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 05:43:07,022 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 05:43:07,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 05:43:07,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 05:43:07,023 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-16 05:43:07,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 05:43:07,024 INFO L85 PathProgramCache]: Analyzing trace with hash 244152621, now seen corresponding path program 1 times [2022-10-16 05:43:07,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 05:43:07,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785400431] [2022-10-16 05:43:07,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:43:07,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 05:43:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:43:07,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 05:43:07,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 05:43:07,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785400431] [2022-10-16 05:43:07,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785400431] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 05:43:07,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 05:43:07,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 05:43:07,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406761679] [2022-10-16 05:43:07,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 05:43:07,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 05:43:07,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 05:43:07,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 05:43:07,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 05:43:07,161 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:43:07,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 05:43:07,315 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2022-10-16 05:43:07,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 05:43:07,316 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-16 05:43:07,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 05:43:07,319 INFO L225 Difference]: With dead ends: 150 [2022-10-16 05:43:07,319 INFO L226 Difference]: Without dead ends: 150 [2022-10-16 05:43:07,319 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-10-16 05:43:07,322 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 39 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 05:43:07,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 228 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 05:43:07,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-10-16 05:43:07,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 114. [2022-10-16 05:43:07,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 71 states have (on average 1.7464788732394365) internal successors, (124), 110 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 05:43:07,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2022-10-16 05:43:07,340 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 13 [2022-10-16 05:43:07,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 05:43:07,341 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2022-10-16 05:43:07,341 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:43:07,341 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2022-10-16 05:43:07,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 05:43:07,342 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 05:43:07,342 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 05:43:07,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 05:43:07,345 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-16 05:43:07,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 05:43:07,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1021253985, now seen corresponding path program 1 times [2022-10-16 05:43:07,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 05:43:07,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273390060] [2022-10-16 05:43:07,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:43:07,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 05:43:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:43:07,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 05:43:07,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 05:43:07,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273390060] [2022-10-16 05:43:07,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273390060] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 05:43:07,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 05:43:07,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 05:43:07,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293577001] [2022-10-16 05:43:07,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 05:43:07,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 05:43:07,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 05:43:07,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 05:43:07,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 05:43:07,494 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:43:07,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 05:43:07,576 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2022-10-16 05:43:07,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 05:43:07,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-16 05:43:07,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 05:43:07,578 INFO L225 Difference]: With dead ends: 112 [2022-10-16 05:43:07,579 INFO L226 Difference]: Without dead ends: 112 [2022-10-16 05:43:07,579 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-10-16 05:43:07,581 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 35 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 05:43:07,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 162 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 05:43:07,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-10-16 05:43:07,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-10-16 05:43:07,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 71 states have (on average 1.7183098591549295) internal successors, (122), 108 states have internal predecessors, (122), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 05:43:07,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2022-10-16 05:43:07,593 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 14 [2022-10-16 05:43:07,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 05:43:07,594 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2022-10-16 05:43:07,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:43:07,594 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2022-10-16 05:43:07,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 05:43:07,595 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 05:43:07,595 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 05:43:07,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 05:43:07,596 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting sll_appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-16 05:43:07,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 05:43:07,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1021253984, now seen corresponding path program 1 times [2022-10-16 05:43:07,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 05:43:07,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243025273] [2022-10-16 05:43:07,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:43:07,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 05:43:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:43:07,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 05:43:07,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 05:43:07,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243025273] [2022-10-16 05:43:07,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243025273] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 05:43:07,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 05:43:07,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 05:43:07,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622106682] [2022-10-16 05:43:07,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 05:43:07,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 05:43:07,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 05:43:07,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 05:43:07,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 05:43:07,781 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:43:07,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 05:43:07,890 INFO L93 Difference]: Finished difference Result 213 states and 236 transitions. [2022-10-16 05:43:07,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 05:43:07,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-16 05:43:07,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 05:43:07,894 INFO L225 Difference]: With dead ends: 213 [2022-10-16 05:43:07,894 INFO L226 Difference]: Without dead ends: 213 [2022-10-16 05:43:07,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-10-16 05:43:07,896 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 160 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 05:43:07,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 889 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 05:43:07,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-10-16 05:43:07,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 139. [2022-10-16 05:43:07,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 97 states have (on average 1.7010309278350515) internal successors, (165), 134 states have internal predecessors, (165), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 05:43:07,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 169 transitions. [2022-10-16 05:43:07,910 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 169 transitions. Word has length 14 [2022-10-16 05:43:07,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 05:43:07,911 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 169 transitions. [2022-10-16 05:43:07,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:43:07,911 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 169 transitions. [2022-10-16 05:43:07,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-16 05:43:07,912 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 05:43:07,912 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 05:43:07,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 05:43:07,913 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting sll_appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-16 05:43:07,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 05:43:07,914 INFO L85 PathProgramCache]: Analyzing trace with hash -790832604, now seen corresponding path program 1 times [2022-10-16 05:43:07,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 05:43:07,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702742553] [2022-10-16 05:43:07,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:43:07,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 05:43:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:43:07,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 05:43:07,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 05:43:07,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702742553] [2022-10-16 05:43:07,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702742553] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 05:43:07,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389967315] [2022-10-16 05:43:07,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:43:07,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 05:43:07,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 05:43:07,982 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-10-16 05:43:07,991 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-10-16 05:43:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:43:08,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 05:43:08,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 05:43:08,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 05:43:08,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 05:43:08,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 05:43:08,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389967315] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 05:43:08,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 05:43:08,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-10-16 05:43:08,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188662521] [2022-10-16 05:43:08,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 05:43:08,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 05:43:08,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 05:43:08,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 05:43:08,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-10-16 05:43:08,200 INFO L87 Difference]: Start difference. First operand 139 states and 169 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:43:08,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 05:43:08,261 INFO L93 Difference]: Finished difference Result 192 states and 229 transitions. [2022-10-16 05:43:08,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 05:43:08,262 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-10-16 05:43:08,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 05:43:08,263 INFO L225 Difference]: With dead ends: 192 [2022-10-16 05:43:08,263 INFO L226 Difference]: Without dead ends: 192 [2022-10-16 05:43:08,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-10-16 05:43:08,265 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 91 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 05:43:08,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 515 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 05:43:08,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-10-16 05:43:08,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 156. [2022-10-16 05:43:08,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 112 states have (on average 1.6517857142857142) internal successors, (185), 149 states have internal predecessors, (185), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-16 05:43:08,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 193 transitions. [2022-10-16 05:43:08,276 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 193 transitions. Word has length 16 [2022-10-16 05:43:08,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 05:43:08,277 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 193 transitions. [2022-10-16 05:43:08,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:43:08,277 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 193 transitions. [2022-10-16 05:43:08,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 05:43:08,278 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 05:43:08,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 05:43:08,314 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-10-16 05:43:08,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-10-16 05:43:08,493 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting sll_appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-16 05:43:08,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 05:43:08,495 INFO L85 PathProgramCache]: Analyzing trace with hash -924446423, now seen corresponding path program 1 times [2022-10-16 05:43:08,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 05:43:08,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928012866] [2022-10-16 05:43:08,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:43:08,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 05:43:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:43:08,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 05:43:08,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 05:43:08,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928012866] [2022-10-16 05:43:08,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928012866] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 05:43:08,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260470469] [2022-10-16 05:43:08,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:43:08,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 05:43:08,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 05:43:08,698 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-10-16 05:43:08,704 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-10-16 05:43:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:43:08,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjunts are in the unsatisfiable core [2022-10-16 05:43:08,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 05:43:08,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 05:43:08,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 05:43:08,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 05:43:08,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260470469] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 05:43:08,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 05:43:08,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-10-16 05:43:08,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920235380] [2022-10-16 05:43:08,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 05:43:08,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-16 05:43:08,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 05:43:08,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-16 05:43:08,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-10-16 05:43:08,962 INFO L87 Difference]: Start difference. First operand 156 states and 193 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:43:09,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 05:43:09,115 INFO L93 Difference]: Finished difference Result 238 states and 269 transitions. [2022-10-16 05:43:09,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 05:43:09,115 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-10-16 05:43:09,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 05:43:09,117 INFO L225 Difference]: With dead ends: 238 [2022-10-16 05:43:09,117 INFO L226 Difference]: Without dead ends: 238 [2022-10-16 05:43:09,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-10-16 05:43:09,119 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 291 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 05:43:09,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1261 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 05:43:09,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-10-16 05:43:09,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 164. [2022-10-16 05:43:09,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 120 states have (on average 1.6083333333333334) internal successors, (193), 157 states have internal predecessors, (193), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-16 05:43:09,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 201 transitions. [2022-10-16 05:43:09,128 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 201 transitions. Word has length 18 [2022-10-16 05:43:09,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 05:43:09,129 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 201 transitions. [2022-10-16 05:43:09,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:43:09,130 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 201 transitions. [2022-10-16 05:43:09,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-16 05:43:09,131 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 05:43:09,131 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 05:43:09,172 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-10-16 05:43:09,346 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,SelfDestructingSolverStorable6 [2022-10-16 05:43:09,347 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting sll_appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-16 05:43:09,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 05:43:09,348 INFO L85 PathProgramCache]: Analyzing trace with hash 760370116, now seen corresponding path program 2 times [2022-10-16 05:43:09,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 05:43:09,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41351717] [2022-10-16 05:43:09,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:43:09,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 05:43:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:43:09,520 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-16 05:43:09,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 05:43:09,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41351717] [2022-10-16 05:43:09,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41351717] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 05:43:09,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 05:43:09,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 05:43:09,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934091613] [2022-10-16 05:43:09,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 05:43:09,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 05:43:09,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 05:43:09,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 05:43:09,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 05:43:09,524 INFO L87 Difference]: Start difference. First operand 164 states and 201 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:43:09,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 05:43:09,567 INFO L93 Difference]: Finished difference Result 182 states and 205 transitions. [2022-10-16 05:43:09,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 05:43:09,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-10-16 05:43:09,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 05:43:09,569 INFO L225 Difference]: With dead ends: 182 [2022-10-16 05:43:09,570 INFO L226 Difference]: Without dead ends: 182 [2022-10-16 05:43:09,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-10-16 05:43:09,571 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 162 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 05:43:09,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 638 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 05:43:09,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-10-16 05:43:09,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2022-10-16 05:43:09,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 121 states have (on average 1.603305785123967) internal successors, (194), 158 states have internal predecessors, (194), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-16 05:43:09,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 202 transitions. [2022-10-16 05:43:09,579 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 202 transitions. Word has length 26 [2022-10-16 05:43:09,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 05:43:09,579 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 202 transitions. [2022-10-16 05:43:09,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:43:09,580 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 202 transitions. [2022-10-16 05:43:09,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-16 05:43:09,581 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 05:43:09,581 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 05:43:09,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 05:43:09,582 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting sll_appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-16 05:43:09,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 05:43:09,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1087676229, now seen corresponding path program 2 times [2022-10-16 05:43:09,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 05:43:09,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927020497] [2022-10-16 05:43:09,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:43:09,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 05:43:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:43:10,046 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 05:43:10,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 05:43:10,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927020497] [2022-10-16 05:43:10,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927020497] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 05:43:10,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782751444] [2022-10-16 05:43:10,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 05:43:10,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 05:43:10,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 05:43:10,049 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-10-16 05:43:10,070 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-10-16 05:43:10,148 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 05:43:10,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 05:43:10,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 17 conjunts are in the unsatisfiable core [2022-10-16 05:43:10,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 05:43:10,199 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-10-16 05:43:10,209 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-10-16 05:43:10,260 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-16 05:43:10,261 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-10-16 05:43:10,273 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-10-16 05:43:10,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:43:10,333 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-10-16 05:43:10,341 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-16 05:43:10,342 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-10-16 05:43:10,378 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 05:43:10,379 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-10-16 05:43:10,442 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-16 05:43:10,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 05:43:11,031 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 05:43:11,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782751444] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 05:43:11,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 05:43:11,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 4] total 8 [2022-10-16 05:43:11,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856966407] [2022-10-16 05:43:11,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 05:43:11,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-16 05:43:11,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 05:43:11,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-16 05:43:11,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-10-16 05:43:11,034 INFO L87 Difference]: Start difference. First operand 165 states and 202 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:43:11,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 05:43:11,094 INFO L93 Difference]: Finished difference Result 163 states and 198 transitions. [2022-10-16 05:43:11,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 05:43:11,095 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-10-16 05:43:11,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 05:43:11,096 INFO L225 Difference]: With dead ends: 163 [2022-10-16 05:43:11,096 INFO L226 Difference]: Without dead ends: 163 [2022-10-16 05:43:11,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-10-16 05:43:11,097 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 171 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 05:43:11,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 272 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 55 Unchecked, 0.0s Time] [2022-10-16 05:43:11,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-10-16 05:43:11,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2022-10-16 05:43:11,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 121 states have (on average 1.5702479338842976) internal successors, (190), 156 states have internal predecessors, (190), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-16 05:43:11,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 198 transitions. [2022-10-16 05:43:11,104 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 198 transitions. Word has length 26 [2022-10-16 05:43:11,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 05:43:11,105 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 198 transitions. [2022-10-16 05:43:11,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:43:11,105 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 198 transitions. [2022-10-16 05:43:11,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-10-16 05:43:11,107 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 05:43:11,107 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] [2022-10-16 05:43:11,142 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-10-16 05:43:11,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 05:43:11,321 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting sll_appendErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-16 05:43:11,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 05:43:11,322 INFO L85 PathProgramCache]: Analyzing trace with hash 320066679, now seen corresponding path program 1 times [2022-10-16 05:43:11,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 05:43:11,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147790678] [2022-10-16 05:43:11,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:43:11,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 05:43:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:43:11,466 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 05:43:11,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 05:43:11,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147790678] [2022-10-16 05:43:11,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147790678] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 05:43:11,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 05:43:11,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 05:43:11,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560190291] [2022-10-16 05:43:11,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 05:43:11,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 05:43:11,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 05:43:11,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 05:43:11,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 05:43:11,470 INFO L87 Difference]: Start difference. First operand 163 states and 198 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:43:11,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 05:43:11,581 INFO L93 Difference]: Finished difference Result 162 states and 196 transitions. [2022-10-16 05:43:11,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 05:43:11,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-10-16 05:43:11,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 05:43:11,583 INFO L225 Difference]: With dead ends: 162 [2022-10-16 05:43:11,584 INFO L226 Difference]: Without dead ends: 162 [2022-10-16 05:43:11,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-10-16 05:43:11,585 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 83 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 05:43:11,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 288 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 05:43:11,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-10-16 05:43:11,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-10-16 05:43:11,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 121 states have (on average 1.5537190082644627) internal successors, (188), 155 states have internal predecessors, (188), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-16 05:43:11,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 196 transitions. [2022-10-16 05:43:11,592 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 196 transitions. Word has length 31 [2022-10-16 05:43:11,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 05:43:11,593 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 196 transitions. [2022-10-16 05:43:11,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:43:11,593 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 196 transitions. [2022-10-16 05:43:11,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-10-16 05:43:11,594 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 05:43:11,594 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] [2022-10-16 05:43:11,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 05:43:11,595 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting sll_appendErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-16 05:43:11,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 05:43:11,596 INFO L85 PathProgramCache]: Analyzing trace with hash 320066680, now seen corresponding path program 1 times [2022-10-16 05:43:11,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 05:43:11,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794195462] [2022-10-16 05:43:11,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:43:11,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 05:43:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:43:11,785 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 05:43:11,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 05:43:11,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794195462] [2022-10-16 05:43:11,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794195462] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 05:43:11,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 05:43:11,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 05:43:11,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832260944] [2022-10-16 05:43:11,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 05:43:11,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 05:43:11,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 05:43:11,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 05:43:11,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-16 05:43:11,788 INFO L87 Difference]: Start difference. First operand 162 states and 196 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:43:11,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 05:43:11,900 INFO L93 Difference]: Finished difference Result 161 states and 194 transitions. [2022-10-16 05:43:11,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 05:43:11,900 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-10-16 05:43:11,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 05:43:11,902 INFO L225 Difference]: With dead ends: 161 [2022-10-16 05:43:11,902 INFO L226 Difference]: Without dead ends: 161 [2022-10-16 05:43:11,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-10-16 05:43:11,903 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 108 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 05:43:11,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 326 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 05:43:11,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-10-16 05:43:11,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2022-10-16 05:43:11,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 121 states have (on average 1.537190082644628) internal successors, (186), 154 states have internal predecessors, (186), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-16 05:43:11,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 194 transitions. [2022-10-16 05:43:11,910 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 194 transitions. Word has length 31 [2022-10-16 05:43:11,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 05:43:11,910 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 194 transitions. [2022-10-16 05:43:11,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:43:11,911 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 194 transitions. [2022-10-16 05:43:11,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-16 05:43:11,912 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 05:43:11,912 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] [2022-10-16 05:43:11,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 05:43:11,912 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting sll_appendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-16 05:43:11,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 05:43:11,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1332132480, now seen corresponding path program 1 times [2022-10-16 05:43:11,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 05:43:11,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707787575] [2022-10-16 05:43:11,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:43:11,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 05:43:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:43:12,398 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 05:43:12,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 05:43:12,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707787575] [2022-10-16 05:43:12,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707787575] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 05:43:12,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109987628] [2022-10-16 05:43:12,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:43:12,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 05:43:12,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 05:43:12,404 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-10-16 05:43:12,408 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-10-16 05:43:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:43:12,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 26 conjunts are in the unsatisfiable core [2022-10-16 05:43:12,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 05:43:12,529 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-10-16 05:43:12,571 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 05:43:12,572 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-10-16 05:43:12,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:43:12,618 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-10-16 05:43:12,653 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 05:43:12,653 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-10-16 05:43:12,751 INFO L356 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-10-16 05:43:12,752 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 3 case distinctions, treesize of input 21 treesize of output 38 [2022-10-16 05:43:12,946 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 05:43:12,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 05:43:13,377 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 05:43:13,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109987628] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 05:43:13,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 05:43:13,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 17 [2022-10-16 05:43:13,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612204259] [2022-10-16 05:43:13,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 05:43:13,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-16 05:43:13,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 05:43:13,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-16 05:43:13,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-10-16 05:43:13,383 INFO L87 Difference]: Start difference. First operand 161 states and 194 transitions. Second operand has 18 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:43:13,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 05:43:13,800 INFO L93 Difference]: Finished difference Result 222 states and 267 transitions. [2022-10-16 05:43:13,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 05:43:13,801 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-10-16 05:43:13,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 05:43:13,803 INFO L225 Difference]: With dead ends: 222 [2022-10-16 05:43:13,803 INFO L226 Difference]: Without dead ends: 222 [2022-10-16 05:43:13,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-10-16 05:43:13,804 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 283 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 05:43:13,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 782 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 341 Invalid, 0 Unknown, 164 Unchecked, 0.3s Time] [2022-10-16 05:43:13,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-10-16 05:43:13,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 213. [2022-10-16 05:43:13,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 170 states have (on average 1.4764705882352942) internal successors, (251), 205 states have internal predecessors, (251), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 05:43:13,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 265 transitions. [2022-10-16 05:43:13,819 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 265 transitions. Word has length 32 [2022-10-16 05:43:13,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 05:43:13,819 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 265 transitions. [2022-10-16 05:43:13,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:43:13,819 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 265 transitions. [2022-10-16 05:43:13,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-16 05:43:13,820 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 05:43:13,824 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] [2022-10-16 05:43:13,874 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-10-16 05:43:14,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 05:43:14,025 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting sll_appendErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-16 05:43:14,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 05:43:14,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1332132481, now seen corresponding path program 1 times [2022-10-16 05:43:14,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 05:43:14,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521119834] [2022-10-16 05:43:14,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:43:14,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 05:43:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:43:14,615 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 05:43:14,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 05:43:14,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521119834] [2022-10-16 05:43:14,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521119834] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 05:43:14,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628554613] [2022-10-16 05:43:14,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:43:14,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 05:43:14,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 05:43:14,619 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-10-16 05:43:14,630 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-10-16 05:43:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:43:14,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 24 conjunts are in the unsatisfiable core [2022-10-16 05:43:14,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 05:43:14,754 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-10-16 05:43:14,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:43:14,825 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-10-16 05:43:14,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:43:14,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-10-16 05:43:14,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:43:14,909 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-10-16 05:43:14,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:43:14,939 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-10-16 05:43:14,979 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 05:43:14,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 05:43:19,261 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_22| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_22| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_21| Int) (v_ArrVal_397 Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_21| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_398 Int)) (<= (+ |c_sll_append_~head#1.offset| 4) (select (store (store |c_#length| |v_sll_append_sll_create_~new_head~0#1.base_22| v_ArrVal_397) |v_sll_append_sll_create_~new_head~0#1.base_21| v_ArrVal_398) |c_sll_append_~head#1.base|))))))) (<= 0 |c_sll_append_~head#1.offset|)) is different from false [2022-10-16 05:43:21,401 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_23| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_23| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_22| Int) (v_ArrVal_396 Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_22| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_21| Int) (v_ArrVal_397 Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_21| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_398 Int)) (<= (+ |c_sll_append_~head#1.offset| 4) (select (store (store (store |c_#length| |v_sll_append_sll_create_~new_head~0#1.base_23| v_ArrVal_396) |v_sll_append_sll_create_~new_head~0#1.base_22| v_ArrVal_397) |v_sll_append_sll_create_~new_head~0#1.base_21| v_ArrVal_398) |c_sll_append_~head#1.base|))))))))) (<= 0 |c_sll_append_~head#1.offset|)) is different from false [2022-10-16 05:43:35,623 WARN L233 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-16 05:43:53,626 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-16 05:43:53,878 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-10-16 05:43:53,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628554613] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 05:43:53,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 05:43:53,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 7] total 13 [2022-10-16 05:43:53,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817870007] [2022-10-16 05:43:53,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 05:43:53,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-16 05:43:53,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 05:43:53,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-16 05:43:53,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=100, Unknown=4, NotChecked=42, Total=182 [2022-10-16 05:43:53,881 INFO L87 Difference]: Start difference. First operand 213 states and 265 transitions. Second operand has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:43:54,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 05:43:54,201 INFO L93 Difference]: Finished difference Result 234 states and 284 transitions. [2022-10-16 05:43:54,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 05:43:54,202 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-10-16 05:43:54,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 05:43:54,205 INFO L225 Difference]: With dead ends: 234 [2022-10-16 05:43:54,205 INFO L226 Difference]: Without dead ends: 234 [2022-10-16 05:43:54,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 38.2s TimeCoverageRelationStatistics Valid=45, Invalid=115, Unknown=4, NotChecked=46, Total=210 [2022-10-16 05:43:54,206 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 210 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 346 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 05:43:54,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 314 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 214 Invalid, 0 Unknown, 346 Unchecked, 0.2s Time] [2022-10-16 05:43:54,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-10-16 05:43:54,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 207. [2022-10-16 05:43:54,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 170 states have (on average 1.4176470588235295) internal successors, (241), 199 states have internal predecessors, (241), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 05:43:54,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 255 transitions. [2022-10-16 05:43:54,219 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 255 transitions. Word has length 32 [2022-10-16 05:43:54,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 05:43:54,220 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 255 transitions. [2022-10-16 05:43:54,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:43:54,220 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 255 transitions. [2022-10-16 05:43:54,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-10-16 05:43:54,221 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 05:43:54,221 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, 1, 1] [2022-10-16 05:43:54,262 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-10-16 05:43:54,437 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,SelfDestructingSolverStorable12 [2022-10-16 05:43:54,438 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting sll_appendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-16 05:43:54,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 05:43:54,439 INFO L85 PathProgramCache]: Analyzing trace with hash 60922559, now seen corresponding path program 1 times [2022-10-16 05:43:54,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 05:43:54,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287720688] [2022-10-16 05:43:54,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:43:54,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 05:43:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:43:55,307 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 05:43:55,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 05:43:55,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287720688] [2022-10-16 05:43:55,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287720688] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 05:43:55,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430609152] [2022-10-16 05:43:55,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:43:55,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 05:43:55,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 05:43:55,310 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-10-16 05:43:55,321 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-10-16 05:43:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:43:55,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 64 conjunts are in the unsatisfiable core [2022-10-16 05:43:55,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 05:43:55,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:43:55,695 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-10-16 05:43:55,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:43:55,705 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-10-16 05:43:55,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:43:55,896 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-10-16 05:43:55,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:43:55,906 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-10-16 05:43:56,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:43:56,192 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-10-16 05:43:56,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:43:56,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:43:56,214 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-10-16 05:43:56,215 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-10-16 05:43:56,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:43:56,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:43:56,399 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 05:43:56,400 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-10-16 05:43:56,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:43:56,421 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-10-16 05:43:56,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:43:56,493 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-10-16 05:43:56,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:43:56,503 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-10-16 05:43:56,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:43:56,597 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-10-16 05:43:56,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:43:56,605 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-10-16 05:43:56,637 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-10-16 05:43:56,641 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-10-16 05:43:56,650 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 05:43:56,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 05:43:56,679 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_~new_last~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_~new_last~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-10-16 05:43:56,689 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_503 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_#res#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|))) (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_#res#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-10-16 05:43:56,697 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-10-16 05:43:56,744 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|)))) is different from false [2022-10-16 05:43:56,770 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2022-10-16 05:43:56,793 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|))))) is different from false [2022-10-16 05:43:56,818 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2022-10-16 05:43:56,884 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|))))) is different from false [2022-10-16 05:43:56,924 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|))))) is different from false [2022-10-16 05:43:56,992 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_492 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_491 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|))))) is different from false [2022-10-16 05:43:57,085 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (forall ((v_ArrVal_491 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_492 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|))))))) is different from false [2022-10-16 05:43:57,300 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (forall ((v_ArrVal_492 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_503) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_491 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_504) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|))))) is different from false [2022-10-16 05:43:57,395 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_492 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_503) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_491 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= 0 (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_504) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|))))) is different from false [2022-10-16 05:43:57,819 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-10-16 05:43:57,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430609152] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 05:43:57,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 05:43:57,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 18] total 41 [2022-10-16 05:43:57,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738101675] [2022-10-16 05:43:57,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 05:43:57,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-10-16 05:43:57,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 05:43:57,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-10-16 05:43:57,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=632, Unknown=13, NotChecked=832, Total=1640 [2022-10-16 05:43:57,823 INFO L87 Difference]: Start difference. First operand 207 states and 255 transitions. Second operand has 41 states, 41 states have (on average 2.1707317073170733) internal successors, (89), 38 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:43:57,840 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_492 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_503) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |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) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_491 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= 0 (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_504) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (= (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-10-16 05:43:57,853 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_sll_append_#in~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_sll_append_#in~head#1.base|))) (and (= |c_sll_append_#in~head#1.offset| 0) (= (select .cse0 0) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_sll_append_#in~head#1.base|) (< |c_#StackHeapBarrier| |c_sll_append_#in~head#1.base|) (= (select .cse1 |c_sll_append_#in~head#1.offset|) 0) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (forall ((v_ArrVal_492 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_492))) (store .cse3 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse3 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 0))))) (store .cse2 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse2 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_503) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|)))) (= (select .cse1 0) 0) (= (select |c_#valid| |c_sll_append_#in~head#1.base|) 1) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_491 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_504) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|)))) (= (select .cse0 |c_sll_append_#in~head#1.offset|) 0))) is different from false [2022-10-16 05:43:57,865 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (forall ((v_ArrVal_491 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_492 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-10-16 05:43:57,875 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (forall ((v_ArrVal_492 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((v_ArrVal_491 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-10-16 05:43:59,882 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-10-16 05:43:59,909 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-10-16 05:44:01,915 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-10-16 05:44:01,928 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (exists ((|sll_append_sll_create_~new_head~0#1.base| Int)) (and (< |sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset|) 0))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-10-16 05:44:01,938 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|sll_append_sll_create_~new_head~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~head~0#1.offset|) 0) (< |sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-10-16 05:44:05,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 05:44:05,232 INFO L93 Difference]: Finished difference Result 255 states and 311 transitions. [2022-10-16 05:44:05,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-10-16 05:44:05,233 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.1707317073170733) internal successors, (89), 38 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-10-16 05:44:05,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 05:44:05,235 INFO L225 Difference]: With dead ends: 255 [2022-10-16 05:44:05,235 INFO L226 Difference]: Without dead ends: 255 [2022-10-16 05:44:05,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=211, Invalid=785, Unknown=22, NotChecked=1738, Total=2756 [2022-10-16 05:44:05,237 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 22 mSDsluCounter, 1874 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1966 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 530 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 05:44:05,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1966 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 223 Invalid, 0 Unknown, 530 Unchecked, 0.2s Time] [2022-10-16 05:44:05,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-10-16 05:44:05,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 238. [2022-10-16 05:44:05,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 199 states have (on average 1.3668341708542713) internal successors, (272), 229 states have internal predecessors, (272), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (11), 4 states have call predecessors, (11), 8 states have call successors, (11) [2022-10-16 05:44:05,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 291 transitions. [2022-10-16 05:44:05,247 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 291 transitions. Word has length 35 [2022-10-16 05:44:05,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 05:44:05,247 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 291 transitions. [2022-10-16 05:44:05,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.1707317073170733) internal successors, (89), 38 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:44:05,248 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 291 transitions. [2022-10-16 05:44:05,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-10-16 05:44:05,249 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 05:44:05,249 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, 1, 1] [2022-10-16 05:44:05,282 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-10-16 05:44:05,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 05:44:05,463 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting sll_appendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-16 05:44:05,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 05:44:05,464 INFO L85 PathProgramCache]: Analyzing trace with hash 762522433, now seen corresponding path program 1 times [2022-10-16 05:44:05,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 05:44:05,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586798689] [2022-10-16 05:44:05,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:44:05,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 05:44:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:44:05,506 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 05:44:05,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 05:44:05,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586798689] [2022-10-16 05:44:05,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586798689] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 05:44:05,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 05:44:05,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 05:44:05,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391375273] [2022-10-16 05:44:05,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 05:44:05,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 05:44:05,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 05:44:05,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 05:44:05,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 05:44:05,509 INFO L87 Difference]: Start difference. First operand 238 states and 291 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:44:05,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 05:44:05,520 INFO L93 Difference]: Finished difference Result 242 states and 292 transitions. [2022-10-16 05:44:05,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 05:44:05,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-10-16 05:44:05,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 05:44:05,523 INFO L225 Difference]: With dead ends: 242 [2022-10-16 05:44:05,523 INFO L226 Difference]: Without dead ends: 242 [2022-10-16 05:44:05,523 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-10-16 05:44:05,524 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 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-10-16 05:44:05,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 05:44:05,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-10-16 05:44:05,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-10-16 05:44:05,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 204 states have (on average 1.3529411764705883) internal successors, (276), 233 states have internal predecessors, (276), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2022-10-16 05:44:05,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 292 transitions. [2022-10-16 05:44:05,533 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 292 transitions. Word has length 35 [2022-10-16 05:44:05,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 05:44:05,533 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 292 transitions. [2022-10-16 05:44:05,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:44:05,533 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 292 transitions. [2022-10-16 05:44:05,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-16 05:44:05,534 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 05:44:05,534 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-16 05:44:05,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-16 05:44:05,535 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting sll_appendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-16 05:44:05,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 05:44:05,535 INFO L85 PathProgramCache]: Analyzing trace with hash 444674194, now seen corresponding path program 1 times [2022-10-16 05:44:05,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 05:44:05,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500564395] [2022-10-16 05:44:05,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:44:05,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 05:44:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:44:05,655 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-16 05:44:05,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 05:44:05,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500564395] [2022-10-16 05:44:05,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500564395] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 05:44:05,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861032214] [2022-10-16 05:44:05,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:44:05,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 05:44:05,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 05:44:05,657 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-10-16 05:44:05,667 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-10-16 05:44:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:44:05,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-16 05:44:05,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 05:44:05,800 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-16 05:44:05,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 05:44:05,862 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-16 05:44:05,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861032214] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 05:44:05,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 05:44:05,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-10-16 05:44:05,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239140656] [2022-10-16 05:44:05,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 05:44:05,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-16 05:44:05,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 05:44:05,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-16 05:44:05,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-10-16 05:44:05,866 INFO L87 Difference]: Start difference. First operand 242 states and 292 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:44:05,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 05:44:05,949 INFO L93 Difference]: Finished difference Result 257 states and 300 transitions. [2022-10-16 05:44:05,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 05:44:05,950 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-10-16 05:44:05,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 05:44:05,953 INFO L225 Difference]: With dead ends: 257 [2022-10-16 05:44:05,953 INFO L226 Difference]: Without dead ends: 257 [2022-10-16 05:44:05,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-10-16 05:44:05,954 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 296 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 05:44:05,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 693 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 05:44:05,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-10-16 05:44:05,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 250. [2022-10-16 05:44:05,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 212 states have (on average 1.3396226415094339) internal successors, (284), 241 states have internal predecessors, (284), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2022-10-16 05:44:05,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 300 transitions. [2022-10-16 05:44:05,964 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 300 transitions. Word has length 36 [2022-10-16 05:44:05,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 05:44:05,964 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 300 transitions. [2022-10-16 05:44:05,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:44:05,964 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 300 transitions. [2022-10-16 05:44:05,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-16 05:44:05,966 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 05:44:05,966 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, 1, 1] [2022-10-16 05:44:06,003 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-10-16 05:44:06,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 05:44:06,182 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting sll_appendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-16 05:44:06,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 05:44:06,183 INFO L85 PathProgramCache]: Analyzing trace with hash -308582730, now seen corresponding path program 1 times [2022-10-16 05:44:06,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 05:44:06,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687899420] [2022-10-16 05:44:06,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:44:06,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 05:44:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:44:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 05:44:06,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 05:44:06,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687899420] [2022-10-16 05:44:06,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687899420] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 05:44:06,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353373588] [2022-10-16 05:44:06,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:44:06,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 05:44:06,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 05:44:06,374 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-10-16 05:44:06,395 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-10-16 05:44:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:44:06,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 13 conjunts are in the unsatisfiable core [2022-10-16 05:44:06,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 05:44:06,544 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 05:44:06,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 05:44:06,613 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 05:44:06,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353373588] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 05:44:06,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 05:44:06,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2022-10-16 05:44:06,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826120150] [2022-10-16 05:44:06,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 05:44:06,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-16 05:44:06,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 05:44:06,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-16 05:44:06,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-10-16 05:44:06,616 INFO L87 Difference]: Start difference. First operand 250 states and 300 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:44:06,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 05:44:06,769 INFO L93 Difference]: Finished difference Result 361 states and 419 transitions. [2022-10-16 05:44:06,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-16 05:44:06,769 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-10-16 05:44:06,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 05:44:06,772 INFO L225 Difference]: With dead ends: 361 [2022-10-16 05:44:06,772 INFO L226 Difference]: Without dead ends: 361 [2022-10-16 05:44:06,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2022-10-16 05:44:06,773 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 156 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 05:44:06,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 1284 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 05:44:06,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-10-16 05:44:06,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 313. [2022-10-16 05:44:06,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 274 states have (on average 1.3467153284671534) internal successors, (369), 303 states have internal predecessors, (369), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 05:44:06,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 383 transitions. [2022-10-16 05:44:06,784 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 383 transitions. Word has length 40 [2022-10-16 05:44:06,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 05:44:06,784 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 383 transitions. [2022-10-16 05:44:06,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:44:06,785 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 383 transitions. [2022-10-16 05:44:06,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-10-16 05:44:06,785 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 05:44:06,786 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 05:44:06,824 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-10-16 05:44:07,001 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,SelfDestructingSolverStorable16 [2022-10-16 05:44:07,001 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting sll_appendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-16 05:44:07,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 05:44:07,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1726785188, now seen corresponding path program 2 times [2022-10-16 05:44:07,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 05:44:07,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443296755] [2022-10-16 05:44:07,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:44:07,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 05:44:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:44:07,453 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-10-16 05:44:07,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 05:44:07,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443296755] [2022-10-16 05:44:07,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443296755] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 05:44:07,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83484182] [2022-10-16 05:44:07,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 05:44:07,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 05:44:07,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 05:44:07,455 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-10-16 05:44:07,474 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-10-16 05:44:07,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 05:44:07,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 05:44:07,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 26 conjunts are in the unsatisfiable core [2022-10-16 05:44:07,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 05:44:07,611 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-10-16 05:44:07,670 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 05:44:07,671 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-10-16 05:44:07,714 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 05:44:07,714 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-10-16 05:44:07,796 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-10-16 05:44:07,797 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 3 case distinctions, treesize of input 22 treesize of output 43 [2022-10-16 05:44:07,902 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-10-16 05:44:07,903 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 3 case distinctions, treesize of input 22 treesize of output 43 [2022-10-16 05:44:08,083 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-10-16 05:44:08,083 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 05:44:08,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83484182] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 05:44:08,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 05:44:08,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 12 [2022-10-16 05:44:08,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58856855] [2022-10-16 05:44:08,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 05:44:08,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-16 05:44:08,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 05:44:08,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-16 05:44:08,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-10-16 05:44:08,085 INFO L87 Difference]: Start difference. First operand 313 states and 383 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:44:08,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 05:44:08,293 INFO L93 Difference]: Finished difference Result 339 states and 409 transitions. [2022-10-16 05:44:08,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 05:44:08,293 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-10-16 05:44:08,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 05:44:08,296 INFO L225 Difference]: With dead ends: 339 [2022-10-16 05:44:08,296 INFO L226 Difference]: Without dead ends: 339 [2022-10-16 05:44:08,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-10-16 05:44:08,297 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 163 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 05:44:08,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 389 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 83 Unchecked, 0.1s Time] [2022-10-16 05:44:08,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-10-16 05:44:08,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 256. [2022-10-16 05:44:08,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 221 states have (on average 1.3529411764705883) internal successors, (299), 247 states have internal predecessors, (299), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-16 05:44:08,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 309 transitions. [2022-10-16 05:44:08,307 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 309 transitions. Word has length 44 [2022-10-16 05:44:08,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 05:44:08,307 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 309 transitions. [2022-10-16 05:44:08,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:44:08,308 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 309 transitions. [2022-10-16 05:44:08,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-10-16 05:44:08,308 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 05:44:08,308 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, 1, 1] [2022-10-16 05:44:08,350 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-10-16 05:44:08,522 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,SelfDestructingSolverStorable17 [2022-10-16 05:44:08,522 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting sll_appendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-16 05:44:08,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 05:44:08,523 INFO L85 PathProgramCache]: Analyzing trace with hash 685803597, now seen corresponding path program 2 times [2022-10-16 05:44:08,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 05:44:08,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66138861] [2022-10-16 05:44:08,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:44:08,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 05:44:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:44:09,419 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-10-16 05:44:09,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 05:44:09,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66138861] [2022-10-16 05:44:09,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66138861] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 05:44:09,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073699777] [2022-10-16 05:44:09,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 05:44:09,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 05:44:09,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 05:44:09,422 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-10-16 05:44:09,425 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-10-16 05:44:09,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 05:44:09,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 05:44:09,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 61 conjunts are in the unsatisfiable core [2022-10-16 05:44:09,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 05:44:09,582 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-10-16 05:44:09,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:09,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-10-16 05:44:09,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:09,833 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-10-16 05:44:09,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:09,914 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-10-16 05:44:09,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:09,923 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-10-16 05:44:10,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:10,023 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-10-16 05:44:10,024 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-10-16 05:44:10,094 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-10-16 05:44:10,100 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-10-16 05:44:10,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:10,216 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-10-16 05:44:10,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:10,222 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-10-16 05:44:10,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:10,308 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-10-16 05:44:10,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:10,318 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-10-16 05:44:10,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:10,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-10-16 05:44:10,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:10,409 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-10-16 05:44:10,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:10,431 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-10-16 05:44:10,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:10,440 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-10-16 05:44:10,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:10,522 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-10-16 05:44:10,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:10,531 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-10-16 05:44:10,582 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-10-16 05:44:10,584 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-10-16 05:44:10,592 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 05:44:10,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 05:44:10,609 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_~new_last~0#1.base| v_ArrVal_924) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_~new_last~0#1.base| v_ArrVal_923) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-10-16 05:44:10,624 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_~new_last~0#1.base_12| Int)) (or (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_sll_append_~new_last~0#1.base_12| v_ArrVal_924) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (<= |v_sll_append_~new_last~0#1.base_12| |c_sll_append_node_create_with_sublist_#res#1.base|)))) (forall ((|v_sll_append_~new_last~0#1.base_12| Int)) (or (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_sll_append_~new_last~0#1.base_12| v_ArrVal_923) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (<= |v_sll_append_~new_last~0#1.base_12| |c_sll_append_node_create_with_sublist_#res#1.base|))))) is different from false [2022-10-16 05:44:10,648 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_923 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store |c_#memory_$Pointer$.base| |v_sll_append_~new_last~0#1.base_12| v_ArrVal_923) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|))) (forall ((v_ArrVal_924 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store |c_#memory_$Pointer$.offset| |v_sll_append_~new_last~0#1.base_12| v_ArrVal_924) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|)))) is different from false [2022-10-16 05:44:10,666 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_921 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_921) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_923) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_922) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_924) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|)))) is different from false [2022-10-16 05:44:10,765 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_921 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_918 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_918) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_921) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_923) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|))) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_917) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_922) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_924) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|)))) is different from false [2022-10-16 05:44:10,813 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_917) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_922) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_924) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_921 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_918 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_918) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_921) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_923) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|)))))) is different from false [2022-10-16 05:44:10,882 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_916 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_916) |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_917) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_922) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_924) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_915 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_921 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_918 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_915) |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_918) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_921) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_923) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|)))))) is different from false [2022-10-16 05:44:10,981 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_38| Int)) (or (forall ((v_ArrVal_915 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_921 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_918 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_38| v_ArrVal_915) |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_918) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_921) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_923) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_38| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_38| Int)) (or (forall ((v_ArrVal_916 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_38| v_ArrVal_916) |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_917) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_922) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_924) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_38| |c_#StackHeapBarrier|))))) is different from false [2022-10-16 05:44:11,111 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_914 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_38| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_38| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_916 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_914) |v_sll_append_sll_create_~new_head~0#1.base_38| v_ArrVal_916) |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_917) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_922) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_924) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|))))))) (forall ((v_ArrVal_913 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_38| Int)) (or (forall ((v_ArrVal_915 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_921 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_918 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_913) |v_sll_append_sll_create_~new_head~0#1.base_38| v_ArrVal_915) |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_918) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_921) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_923) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_38| |c_#StackHeapBarrier|))))) is different from false [2022-10-16 05:44:18,329 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 4 trivial. 27 not checked. [2022-10-16 05:44:18,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073699777] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 05:44:18,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 05:44:18,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 19] total 40 [2022-10-16 05:44:18,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770501896] [2022-10-16 05:44:18,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 05:44:18,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-10-16 05:44:18,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 05:44:18,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-10-16 05:44:18,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=786, Unknown=15, NotChecked=594, Total=1560 [2022-10-16 05:44:18,332 INFO L87 Difference]: Start difference. First operand 256 states and 309 transitions. Second operand has 40 states, 40 states have (on average 2.55) internal successors, (102), 37 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:44:20,483 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= (select |c_#valid| |c_sll_append_~head#1.base|) 1) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_38| Int)) (or (forall ((v_ArrVal_915 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_921 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_918 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_38| v_ArrVal_915) |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_918) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_921) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_923) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_38| |c_#StackHeapBarrier|)))) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_38| Int)) (or (forall ((v_ArrVal_916 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_38| v_ArrVal_916) |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_917) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_922) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_924) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_38| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= (select |c_#valid| |c_sll_append_sll_create_~new_head~0#1.base|) 1) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-10-16 05:44:22,488 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (exists ((|sll_append_sll_create_~new_head~0#1.base| Int)) (and (< |sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select |c_#valid| |sll_append_sll_create_~new_head~0#1.base|) 1))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= (select |c_#valid| |c_sll_append_~head#1.base|) 1) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_38| Int)) (or (forall ((v_ArrVal_915 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_921 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_918 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_38| v_ArrVal_915) |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_918) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_921) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_923) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_38| |c_#StackHeapBarrier|)))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_38| Int)) (or (forall ((v_ArrVal_916 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_38| v_ArrVal_916) |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_917) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_922) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_924) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_38| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-10-16 05:44:24,623 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_917) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_922) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_924) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_38| Int)) (or (forall ((v_ArrVal_915 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_921 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_918 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_38| v_ArrVal_915) |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_918) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_921) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_923) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_38| |c_#StackHeapBarrier|)))) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_921 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_918 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_918) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_921) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_923) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_38| Int)) (or (forall ((v_ArrVal_916 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_38| v_ArrVal_916) |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_917) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_922) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_924) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_38| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-10-16 05:44:24,637 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_917) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_922) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_924) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_38| Int)) (or (forall ((v_ArrVal_915 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_921 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_918 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_38| v_ArrVal_915) |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_918) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_921) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_923) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_38| |c_#StackHeapBarrier|)))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_921 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_918 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_918) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_921) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_923) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_38| Int)) (or (forall ((v_ArrVal_916 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_38| v_ArrVal_916) |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_917) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_922) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_924) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_38| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-10-16 05:44:25,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 05:44:25,086 INFO L93 Difference]: Finished difference Result 312 states and 376 transitions. [2022-10-16 05:44:25,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 05:44:25,087 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.55) internal successors, (102), 37 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-10-16 05:44:25,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 05:44:25,089 INFO L225 Difference]: With dead ends: 312 [2022-10-16 05:44:25,089 INFO L226 Difference]: Without dead ends: 312 [2022-10-16 05:44:25,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=218, Invalid=1005, Unknown=19, NotChecked=1014, Total=2256 [2022-10-16 05:44:25,092 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 45 mSDsluCounter, 1823 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1922 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 797 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 05:44:25,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1922 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 238 Invalid, 0 Unknown, 797 Unchecked, 0.3s Time] [2022-10-16 05:44:25,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-10-16 05:44:25,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 306. [2022-10-16 05:44:25,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 268 states have (on average 1.3134328358208955) internal successors, (352), 296 states have internal predecessors, (352), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2022-10-16 05:44:25,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 368 transitions. [2022-10-16 05:44:25,103 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 368 transitions. Word has length 44 [2022-10-16 05:44:25,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 05:44:25,103 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 368 transitions. [2022-10-16 05:44:25,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.55) internal successors, (102), 37 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:44:25,104 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 368 transitions. [2022-10-16 05:44:25,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-10-16 05:44:25,104 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 05:44:25,105 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-10-16 05:44:25,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-10-16 05:44:25,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 05:44:25,321 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting sll_appendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-16 05:44:25,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 05:44:25,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1834257435, now seen corresponding path program 1 times [2022-10-16 05:44:25,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 05:44:25,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160714253] [2022-10-16 05:44:25,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:44:25,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 05:44:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:44:26,246 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-10-16 05:44:26,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 05:44:26,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160714253] [2022-10-16 05:44:26,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160714253] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 05:44:26,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113315311] [2022-10-16 05:44:26,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:44:26,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 05:44:26,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 05:44:26,251 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 05:44:26,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-10-16 05:44:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:44:26,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 64 conjunts are in the unsatisfiable core [2022-10-16 05:44:26,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 05:44:26,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:26,743 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-10-16 05:44:26,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:26,752 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-10-16 05:44:26,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:26,934 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-10-16 05:44:26,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:26,943 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-10-16 05:44:27,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:27,214 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-10-16 05:44:27,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:27,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:27,230 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-10-16 05:44:27,230 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-10-16 05:44:27,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:27,402 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-10-16 05:44:27,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:27,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:27,423 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 05:44:27,423 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-10-16 05:44:27,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:27,487 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-10-16 05:44:27,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:27,497 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-10-16 05:44:27,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:27,599 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-10-16 05:44:27,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:27,606 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-10-16 05:44:27,638 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-10-16 05:44:27,641 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-10-16 05:44:27,649 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-16 05:44:27,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 05:44:27,674 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1029 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_~new_last~0#1.base| v_ArrVal_1029) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1030 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_~new_last~0#1.base| v_ArrVal_1030) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-10-16 05:44:27,683 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1029 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_#res#1.base| v_ArrVal_1029) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1030 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_#res#1.base| v_ArrVal_1030) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-10-16 05:44:27,693 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1030 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1030) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1029 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1029) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-10-16 05:44:27,745 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1024) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1030) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1029 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1029) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-10-16 05:44:27,770 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1024) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1030) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1029 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_43| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_43|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1029) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2022-10-16 05:44:27,803 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1024) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1030) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (forall ((v_ArrVal_1029 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_43| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_43|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1029) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|))))) is different from false [2022-10-16 05:44:27,829 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1029 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_43| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_43|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1029) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (v_ArrVal_1019 (Array Int Int))) (or (forall ((v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1019) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1024) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1030) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|))))) is different from false [2022-10-16 05:44:27,903 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_44| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1029 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_44| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_44|) 0 |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_43| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_43|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1029) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_44| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (v_ArrVal_1019 (Array Int Int))) (or (forall ((v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1019) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1024) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1030) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|))))))) is different from false [2022-10-16 05:44:27,941 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_44| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1029 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_44| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_44|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_43| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_43|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1029) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_44| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (v_ArrVal_1019 (Array Int Int))) (or (forall ((v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1019) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1024) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1030) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|))))))) is different from false [2022-10-16 05:44:28,773 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_44| Int) (v_ArrVal_1017 (Array Int Int))) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (v_ArrVal_1019 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1017) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1019) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1024) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1030) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1018 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_44| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1029 (Array Int Int))) (= 0 (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1018))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_44| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_44|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_43| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_43|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1029) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|))))) is different from false [2022-10-16 05:44:28,854 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_45| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_45| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_44| Int) (v_ArrVal_1017 (Array Int Int))) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (v_ArrVal_1019 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1017) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1019) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1024) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1030) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_45| Int)) (or (forall ((v_ArrVal_1018 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_44| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (forall ((v_ArrVal_1029 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1018))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_44| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_44|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_43| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_43|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1029) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_45| |c_#StackHeapBarrier|))))) is different from false [2022-10-16 05:44:29,029 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_45| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_45| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_44| Int) (v_ArrVal_1017 (Array Int Int))) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (v_ArrVal_1019 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1017) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1019) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1024) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1030) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)))))))) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_45| Int)) (or (forall ((v_ArrVal_1018 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_44| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (forall ((v_ArrVal_1029 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1018))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_44| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_44|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_43| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_43|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1029) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_45| |c_#StackHeapBarrier|))))))) is different from false [2022-10-16 05:44:29,116 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_45| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_45| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_44| Int) (v_ArrVal_1017 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (v_ArrVal_1019 (Array Int Int))) (or (forall ((v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1017) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1019) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1024) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1030) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)))))))))) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_45| Int)) (or (forall ((v_ArrVal_1018 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_44| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1029 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1018))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_44| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_44|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_43| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_43|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1029) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_45| |c_#StackHeapBarrier|))))))) is different from false [2022-10-16 05:44:30,417 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 15 not checked. [2022-10-16 05:44:30,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113315311] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 05:44:30,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 05:44:30,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 18] total 41 [2022-10-16 05:44:30,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968049313] [2022-10-16 05:44:30,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 05:44:30,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-10-16 05:44:30,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 05:44:30,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-10-16 05:44:30,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=632, Unknown=13, NotChecked=832, Total=1640 [2022-10-16 05:44:30,421 INFO L87 Difference]: Start difference. First operand 306 states and 368 transitions. Second operand has 41 states, 41 states have (on average 2.317073170731707) internal successors, (95), 38 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:44:30,447 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) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_45| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_45| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_44| Int) (v_ArrVal_1017 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (v_ArrVal_1019 (Array Int Int))) (or (forall ((v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1017) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1019) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1024) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1030) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |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|) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_45| Int)) (or (forall ((v_ArrVal_1018 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_44| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1029 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1018))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_44| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_44|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_43| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_43|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1029) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_45| |c_#StackHeapBarrier|))))))) is different from false [2022-10-16 05:44:30,519 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_sll_append_#in~head#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_sll_append_#in~head#1.base|) (< |c_#StackHeapBarrier| |c_sll_append_#in~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0) (= (select |c_#valid| |c_sll_append_#in~head#1.base|) 1) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_45| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_45| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_44| Int) (v_ArrVal_1017 (Array Int Int))) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (v_ArrVal_1019 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1017) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1019) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1024) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1030) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_45| Int)) (or (forall ((v_ArrVal_1018 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_44| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (forall ((v_ArrVal_1029 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1018))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_44| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_44|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_43| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_43|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1029) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_45| |c_#StackHeapBarrier|))))))) is different from false [2022-10-16 05:44:30,531 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_45| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_45| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_44| Int) (v_ArrVal_1017 (Array Int Int))) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (v_ArrVal_1019 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1017) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1019) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1024) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1030) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)))))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_45| Int)) (or (forall ((v_ArrVal_1018 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_44| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (forall ((v_ArrVal_1029 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1018))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_44| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_44|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_43| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_43|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1029) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_45| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-10-16 05:44:30,720 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_44| Int) (v_ArrVal_1017 (Array Int Int))) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (v_ArrVal_1019 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1017) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1019) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1024) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1030) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1018 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_44| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1029 (Array Int Int))) (= 0 (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1018))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_44| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_44|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_43| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_43|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1029) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-10-16 05:44:32,732 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_44| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1029 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_44| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_44|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_43| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_43|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1029) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)))) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_44| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (v_ArrVal_1019 (Array Int Int))) (or (forall ((v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1019) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1024) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1030) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)))))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-10-16 05:44:32,746 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_44| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1029 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_44| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_44|) 0 |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_43| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_43|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1029) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_44| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (v_ArrVal_1019 (Array Int Int))) (or (forall ((v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1019) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1024) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1030) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)))))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-10-16 05:44:34,764 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1029 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_43| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_43|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1029) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (v_ArrVal_1019 (Array Int Int))) (or (forall ((v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1019) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1024) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1030) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)))) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-10-16 05:44:34,787 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1024) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1030) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (exists ((|sll_append_sll_create_~new_head~0#1.base| Int)) (and (< |sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset|) 0))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (forall ((v_ArrVal_1029 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_43| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_43|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1029) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-10-16 05:44:34,802 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|sll_append_sll_create_~new_head~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~head~0#1.offset|) 0) (< |sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1024) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1030) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1029 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_43| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_43|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1029) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-10-16 05:44:37,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 05:44:37,012 INFO L93 Difference]: Finished difference Result 368 states and 438 transitions. [2022-10-16 05:44:37,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-16 05:44:37,013 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.317073170731707) internal successors, (95), 38 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-10-16 05:44:37,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 05:44:37,015 INFO L225 Difference]: With dead ends: 368 [2022-10-16 05:44:37,015 INFO L226 Difference]: Without dead ends: 368 [2022-10-16 05:44:37,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=255, Invalid=1143, Unknown=22, NotChecked=2002, Total=3422 [2022-10-16 05:44:37,018 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 27 mSDsluCounter, 2448 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2557 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 811 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 05:44:37,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2557 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 495 Invalid, 0 Unknown, 811 Unchecked, 0.4s Time] [2022-10-16 05:44:37,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-10-16 05:44:37,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 348. [2022-10-16 05:44:37,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 308 states have (on average 1.2922077922077921) internal successors, (398), 337 states have internal predecessors, (398), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 4 states have call predecessors, (11), 8 states have call successors, (11) [2022-10-16 05:44:37,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 417 transitions. [2022-10-16 05:44:37,030 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 417 transitions. Word has length 47 [2022-10-16 05:44:37,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 05:44:37,030 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 417 transitions. [2022-10-16 05:44:37,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.317073170731707) internal successors, (95), 38 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:44:37,031 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 417 transitions. [2022-10-16 05:44:37,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-10-16 05:44:37,032 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 05:44:37,032 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 05:44:37,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-10-16 05:44:37,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 05:44:37,246 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting sll_appendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-16 05:44:37,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 05:44:37,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1761870877, now seen corresponding path program 1 times [2022-10-16 05:44:37,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 05:44:37,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079601039] [2022-10-16 05:44:37,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:44:37,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 05:44:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:44:37,343 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-10-16 05:44:37,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 05:44:37,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079601039] [2022-10-16 05:44:37,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079601039] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 05:44:37,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 05:44:37,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 05:44:37,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674745706] [2022-10-16 05:44:37,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 05:44:37,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 05:44:37,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 05:44:37,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 05:44:37,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 05:44:37,346 INFO L87 Difference]: Start difference. First operand 348 states and 417 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:44:37,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 05:44:37,367 INFO L93 Difference]: Finished difference Result 428 states and 519 transitions. [2022-10-16 05:44:37,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 05:44:37,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-10-16 05:44:37,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 05:44:37,370 INFO L225 Difference]: With dead ends: 428 [2022-10-16 05:44:37,370 INFO L226 Difference]: Without dead ends: 428 [2022-10-16 05:44:37,370 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-10-16 05:44:37,371 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 69 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 331 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-10-16 05:44:37,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 331 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 05:44:37,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-10-16 05:44:37,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 337. [2022-10-16 05:44:37,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 297 states have (on average 1.2760942760942762) internal successors, (379), 326 states have internal predecessors, (379), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 4 states have call predecessors, (11), 8 states have call successors, (11) [2022-10-16 05:44:37,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 398 transitions. [2022-10-16 05:44:37,384 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 398 transitions. Word has length 47 [2022-10-16 05:44:37,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 05:44:37,384 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 398 transitions. [2022-10-16 05:44:37,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 05:44:37,385 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 398 transitions. [2022-10-16 05:44:37,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-10-16 05:44:37,386 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 05:44:37,386 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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-10-16 05:44:37,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-10-16 05:44:37,386 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-16 05:44:37,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 05:44:37,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1659810607, now seen corresponding path program 1 times [2022-10-16 05:44:37,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 05:44:37,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028972456] [2022-10-16 05:44:37,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:44:37,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 05:44:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:44:37,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-16 05:44:37,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:44:37,523 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-10-16 05:44:37,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 05:44:37,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028972456] [2022-10-16 05:44:37,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028972456] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 05:44:37,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 05:44:37,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 05:44:37,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460101831] [2022-10-16 05:44:37,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 05:44:37,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 05:44:37,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 05:44:37,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 05:44:37,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 05:44:37,525 INFO L87 Difference]: Start difference. First operand 337 states and 398 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 05:44:37,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 05:44:37,673 INFO L93 Difference]: Finished difference Result 393 states and 460 transitions. [2022-10-16 05:44:37,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 05:44:37,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-10-16 05:44:37,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 05:44:37,676 INFO L225 Difference]: With dead ends: 393 [2022-10-16 05:44:37,676 INFO L226 Difference]: Without dead ends: 393 [2022-10-16 05:44:37,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 05:44:37,677 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 192 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 05:44:37,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 284 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 05:44:37,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-10-16 05:44:37,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 337. [2022-10-16 05:44:37,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 297 states have (on average 1.2760942760942762) internal successors, (379), 326 states have internal predecessors, (379), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 4 states have call predecessors, (11), 8 states have call successors, (11) [2022-10-16 05:44:37,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 398 transitions. [2022-10-16 05:44:37,689 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 398 transitions. Word has length 54 [2022-10-16 05:44:37,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 05:44:37,689 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 398 transitions. [2022-10-16 05:44:37,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 05:44:37,690 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 398 transitions. [2022-10-16 05:44:37,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-16 05:44:37,691 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 05:44:37,691 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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-10-16 05:44:37,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-10-16 05:44:37,691 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-16 05:44:37,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 05:44:37,692 INFO L85 PathProgramCache]: Analyzing trace with hash -85479915, now seen corresponding path program 1 times [2022-10-16 05:44:37,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 05:44:37,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334030795] [2022-10-16 05:44:37,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:44:37,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 05:44:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:44:37,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-16 05:44:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:44:38,220 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-10-16 05:44:38,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 05:44:38,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334030795] [2022-10-16 05:44:38,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334030795] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 05:44:38,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 05:44:38,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-16 05:44:38,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082448287] [2022-10-16 05:44:38,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 05:44:38,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-16 05:44:38,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 05:44:38,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-16 05:44:38,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-10-16 05:44:38,223 INFO L87 Difference]: Start difference. First operand 337 states and 398 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 05:44:38,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 05:44:38,656 INFO L93 Difference]: Finished difference Result 547 states and 660 transitions. [2022-10-16 05:44:38,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 05:44:38,656 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-10-16 05:44:38,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 05:44:38,660 INFO L225 Difference]: With dead ends: 547 [2022-10-16 05:44:38,660 INFO L226 Difference]: Without dead ends: 547 [2022-10-16 05:44:38,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-10-16 05:44:38,661 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 303 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 05:44:38,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 534 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 05:44:38,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-10-16 05:44:38,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 350. [2022-10-16 05:44:38,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 311 states have (on average 1.2861736334405145) internal successors, (400), 338 states have internal predecessors, (400), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 5 states have call predecessors, (11), 8 states have call successors, (11) [2022-10-16 05:44:38,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 419 transitions. [2022-10-16 05:44:38,698 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 419 transitions. Word has length 55 [2022-10-16 05:44:38,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 05:44:38,699 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 419 transitions. [2022-10-16 05:44:38,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 05:44:38,699 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 419 transitions. [2022-10-16 05:44:38,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-16 05:44:38,700 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 05:44:38,700 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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-10-16 05:44:38,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-10-16 05:44:38,701 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-16 05:44:38,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 05:44:38,701 INFO L85 PathProgramCache]: Analyzing trace with hash -85479914, now seen corresponding path program 1 times [2022-10-16 05:44:38,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 05:44:38,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259642142] [2022-10-16 05:44:38,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:44:38,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 05:44:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:44:39,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-16 05:44:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:44:39,511 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-10-16 05:44:39,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 05:44:39,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259642142] [2022-10-16 05:44:39,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259642142] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 05:44:39,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 05:44:39,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-16 05:44:39,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628798776] [2022-10-16 05:44:39,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 05:44:39,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-16 05:44:39,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 05:44:39,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-16 05:44:39,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-16 05:44:39,514 INFO L87 Difference]: Start difference. First operand 350 states and 419 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 05:44:40,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 05:44:40,116 INFO L93 Difference]: Finished difference Result 556 states and 686 transitions. [2022-10-16 05:44:40,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 05:44:40,116 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-10-16 05:44:40,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 05:44:40,120 INFO L225 Difference]: With dead ends: 556 [2022-10-16 05:44:40,120 INFO L226 Difference]: Without dead ends: 556 [2022-10-16 05:44:40,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-10-16 05:44:40,121 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 251 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 05:44:40,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 715 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 05:44:40,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-10-16 05:44:40,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 386. [2022-10-16 05:44:40,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 347 states have (on average 1.3112391930835734) internal successors, (455), 374 states have internal predecessors, (455), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 5 states have call predecessors, (11), 8 states have call successors, (11) [2022-10-16 05:44:40,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 474 transitions. [2022-10-16 05:44:40,138 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 474 transitions. Word has length 55 [2022-10-16 05:44:40,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 05:44:40,138 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 474 transitions. [2022-10-16 05:44:40,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 05:44:40,139 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 474 transitions. [2022-10-16 05:44:40,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-10-16 05:44:40,139 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 05:44:40,140 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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-10-16 05:44:40,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-10-16 05:44:40,140 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-16 05:44:40,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 05:44:40,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1645084350, now seen corresponding path program 1 times [2022-10-16 05:44:40,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 05:44:40,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922698218] [2022-10-16 05:44:40,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:44:40,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 05:44:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:44:40,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-16 05:44:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:44:40,375 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-10-16 05:44:40,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 05:44:40,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922698218] [2022-10-16 05:44:40,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922698218] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 05:44:40,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 05:44:40,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-16 05:44:40,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798644484] [2022-10-16 05:44:40,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 05:44:40,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 05:44:40,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 05:44:40,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 05:44:40,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 05:44:40,378 INFO L87 Difference]: Start difference. First operand 386 states and 474 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 05:44:40,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 05:44:40,635 INFO L93 Difference]: Finished difference Result 441 states and 545 transitions. [2022-10-16 05:44:40,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 05:44:40,638 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-10-16 05:44:40,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 05:44:40,640 INFO L225 Difference]: With dead ends: 441 [2022-10-16 05:44:40,640 INFO L226 Difference]: Without dead ends: 441 [2022-10-16 05:44:40,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-10-16 05:44:40,641 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 48 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 05:44:40,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 597 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 05:44:40,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2022-10-16 05:44:40,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 421. [2022-10-16 05:44:40,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 382 states have (on average 1.3350785340314135) internal successors, (510), 409 states have internal predecessors, (510), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 5 states have call predecessors, (11), 8 states have call successors, (11) [2022-10-16 05:44:40,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 529 transitions. [2022-10-16 05:44:40,656 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 529 transitions. Word has length 56 [2022-10-16 05:44:40,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 05:44:40,656 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 529 transitions. [2022-10-16 05:44:40,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 05:44:40,656 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 529 transitions. [2022-10-16 05:44:40,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-10-16 05:44:40,657 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 05:44:40,657 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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-10-16 05:44:40,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-10-16 05:44:40,658 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-16 05:44:40,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 05:44:40,658 INFO L85 PathProgramCache]: Analyzing trace with hash -541993187, now seen corresponding path program 1 times [2022-10-16 05:44:40,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 05:44:40,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795114010] [2022-10-16 05:44:40,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:44:40,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 05:44:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:44:40,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-16 05:44:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:44:41,101 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-10-16 05:44:41,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 05:44:41,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795114010] [2022-10-16 05:44:41,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795114010] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 05:44:41,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 05:44:41,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-16 05:44:41,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392841678] [2022-10-16 05:44:41,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 05:44:41,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-16 05:44:41,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 05:44:41,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-16 05:44:41,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-10-16 05:44:41,105 INFO L87 Difference]: Start difference. First operand 421 states and 529 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 05:44:41,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 05:44:41,480 INFO L93 Difference]: Finished difference Result 560 states and 704 transitions. [2022-10-16 05:44:41,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 05:44:41,481 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-10-16 05:44:41,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 05:44:41,485 INFO L225 Difference]: With dead ends: 560 [2022-10-16 05:44:41,485 INFO L226 Difference]: Without dead ends: 560 [2022-10-16 05:44:41,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-10-16 05:44:41,486 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 179 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 05:44:41,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 763 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 05:44:41,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2022-10-16 05:44:41,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 421. [2022-10-16 05:44:41,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 382 states have (on average 1.3219895287958114) internal successors, (505), 409 states have internal predecessors, (505), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 5 states have call predecessors, (11), 8 states have call successors, (11) [2022-10-16 05:44:41,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 524 transitions. [2022-10-16 05:44:41,503 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 524 transitions. Word has length 57 [2022-10-16 05:44:41,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 05:44:41,503 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 524 transitions. [2022-10-16 05:44:41,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 05:44:41,504 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 524 transitions. [2022-10-16 05:44:41,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-10-16 05:44:41,505 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 05:44:41,505 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1] [2022-10-16 05:44:41,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-10-16 05:44:41,505 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-16 05:44:41,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 05:44:41,506 INFO L85 PathProgramCache]: Analyzing trace with hash 383583177, now seen corresponding path program 1 times [2022-10-16 05:44:41,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 05:44:41,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719145556] [2022-10-16 05:44:41,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:44:41,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 05:44:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:44:42,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-16 05:44:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:44:43,403 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 05:44:43,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 05:44:43,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719145556] [2022-10-16 05:44:43,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719145556] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 05:44:43,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 05:44:43,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-10-16 05:44:43,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957618718] [2022-10-16 05:44:43,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 05:44:43,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-10-16 05:44:43,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 05:44:43,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-10-16 05:44:43,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-10-16 05:44:43,406 INFO L87 Difference]: Start difference. First operand 421 states and 524 transitions. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 05:44:45,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 05:44:45,098 INFO L93 Difference]: Finished difference Result 703 states and 878 transitions. [2022-10-16 05:44:45,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-16 05:44:45,099 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-10-16 05:44:45,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 05:44:45,103 INFO L225 Difference]: With dead ends: 703 [2022-10-16 05:44:45,103 INFO L226 Difference]: Without dead ends: 703 [2022-10-16 05:44:45,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=222, Invalid=1418, Unknown=0, NotChecked=0, Total=1640 [2022-10-16 05:44:45,105 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 578 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-10-16 05:44:45,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 1096 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1130 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-10-16 05:44:45,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2022-10-16 05:44:45,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 458. [2022-10-16 05:44:45,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 419 states have (on average 1.331742243436754) internal successors, (558), 445 states have internal predecessors, (558), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 6 states have call predecessors, (11), 8 states have call successors, (11) [2022-10-16 05:44:45,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 577 transitions. [2022-10-16 05:44:45,125 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 577 transitions. Word has length 58 [2022-10-16 05:44:45,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 05:44:45,126 INFO L495 AbstractCegarLoop]: Abstraction has 458 states and 577 transitions. [2022-10-16 05:44:45,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 05:44:45,126 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 577 transitions. [2022-10-16 05:44:45,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-10-16 05:44:45,127 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 05:44:45,127 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1] [2022-10-16 05:44:45,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-10-16 05:44:45,128 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-16 05:44:45,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 05:44:45,128 INFO L85 PathProgramCache]: Analyzing trace with hash 383583178, now seen corresponding path program 1 times [2022-10-16 05:44:45,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 05:44:45,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17483308] [2022-10-16 05:44:45,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:44:45,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 05:44:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:44:46,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-16 05:44:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:44:47,877 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-10-16 05:44:47,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 05:44:47,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17483308] [2022-10-16 05:44:47,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17483308] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 05:44:47,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 05:44:47,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-10-16 05:44:47,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653373587] [2022-10-16 05:44:47,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 05:44:47,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-10-16 05:44:47,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 05:44:47,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-10-16 05:44:47,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-10-16 05:44:47,880 INFO L87 Difference]: Start difference. First operand 458 states and 577 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 05:44:50,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 05:44:50,147 INFO L93 Difference]: Finished difference Result 760 states and 937 transitions. [2022-10-16 05:44:50,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-10-16 05:44:50,148 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-10-16 05:44:50,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 05:44:50,152 INFO L225 Difference]: With dead ends: 760 [2022-10-16 05:44:50,152 INFO L226 Difference]: Without dead ends: 760 [2022-10-16 05:44:50,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=224, Invalid=1416, Unknown=0, NotChecked=0, Total=1640 [2022-10-16 05:44:50,154 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 643 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-10-16 05:44:50,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 980 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-10-16 05:44:50,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2022-10-16 05:44:50,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 458. [2022-10-16 05:44:50,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 419 states have (on average 1.3269689737470167) internal successors, (556), 445 states have internal predecessors, (556), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 6 states have call predecessors, (11), 8 states have call successors, (11) [2022-10-16 05:44:50,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 575 transitions. [2022-10-16 05:44:50,172 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 575 transitions. Word has length 58 [2022-10-16 05:44:50,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 05:44:50,173 INFO L495 AbstractCegarLoop]: Abstraction has 458 states and 575 transitions. [2022-10-16 05:44:50,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 05:44:50,173 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 575 transitions. [2022-10-16 05:44:50,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-10-16 05:44:50,174 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 05:44:50,174 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1] [2022-10-16 05:44:50,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-10-16 05:44:50,175 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-16 05:44:50,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 05:44:50,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1581411742, now seen corresponding path program 1 times [2022-10-16 05:44:50,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 05:44:50,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008617713] [2022-10-16 05:44:50,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:44:50,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 05:44:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:44:52,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-16 05:44:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:44:54,974 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-16 05:44:54,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 05:44:54,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008617713] [2022-10-16 05:44:54,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008617713] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 05:44:54,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243296115] [2022-10-16 05:44:54,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 05:44:54,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 05:44:54,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 05:44:54,976 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 05:44:54,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-10-16 05:44:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 05:44:55,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 116 conjunts are in the unsatisfiable core [2022-10-16 05:44:55,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 05:44:55,172 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-10-16 05:44:55,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-10-16 05:44:55,647 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-16 05:44:55,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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-10-16 05:44:55,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-10-16 05:44:56,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-10-16 05:44:56,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:56,215 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 39 treesize of output 30 [2022-10-16 05:44:56,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:56,376 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 21 treesize of output 20 [2022-10-16 05:44:56,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:44:56,399 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-10-16 05:44:56,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 44 [2022-10-16 05:44:56,930 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-10-16 05:44:56,954 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-10-16 05:44:56,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 61 [2022-10-16 05:44:57,924 INFO L356 Elim1Store]: treesize reduction 68, result has 50.7 percent of original size [2022-10-16 05:44:57,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 94 treesize of output 118 [2022-10-16 05:44:57,974 INFO L356 Elim1Store]: treesize reduction 60, result has 36.8 percent of original size [2022-10-16 05:44:57,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 48 [2022-10-16 05:44:58,676 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-10-16 05:44:58,676 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 15 treesize of output 15 [2022-10-16 05:45:01,943 INFO L356 Elim1Store]: treesize reduction 308, result has 32.6 percent of original size [2022-10-16 05:45:01,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 13 new quantified variables, introduced 45 case distinctions, treesize of input 280 treesize of output 285 [2022-10-16 05:45:02,203 INFO L356 Elim1Store]: treesize reduction 188, result has 35.8 percent of original size [2022-10-16 05:45:02,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 34 case distinctions, treesize of input 184 treesize of output 234 [2022-10-16 05:45:21,929 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-10-16 05:45:21,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 05:45:23,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 05:45:23,901 INFO L356 Elim1Store]: treesize reduction 90, result has 9.1 percent of original size [2022-10-16 05:45:23,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2811 treesize of output 2635 [2022-10-16 05:45:24,074 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 05:45:24,075 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 05:45:24,091 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 05:45:24,148 INFO L356 Elim1Store]: treesize reduction 20, result has 51.2 percent of original size [2022-10-16 05:45:24,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 832 treesize of output 834 [2022-10-16 05:45:24,284 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 05:45:24,324 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-10-16 05:45:24,325 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 1303 treesize of output 1299 [2022-10-16 05:45:54,237 WARN L233 SmtUtils]: Spent 12.62s on a formula simplification. DAG size of input: 723 DAG size of output: 498 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-10-16 05:45:54,240 INFO L356 Elim1Store]: treesize reduction 9168, result has 52.5 percent of original size [2022-10-16 05:45:54,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 21 select indices, 21 select index equivalence classes, 3 disjoint index pairs (out of 210 index pairs), introduced 27 new quantified variables, introduced 210 case distinctions, treesize of input 500559 treesize of output 447333 [2022-10-16 05:46:01,713 WARN L233 SmtUtils]: Spent 7.47s on a formula simplification. DAG size of input: 1702 DAG size of output: 1634 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)