./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:44:22,584 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:44:22,671 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 06:44:22,675 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:44:22,677 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:44:22,718 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:44:22,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:44:22,719 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:44:22,720 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:44:22,721 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:44:22,721 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:44:22,721 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:44:22,722 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:44:22,722 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:44:22,724 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:44:22,724 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:44:22,725 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:44:22,725 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:44:22,725 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:44:22,726 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:44:22,726 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:44:22,727 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:44:22,727 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:44:22,728 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:44:22,728 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:44:22,728 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:44:22,728 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:44:22,729 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:44:22,729 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:44:22,729 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:44:22,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:44:22,730 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:44:22,730 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:44:22,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:44:22,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:44:22,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:44:22,731 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:44:22,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:44:22,731 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:44:22,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:44:22,732 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:44:22,732 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:44:22,732 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 [2024-11-19 06:44:22,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:44:23,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:44:23,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:44:23,017 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:44:23,017 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:44:23,019 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2024-11-19 06:44:24,518 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:44:24,775 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:44:24,775 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2024-11-19 06:44:24,787 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcc8a022a/76013d7b68624e22b045f1c604b5fbff/FLAG9e6a6e8c2 [2024-11-19 06:44:24,803 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcc8a022a/76013d7b68624e22b045f1c604b5fbff [2024-11-19 06:44:24,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:44:24,807 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:44:24,809 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:44:24,810 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:44:24,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:44:24,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:44:24" (1/1) ... [2024-11-19 06:44:24,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@202389bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:24, skipping insertion in model container [2024-11-19 06:44:24,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:44:24" (1/1) ... [2024-11-19 06:44:24,859 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:44:25,197 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:44:25,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:44:25,232 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:44:25,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:44:25,329 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:44:25,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:25 WrapperNode [2024-11-19 06:44:25,330 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:44:25,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:44:25,332 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:44:25,333 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:44:25,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:25" (1/1) ... [2024-11-19 06:44:25,358 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:25" (1/1) ... [2024-11-19 06:44:25,385 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 120 [2024-11-19 06:44:25,386 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:44:25,387 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:44:25,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:44:25,387 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:44:25,398 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:25" (1/1) ... [2024-11-19 06:44:25,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:25" (1/1) ... [2024-11-19 06:44:25,402 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:25" (1/1) ... [2024-11-19 06:44:25,420 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 8, 11]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 8 writes are split as follows [0, 2, 6]. [2024-11-19 06:44:25,421 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:25" (1/1) ... [2024-11-19 06:44:25,421 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:25" (1/1) ... [2024-11-19 06:44:25,429 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:25" (1/1) ... [2024-11-19 06:44:25,433 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:25" (1/1) ... [2024-11-19 06:44:25,437 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:25" (1/1) ... [2024-11-19 06:44:25,439 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:25" (1/1) ... [2024-11-19 06:44:25,443 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:44:25,445 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:44:25,445 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:44:25,445 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:44:25,446 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:25" (1/1) ... [2024-11-19 06:44:25,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:44:25,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:44:25,486 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:44:25,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:44:25,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 06:44:25,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 06:44:25,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 06:44:25,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:44:25,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:44:25,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 06:44:25,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:44:25,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:44:25,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 06:44:25,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:44:25,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:44:25,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 06:44:25,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:44:25,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 06:44:25,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 06:44:25,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 06:44:25,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 06:44:25,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 06:44:25,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 06:44:25,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:44:25,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:44:25,656 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:44:25,658 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:44:26,016 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-11-19 06:44:26,016 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:44:26,034 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:44:26,035 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 06:44:26,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:44:26 BoogieIcfgContainer [2024-11-19 06:44:26,036 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:44:26,038 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:44:26,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:44:26,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:44:26,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:44:24" (1/3) ... [2024-11-19 06:44:26,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f2a63b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:44:26, skipping insertion in model container [2024-11-19 06:44:26,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:25" (2/3) ... [2024-11-19 06:44:26,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f2a63b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:44:26, skipping insertion in model container [2024-11-19 06:44:26,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:44:26" (3/3) ... [2024-11-19 06:44:26,045 INFO L112 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-2.i [2024-11-19 06:44:26,060 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:44:26,061 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2024-11-19 06:44:26,138 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:44:26,144 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@27abdfee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:44:26,144 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-11-19 06:44:26,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 56 states have (on average 2.0) internal successors, (112), 102 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:26,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 06:44:26,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:26,155 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 06:44:26,155 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:26,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:26,162 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2024-11-19 06:44:26,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:26,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891304650] [2024-11-19 06:44:26,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:26,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:26,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:26,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:26,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891304650] [2024-11-19 06:44:26,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891304650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:26,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:26,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:44:26,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875000801] [2024-11-19 06:44:26,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:26,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:44:26,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:26,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:44:26,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:44:26,528 INFO L87 Difference]: Start difference. First operand has 103 states, 56 states have (on average 2.0) internal successors, (112), 102 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:26,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:26,749 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2024-11-19 06:44:26,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:44:26,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-19 06:44:26,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:26,761 INFO L225 Difference]: With dead ends: 106 [2024-11-19 06:44:26,761 INFO L226 Difference]: Without dead ends: 104 [2024-11-19 06:44:26,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:44:26,769 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 120 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:26,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 97 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:44:26,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-19 06:44:26,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2024-11-19 06:44:26,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 97 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:26,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2024-11-19 06:44:26,814 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 4 [2024-11-19 06:44:26,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:26,815 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2024-11-19 06:44:26,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:26,815 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2024-11-19 06:44:26,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 06:44:26,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:26,817 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 06:44:26,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:44:26,817 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:26,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:26,819 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2024-11-19 06:44:26,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:26,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826764776] [2024-11-19 06:44:26,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:26,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:27,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:27,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:27,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826764776] [2024-11-19 06:44:27,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826764776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:27,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:27,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:44:27,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330873525] [2024-11-19 06:44:27,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:27,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:44:27,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:27,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:44:27,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:44:27,018 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:27,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:27,206 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2024-11-19 06:44:27,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:44:27,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-19 06:44:27,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:27,209 INFO L225 Difference]: With dead ends: 137 [2024-11-19 06:44:27,209 INFO L226 Difference]: Without dead ends: 137 [2024-11-19 06:44:27,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:44:27,211 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 117 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:27,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 101 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:44:27,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-19 06:44:27,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 107. [2024-11-19 06:44:27,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 68 states have (on average 1.7647058823529411) internal successors, (120), 106 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:27,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2024-11-19 06:44:27,220 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 4 [2024-11-19 06:44:27,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:27,221 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2024-11-19 06:44:27,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:27,221 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2024-11-19 06:44:27,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 06:44:27,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:27,222 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 06:44:27,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:44:27,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:27,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:27,223 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2024-11-19 06:44:27,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:27,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175700755] [2024-11-19 06:44:27,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:27,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:27,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:27,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:27,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175700755] [2024-11-19 06:44:27,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175700755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:27,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:27,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:44:27,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969959335] [2024-11-19 06:44:27,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:27,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:44:27,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:27,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:44:27,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:44:27,285 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:27,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:27,367 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2024-11-19 06:44:27,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:44:27,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-19 06:44:27,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:27,369 INFO L225 Difference]: With dead ends: 105 [2024-11-19 06:44:27,369 INFO L226 Difference]: Without dead ends: 105 [2024-11-19 06:44:27,370 INFO L431 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 [2024-11-19 06:44:27,371 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 31 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:27,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 114 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:44:27,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-19 06:44:27,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-19 06:44:27,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 68 states have (on average 1.7352941176470589) internal successors, (118), 104 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:27,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2024-11-19 06:44:27,384 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 5 [2024-11-19 06:44:27,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:27,385 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2024-11-19 06:44:27,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:27,387 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2024-11-19 06:44:27,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 06:44:27,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:27,388 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 06:44:27,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:44:27,389 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:27,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:27,390 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2024-11-19 06:44:27,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:27,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167175342] [2024-11-19 06:44:27,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:27,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:27,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:27,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:27,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167175342] [2024-11-19 06:44:27,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167175342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:27,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:27,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:44:27,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501970188] [2024-11-19 06:44:27,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:27,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:44:27,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:27,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:44:27,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:44:27,460 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:27,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:27,523 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2024-11-19 06:44:27,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:44:27,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-19 06:44:27,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:27,525 INFO L225 Difference]: With dead ends: 103 [2024-11-19 06:44:27,526 INFO L226 Difference]: Without dead ends: 103 [2024-11-19 06:44:27,527 INFO L431 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 [2024-11-19 06:44:27,528 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 31 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:27,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 119 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:44:27,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-19 06:44:27,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-19 06:44:27,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.7058823529411764) internal successors, (116), 102 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:27,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2024-11-19 06:44:27,542 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 5 [2024-11-19 06:44:27,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:27,542 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2024-11-19 06:44:27,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:27,542 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2024-11-19 06:44:27,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 06:44:27,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:27,543 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:27,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:44:27,543 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:27,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:27,544 INFO L85 PathProgramCache]: Analyzing trace with hash 234240077, now seen corresponding path program 1 times [2024-11-19 06:44:27,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:27,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045785176] [2024-11-19 06:44:27,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:27,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:27,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:27,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:27,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045785176] [2024-11-19 06:44:27,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045785176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:27,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:27,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:44:27,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123881662] [2024-11-19 06:44:27,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:27,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:44:27,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:27,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:44:27,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:44:27,618 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:27,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:27,687 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2024-11-19 06:44:27,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:44:27,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 06:44:27,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:27,689 INFO L225 Difference]: With dead ends: 99 [2024-11-19 06:44:27,689 INFO L226 Difference]: Without dead ends: 99 [2024-11-19 06:44:27,689 INFO L431 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 [2024-11-19 06:44:27,690 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 15 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:27,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 117 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:44:27,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-19 06:44:27,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-19 06:44:27,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 68 states have (on average 1.6470588235294117) internal successors, (112), 98 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:27,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2024-11-19 06:44:27,697 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 9 [2024-11-19 06:44:27,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:27,697 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2024-11-19 06:44:27,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:27,698 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2024-11-19 06:44:27,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 06:44:27,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:27,699 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:27,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:44:27,700 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:27,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:27,700 INFO L85 PathProgramCache]: Analyzing trace with hash 234240078, now seen corresponding path program 1 times [2024-11-19 06:44:27,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:27,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666202314] [2024-11-19 06:44:27,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:27,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:27,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:27,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:27,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666202314] [2024-11-19 06:44:27,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666202314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:27,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:27,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:44:27,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27449298] [2024-11-19 06:44:27,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:27,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:44:27,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:27,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:44:27,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:44:27,854 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:27,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:27,913 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2024-11-19 06:44:27,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:44:27,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 06:44:27,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:27,914 INFO L225 Difference]: With dead ends: 95 [2024-11-19 06:44:27,914 INFO L226 Difference]: Without dead ends: 95 [2024-11-19 06:44:27,915 INFO L431 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 [2024-11-19 06:44:27,915 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 15 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:27,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 122 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:44:27,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-19 06:44:27,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-19 06:44:27,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.588235294117647) internal successors, (108), 94 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:27,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2024-11-19 06:44:27,923 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 9 [2024-11-19 06:44:27,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:27,923 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2024-11-19 06:44:27,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:27,923 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2024-11-19 06:44:27,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 06:44:27,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:27,924 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:27,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:44:27,928 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:27,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:27,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1431747280, now seen corresponding path program 1 times [2024-11-19 06:44:27,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:27,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868933119] [2024-11-19 06:44:27,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:27,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:28,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:28,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:28,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868933119] [2024-11-19 06:44:28,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868933119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:28,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:28,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:44:28,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371319079] [2024-11-19 06:44:28,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:28,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:44:28,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:28,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:44:28,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:44:28,036 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:28,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:28,155 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2024-11-19 06:44:28,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:44:28,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-19 06:44:28,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:28,156 INFO L225 Difference]: With dead ends: 104 [2024-11-19 06:44:28,156 INFO L226 Difference]: Without dead ends: 104 [2024-11-19 06:44:28,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:44:28,158 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 6 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:28,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 225 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:44:28,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-19 06:44:28,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2024-11-19 06:44:28,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.5833333333333333) internal successors, (114), 98 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:28,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2024-11-19 06:44:28,167 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 14 [2024-11-19 06:44:28,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:28,170 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2024-11-19 06:44:28,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:28,170 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2024-11-19 06:44:28,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 06:44:28,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:28,171 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:28,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:44:28,171 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:28,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:28,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1431747281, now seen corresponding path program 1 times [2024-11-19 06:44:28,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:28,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429214912] [2024-11-19 06:44:28,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:28,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:28,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:28,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:28,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429214912] [2024-11-19 06:44:28,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429214912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:28,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:28,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:44:28,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983336589] [2024-11-19 06:44:28,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:28,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:44:28,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:28,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:44:28,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:44:28,397 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:28,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:28,513 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2024-11-19 06:44:28,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:44:28,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-19 06:44:28,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:28,515 INFO L225 Difference]: With dead ends: 99 [2024-11-19 06:44:28,515 INFO L226 Difference]: Without dead ends: 99 [2024-11-19 06:44:28,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:44:28,517 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 4 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:28,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 232 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:44:28,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-19 06:44:28,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-19 06:44:28,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.5555555555555556) internal successors, (112), 98 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:28,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2024-11-19 06:44:28,523 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 14 [2024-11-19 06:44:28,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:28,528 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2024-11-19 06:44:28,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:28,528 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2024-11-19 06:44:28,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 06:44:28,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:28,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:28,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:44:28,529 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:28,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:28,529 INFO L85 PathProgramCache]: Analyzing trace with hash -475614716, now seen corresponding path program 1 times [2024-11-19 06:44:28,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:28,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339435194] [2024-11-19 06:44:28,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:28,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:28,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:28,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:28,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339435194] [2024-11-19 06:44:28,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339435194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:28,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:28,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:44:28,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643128584] [2024-11-19 06:44:28,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:28,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:44:28,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:28,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:44:28,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:44:28,686 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:28,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:28,777 INFO L93 Difference]: Finished difference Result 160 states and 176 transitions. [2024-11-19 06:44:28,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:44:28,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-19 06:44:28,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:28,779 INFO L225 Difference]: With dead ends: 160 [2024-11-19 06:44:28,779 INFO L226 Difference]: Without dead ends: 160 [2024-11-19 06:44:28,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:44:28,780 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 89 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:28,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 301 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:44:28,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-19 06:44:28,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 99. [2024-11-19 06:44:28,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 98 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:28,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2024-11-19 06:44:28,789 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 18 [2024-11-19 06:44:28,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:28,792 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2024-11-19 06:44:28,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:28,792 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2024-11-19 06:44:28,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 06:44:28,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:28,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:28,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:44:28,793 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:28,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:28,794 INFO L85 PathProgramCache]: Analyzing trace with hash -475614743, now seen corresponding path program 1 times [2024-11-19 06:44:28,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:28,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354447847] [2024-11-19 06:44:28,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:28,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:29,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:29,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:29,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354447847] [2024-11-19 06:44:29,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354447847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:29,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:29,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:44:29,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173695323] [2024-11-19 06:44:29,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:29,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:44:29,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:29,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:44:29,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:44:29,050 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:29,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:29,211 INFO L93 Difference]: Finished difference Result 165 states and 186 transitions. [2024-11-19 06:44:29,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:44:29,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-19 06:44:29,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:29,212 INFO L225 Difference]: With dead ends: 165 [2024-11-19 06:44:29,213 INFO L226 Difference]: Without dead ends: 165 [2024-11-19 06:44:29,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:44:29,214 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 57 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:29,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 227 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:44:29,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-19 06:44:29,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 113. [2024-11-19 06:44:29,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 86 states have (on average 1.4767441860465116) internal successors, (127), 112 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:29,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2024-11-19 06:44:29,219 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 18 [2024-11-19 06:44:29,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:29,220 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2024-11-19 06:44:29,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:29,220 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2024-11-19 06:44:29,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 06:44:29,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:29,220 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:29,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:44:29,221 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:29,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:29,222 INFO L85 PathProgramCache]: Analyzing trace with hash -475614744, now seen corresponding path program 1 times [2024-11-19 06:44:29,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:29,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677174022] [2024-11-19 06:44:29,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:29,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:29,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:29,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:29,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677174022] [2024-11-19 06:44:29,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677174022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:29,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:29,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:44:29,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521998733] [2024-11-19 06:44:29,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:29,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:44:29,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:29,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:44:29,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:44:29,354 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:29,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:29,525 INFO L93 Difference]: Finished difference Result 177 states and 190 transitions. [2024-11-19 06:44:29,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:44:29,525 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-19 06:44:29,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:29,526 INFO L225 Difference]: With dead ends: 177 [2024-11-19 06:44:29,526 INFO L226 Difference]: Without dead ends: 177 [2024-11-19 06:44:29,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:44:29,527 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 98 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:29,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 208 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:44:29,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-19 06:44:29,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 113. [2024-11-19 06:44:29,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 112 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:29,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2024-11-19 06:44:29,530 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 18 [2024-11-19 06:44:29,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:29,530 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2024-11-19 06:44:29,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:29,531 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2024-11-19 06:44:29,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 06:44:29,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:29,532 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:29,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 06:44:29,532 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:29,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:29,533 INFO L85 PathProgramCache]: Analyzing trace with hash -764326860, now seen corresponding path program 1 times [2024-11-19 06:44:29,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:29,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250851281] [2024-11-19 06:44:29,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:29,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:29,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:29,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:29,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250851281] [2024-11-19 06:44:29,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250851281] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:44:29,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857102174] [2024-11-19 06:44:29,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:29,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:44:29,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:44:29,746 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) [2024-11-19 06:44:29,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 06:44:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:29,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 06:44:29,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:44:29,904 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 06:44:29,939 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 06:44:29,939 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 06:44:29,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 06:44:30,073 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:44:30,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 06:44:30,116 INFO L378 Elim1Store]: Elim1 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 31 treesize of output 13 [2024-11-19 06:44:30,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:44:30,178 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:44:30,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:44:30,273 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2024-11-19 06:44:30,277 INFO L378 Elim1Store]: Elim1 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 40 treesize of output 28 [2024-11-19 06:44:30,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 5 [2024-11-19 06:44:30,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:30,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857102174] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:44:30,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:44:30,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 15 [2024-11-19 06:44:30,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693927144] [2024-11-19 06:44:30,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:44:30,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 06:44:30,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:30,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 06:44:30,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=175, Unknown=10, NotChecked=0, Total=240 [2024-11-19 06:44:30,338 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:30,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:30,649 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2024-11-19 06:44:30,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:44:30,650 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-19 06:44:30,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:30,650 INFO L225 Difference]: With dead ends: 112 [2024-11-19 06:44:30,650 INFO L226 Difference]: Without dead ends: 112 [2024-11-19 06:44:30,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=175, Unknown=10, NotChecked=0, Total=240 [2024-11-19 06:44:30,651 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 8 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:30,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 491 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:44:30,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-19 06:44:30,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-19 06:44:30,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 86 states have (on average 1.441860465116279) internal successors, (124), 111 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:30,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2024-11-19 06:44:30,655 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 20 [2024-11-19 06:44:30,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:30,655 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2024-11-19 06:44:30,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:30,655 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2024-11-19 06:44:30,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 06:44:30,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:30,656 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:30,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 06:44:30,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-19 06:44:30,857 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:30,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:30,858 INFO L85 PathProgramCache]: Analyzing trace with hash -764326859, now seen corresponding path program 1 times [2024-11-19 06:44:30,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:30,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105972007] [2024-11-19 06:44:30,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:30,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:31,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:31,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:31,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105972007] [2024-11-19 06:44:31,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105972007] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:44:31,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419920334] [2024-11-19 06:44:31,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:31,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:44:31,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:44:31,242 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) [2024-11-19 06:44:31,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 06:44:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:31,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 06:44:31,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:44:31,341 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 06:44:31,366 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:44:31,366 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 06:44:31,372 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2024-11-19 06:44:31,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 06:44:31,405 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 06:44:31,544 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:44:31,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 06:44:31,557 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 13 [2024-11-19 06:44:31,632 INFO L378 Elim1Store]: Elim1 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 31 treesize of output 13 [2024-11-19 06:44:31,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2024-11-19 06:44:31,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:31,661 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:44:31,772 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_260 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_260) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_260) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) is different from false [2024-11-19 06:44:31,794 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_260) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_260 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_260) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))) is different from false [2024-11-19 06:44:31,812 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_260 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_260) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_260) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))))))) is different from false [2024-11-19 06:44:31,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:44:31,825 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2024-11-19 06:44:31,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:44:31,832 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-19 06:44:31,836 INFO L378 Elim1Store]: Elim1 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 62 treesize of output 50 [2024-11-19 06:44:31,840 INFO L378 Elim1Store]: Elim1 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 96 treesize of output 78 [2024-11-19 06:44:31,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 [2024-11-19 06:44:31,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2024-11-19 06:44:31,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:44:31,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2024-11-19 06:44:31,860 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:44:31,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2024-11-19 06:44:31,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-19 06:44:31,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419920334] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:44:31,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:44:31,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 23 [2024-11-19 06:44:31,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531926071] [2024-11-19 06:44:31,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:44:31,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 06:44:31,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:31,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 06:44:31,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=353, Unknown=3, NotChecked=120, Total=552 [2024-11-19 06:44:31,908 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:32,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:32,361 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2024-11-19 06:44:32,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:44:32,362 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-19 06:44:32,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:32,363 INFO L225 Difference]: With dead ends: 118 [2024-11-19 06:44:32,363 INFO L226 Difference]: Without dead ends: 118 [2024-11-19 06:44:32,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=568, Unknown=3, NotChecked=156, Total=870 [2024-11-19 06:44:32,364 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 63 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:32,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 576 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 357 Invalid, 0 Unknown, 160 Unchecked, 0.3s Time] [2024-11-19 06:44:32,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-19 06:44:32,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-19 06:44:32,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 117 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:32,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2024-11-19 06:44:32,367 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 20 [2024-11-19 06:44:32,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:32,367 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2024-11-19 06:44:32,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:32,368 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2024-11-19 06:44:32,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 06:44:32,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:32,368 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:32,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 06:44:32,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-19 06:44:32,569 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:32,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:32,570 INFO L85 PathProgramCache]: Analyzing trace with hash 58337566, now seen corresponding path program 1 times [2024-11-19 06:44:32,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:32,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729457653] [2024-11-19 06:44:32,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:32,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:32,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:32,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:32,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729457653] [2024-11-19 06:44:32,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729457653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:32,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:32,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:44:32,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406201213] [2024-11-19 06:44:32,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:32,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:44:32,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:32,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:44:32,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:44:32,700 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:32,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:32,864 INFO L93 Difference]: Finished difference Result 186 states and 199 transitions. [2024-11-19 06:44:32,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:44:32,864 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-19 06:44:32,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:32,865 INFO L225 Difference]: With dead ends: 186 [2024-11-19 06:44:32,865 INFO L226 Difference]: Without dead ends: 186 [2024-11-19 06:44:32,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:44:32,866 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 73 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:32,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 242 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:44:32,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-19 06:44:32,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 118. [2024-11-19 06:44:32,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 117 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:32,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2024-11-19 06:44:32,870 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 21 [2024-11-19 06:44:32,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:32,870 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2024-11-19 06:44:32,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:32,870 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2024-11-19 06:44:32,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 06:44:32,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:32,871 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:32,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 06:44:32,871 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:32,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:32,872 INFO L85 PathProgramCache]: Analyzing trace with hash 58337567, now seen corresponding path program 1 times [2024-11-19 06:44:32,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:32,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494802613] [2024-11-19 06:44:32,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:32,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:33,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:33,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:33,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494802613] [2024-11-19 06:44:33,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494802613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:33,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:33,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:44:33,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291230107] [2024-11-19 06:44:33,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:33,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:44:33,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:33,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:44:33,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:44:33,042 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:33,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:33,196 INFO L93 Difference]: Finished difference Result 167 states and 186 transitions. [2024-11-19 06:44:33,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:44:33,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-19 06:44:33,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:33,197 INFO L225 Difference]: With dead ends: 167 [2024-11-19 06:44:33,197 INFO L226 Difference]: Without dead ends: 167 [2024-11-19 06:44:33,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:44:33,198 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 51 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:33,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 226 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:44:33,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-19 06:44:33,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 121. [2024-11-19 06:44:33,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 95 states have (on average 1.3894736842105264) internal successors, (132), 120 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:33,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2024-11-19 06:44:33,201 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 21 [2024-11-19 06:44:33,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:33,201 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2024-11-19 06:44:33,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:33,201 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2024-11-19 06:44:33,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 06:44:33,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:33,202 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:33,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 06:44:33,202 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:33,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:33,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1527252530, now seen corresponding path program 1 times [2024-11-19 06:44:33,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:33,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143382302] [2024-11-19 06:44:33,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:33,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:33,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:33,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:33,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143382302] [2024-11-19 06:44:33,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143382302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:33,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:33,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 06:44:33,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978416806] [2024-11-19 06:44:33,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:33,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:44:33,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:33,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:44:33,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:44:33,548 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:33,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:33,759 INFO L93 Difference]: Finished difference Result 149 states and 163 transitions. [2024-11-19 06:44:33,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 06:44:33,760 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-19 06:44:33,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:33,760 INFO L225 Difference]: With dead ends: 149 [2024-11-19 06:44:33,760 INFO L226 Difference]: Without dead ends: 149 [2024-11-19 06:44:33,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:44:33,761 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 36 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:33,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 497 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:44:33,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-19 06:44:33,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 137. [2024-11-19 06:44:33,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 111 states have (on average 1.3423423423423424) internal successors, (149), 136 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:33,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2024-11-19 06:44:33,765 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 24 [2024-11-19 06:44:33,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:33,765 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2024-11-19 06:44:33,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:33,765 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2024-11-19 06:44:33,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 06:44:33,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:33,766 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:33,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 06:44:33,766 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:33,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:33,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1189100778, now seen corresponding path program 1 times [2024-11-19 06:44:33,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:33,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475204568] [2024-11-19 06:44:33,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:33,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:33,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:33,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:33,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475204568] [2024-11-19 06:44:33,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475204568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:33,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:33,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:44:33,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719602401] [2024-11-19 06:44:33,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:33,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:44:33,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:33,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:44:33,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:44:33,873 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:33,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:33,937 INFO L93 Difference]: Finished difference Result 166 states and 181 transitions. [2024-11-19 06:44:33,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:44:33,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-19 06:44:33,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:33,940 INFO L225 Difference]: With dead ends: 166 [2024-11-19 06:44:33,940 INFO L226 Difference]: Without dead ends: 166 [2024-11-19 06:44:33,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:44:33,941 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 74 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:33,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 233 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:44:33,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-19 06:44:33,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 149. [2024-11-19 06:44:33,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 123 states have (on average 1.4146341463414633) internal successors, (174), 148 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:33,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 174 transitions. [2024-11-19 06:44:33,944 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 174 transitions. Word has length 26 [2024-11-19 06:44:33,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:33,945 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 174 transitions. [2024-11-19 06:44:33,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:33,945 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 174 transitions. [2024-11-19 06:44:33,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 06:44:33,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:33,946 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:33,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 06:44:33,946 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:33,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:33,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1517665639, now seen corresponding path program 2 times [2024-11-19 06:44:33,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:33,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511772519] [2024-11-19 06:44:33,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:44:33,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:33,976 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:44:33,976 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:44:34,470 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:34,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:34,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511772519] [2024-11-19 06:44:34,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511772519] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:44:34,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469583961] [2024-11-19 06:44:34,471 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:44:34,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:44:34,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:44:34,473 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) [2024-11-19 06:44:34,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 06:44:34,581 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:44:34,581 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:44:34,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-19 06:44:34,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:44:34,588 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 06:44:34,599 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:44:34,599 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 06:44:34,604 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2024-11-19 06:44:34,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 06:44:34,618 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 06:44:34,697 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:44:34,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 06:44:34,702 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 13 [2024-11-19 06:44:34,815 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:44:34,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 06:44:34,819 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 13 [2024-11-19 06:44:34,884 INFO L378 Elim1Store]: Elim1 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 31 treesize of output 13 [2024-11-19 06:44:34,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2024-11-19 06:44:34,915 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:34,915 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:44:35,018 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_420 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_421 (Array Int Int)) (v_ArrVal_420 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_421) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) is different from false [2024-11-19 06:44:35,043 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_420 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 4))) (forall ((v_ArrVal_421 (Array Int Int)) (v_ArrVal_420 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_421) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))) is different from false [2024-11-19 06:44:35,061 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_421 (Array Int Int)) (v_ArrVal_420 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_421) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_420 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8)))))) is different from false [2024-11-19 06:44:35,088 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_418 (Array Int Int)) (v_ArrVal_419 (Array Int Int)) (v_ArrVal_420 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_418) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_419) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_418 (Array Int Int)) (v_ArrVal_419 (Array Int Int)) (v_ArrVal_421 (Array Int Int)) (v_ArrVal_420 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_419))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (<= (+ .cse0 12 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_418) .cse2 v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_421) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))))) is different from false [2024-11-19 06:44:35,111 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_418 (Array Int Int)) (v_ArrVal_419 (Array Int Int)) (v_ArrVal_420 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_418) (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_419) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_418 (Array Int Int)) (v_ArrVal_419 (Array Int Int)) (v_ArrVal_421 (Array Int Int)) (v_ArrVal_420 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_419))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (<= (+ .cse0 12 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_418) .cse3 v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_421) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))))) is different from false [2024-11-19 06:44:35,133 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_418 (Array Int Int)) (v_ArrVal_419 (Array Int Int)) (v_ArrVal_421 (Array Int Int)) (v_ArrVal_420 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_419))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_418) .cse1 v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_421) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (forall ((v_ArrVal_418 (Array Int Int)) (v_ArrVal_419 (Array Int Int)) (v_ArrVal_420 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_418) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_419) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))) is different from false [2024-11-19 06:44:35,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:44:35,142 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2024-11-19 06:44:35,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:44:35,150 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2024-11-19 06:44:35,154 INFO L378 Elim1Store]: Elim1 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 754 treesize of output 640 [2024-11-19 06:44:35,168 INFO L378 Elim1Store]: Elim1 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 415 treesize of output 385 [2024-11-19 06:44:35,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 132 treesize of output 104 [2024-11-19 06:44:35,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 104 treesize of output 96 [2024-11-19 06:44:35,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 96 treesize of output 84 [2024-11-19 06:44:35,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 69 treesize of output 65 [2024-11-19 06:44:35,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:44:35,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2024-11-19 06:44:35,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:44:35,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2024-11-19 06:44:35,222 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:44:35,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 34 treesize of output 22 [2024-11-19 06:44:35,226 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:44:35,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2024-11-19 06:44:35,275 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2024-11-19 06:44:35,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469583961] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:44:35,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:44:35,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 27 [2024-11-19 06:44:35,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553079263] [2024-11-19 06:44:35,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:44:35,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-19 06:44:35,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:35,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-19 06:44:35,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=384, Unknown=6, NotChecked=270, Total=756 [2024-11-19 06:44:35,277 INFO L87 Difference]: Start difference. First operand 149 states and 174 transitions. Second operand has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 28 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:35,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:35,836 INFO L93 Difference]: Finished difference Result 155 states and 180 transitions. [2024-11-19 06:44:35,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 06:44:35,837 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 28 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-19 06:44:35,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:35,838 INFO L225 Difference]: With dead ends: 155 [2024-11-19 06:44:35,838 INFO L226 Difference]: Without dead ends: 155 [2024-11-19 06:44:35,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=709, Unknown=6, NotChecked=366, Total=1260 [2024-11-19 06:44:35,840 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 68 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 355 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:35,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 710 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 375 Invalid, 0 Unknown, 355 Unchecked, 0.3s Time] [2024-11-19 06:44:35,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-19 06:44:35,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-19 06:44:35,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 129 states have (on average 1.3953488372093024) internal successors, (180), 154 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:35,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 180 transitions. [2024-11-19 06:44:35,843 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 180 transitions. Word has length 26 [2024-11-19 06:44:35,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:35,844 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 180 transitions. [2024-11-19 06:44:35,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 28 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:35,844 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 180 transitions. [2024-11-19 06:44:35,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 06:44:35,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:35,845 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:35,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 06:44:36,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-19 06:44:36,050 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:36,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:36,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1792581374, now seen corresponding path program 1 times [2024-11-19 06:44:36,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:36,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888519010] [2024-11-19 06:44:36,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:36,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:36,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:36,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:36,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888519010] [2024-11-19 06:44:36,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888519010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:36,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:36,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:44:36,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372984904] [2024-11-19 06:44:36,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:36,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:44:36,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:36,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:44:36,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:44:36,189 INFO L87 Difference]: Start difference. First operand 155 states and 180 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:36,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:36,304 INFO L93 Difference]: Finished difference Result 222 states and 240 transitions. [2024-11-19 06:44:36,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:44:36,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-19 06:44:36,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:36,306 INFO L225 Difference]: With dead ends: 222 [2024-11-19 06:44:36,306 INFO L226 Difference]: Without dead ends: 222 [2024-11-19 06:44:36,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:44:36,307 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 74 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:36,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 261 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:44:36,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-19 06:44:36,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 156. [2024-11-19 06:44:36,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 130 states have (on average 1.3923076923076922) internal successors, (181), 155 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:36,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 181 transitions. [2024-11-19 06:44:36,311 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 181 transitions. Word has length 27 [2024-11-19 06:44:36,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:36,312 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 181 transitions. [2024-11-19 06:44:36,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:36,312 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 181 transitions. [2024-11-19 06:44:36,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 06:44:36,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:36,313 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:36,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 06:44:36,313 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:36,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:36,313 INFO L85 PathProgramCache]: Analyzing trace with hash 264552428, now seen corresponding path program 1 times [2024-11-19 06:44:36,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:36,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13127810] [2024-11-19 06:44:36,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:36,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:36,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:36,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:36,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13127810] [2024-11-19 06:44:36,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13127810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:36,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:36,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:44:36,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795215779] [2024-11-19 06:44:36,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:36,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:44:36,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:36,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:44:36,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:44:36,423 INFO L87 Difference]: Start difference. First operand 156 states and 181 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:36,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:36,560 INFO L93 Difference]: Finished difference Result 225 states and 244 transitions. [2024-11-19 06:44:36,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:44:36,561 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-19 06:44:36,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:36,562 INFO L225 Difference]: With dead ends: 225 [2024-11-19 06:44:36,562 INFO L226 Difference]: Without dead ends: 225 [2024-11-19 06:44:36,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:44:36,562 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 83 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:36,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 218 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:44:36,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-19 06:44:36,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 159. [2024-11-19 06:44:36,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 133 states have (on average 1.3834586466165413) internal successors, (184), 158 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:36,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 184 transitions. [2024-11-19 06:44:36,566 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 184 transitions. Word has length 28 [2024-11-19 06:44:36,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:36,578 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 184 transitions. [2024-11-19 06:44:36,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:36,579 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 184 transitions. [2024-11-19 06:44:36,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 06:44:36,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:36,580 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:36,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 06:44:36,580 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:36,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:36,581 INFO L85 PathProgramCache]: Analyzing trace with hash -388809147, now seen corresponding path program 1 times [2024-11-19 06:44:36,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:36,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27366511] [2024-11-19 06:44:36,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:36,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:36,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:36,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:36,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27366511] [2024-11-19 06:44:36,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27366511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:36,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:36,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:44:36,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108105108] [2024-11-19 06:44:36,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:36,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:44:36,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:36,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:44:36,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:44:36,795 INFO L87 Difference]: Start difference. First operand 159 states and 184 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:36,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:36,938 INFO L93 Difference]: Finished difference Result 181 states and 198 transitions. [2024-11-19 06:44:36,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:44:36,938 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-19 06:44:36,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:36,939 INFO L225 Difference]: With dead ends: 181 [2024-11-19 06:44:36,939 INFO L226 Difference]: Without dead ends: 181 [2024-11-19 06:44:36,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:44:36,940 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 123 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:36,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 165 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:44:36,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-19 06:44:36,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 160. [2024-11-19 06:44:36,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 134 states have (on average 1.3880597014925373) internal successors, (186), 159 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:36,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 186 transitions. [2024-11-19 06:44:36,944 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 186 transitions. Word has length 29 [2024-11-19 06:44:36,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:36,944 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 186 transitions. [2024-11-19 06:44:36,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:36,944 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 186 transitions. [2024-11-19 06:44:36,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 06:44:36,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:36,945 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:36,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 06:44:36,945 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:36,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:36,945 INFO L85 PathProgramCache]: Analyzing trace with hash -388809146, now seen corresponding path program 1 times [2024-11-19 06:44:36,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:36,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736536698] [2024-11-19 06:44:36,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:36,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:36,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:37,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:37,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736536698] [2024-11-19 06:44:37,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736536698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:37,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:37,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:44:37,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578647203] [2024-11-19 06:44:37,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:37,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:44:37,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:37,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:44:37,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:44:37,003 INFO L87 Difference]: Start difference. First operand 160 states and 186 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:37,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:37,046 INFO L93 Difference]: Finished difference Result 155 states and 178 transitions. [2024-11-19 06:44:37,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:44:37,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-19 06:44:37,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:37,049 INFO L225 Difference]: With dead ends: 155 [2024-11-19 06:44:37,049 INFO L226 Difference]: Without dead ends: 155 [2024-11-19 06:44:37,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:44:37,050 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 111 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:37,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 55 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:44:37,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-19 06:44:37,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-19 06:44:37,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 134 states have (on average 1.328358208955224) internal successors, (178), 154 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:37,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 178 transitions. [2024-11-19 06:44:37,054 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 178 transitions. Word has length 29 [2024-11-19 06:44:37,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:37,055 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 178 transitions. [2024-11-19 06:44:37,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:37,055 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 178 transitions. [2024-11-19 06:44:37,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 06:44:37,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:37,055 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:37,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 06:44:37,056 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:37,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:37,056 INFO L85 PathProgramCache]: Analyzing trace with hash -2066056854, now seen corresponding path program 1 times [2024-11-19 06:44:37,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:37,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956677846] [2024-11-19 06:44:37,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:37,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:37,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:37,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:37,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956677846] [2024-11-19 06:44:37,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956677846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:37,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:37,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 06:44:37,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256766524] [2024-11-19 06:44:37,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:37,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 06:44:37,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:37,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 06:44:37,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:44:37,532 INFO L87 Difference]: Start difference. First operand 155 states and 178 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:37,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:37,802 INFO L93 Difference]: Finished difference Result 189 states and 216 transitions. [2024-11-19 06:44:37,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:44:37,803 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-19 06:44:37,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:37,804 INFO L225 Difference]: With dead ends: 189 [2024-11-19 06:44:37,804 INFO L226 Difference]: Without dead ends: 189 [2024-11-19 06:44:37,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:44:37,805 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 59 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:37,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 383 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:44:37,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-19 06:44:37,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 164. [2024-11-19 06:44:37,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 143 states have (on average 1.3566433566433567) internal successors, (194), 163 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:37,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 194 transitions. [2024-11-19 06:44:37,808 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 194 transitions. Word has length 29 [2024-11-19 06:44:37,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:37,808 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 194 transitions. [2024-11-19 06:44:37,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:37,809 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 194 transitions. [2024-11-19 06:44:37,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 06:44:37,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:37,809 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:37,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 06:44:37,809 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:37,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:37,810 INFO L85 PathProgramCache]: Analyzing trace with hash -2066056855, now seen corresponding path program 1 times [2024-11-19 06:44:37,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:37,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728321223] [2024-11-19 06:44:37,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:37,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:38,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:38,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:38,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728321223] [2024-11-19 06:44:38,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728321223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:38,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:38,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 06:44:38,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480986639] [2024-11-19 06:44:38,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:38,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 06:44:38,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:38,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 06:44:38,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:44:38,101 INFO L87 Difference]: Start difference. First operand 164 states and 194 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:38,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:38,458 INFO L93 Difference]: Finished difference Result 188 states and 208 transitions. [2024-11-19 06:44:38,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:44:38,459 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-19 06:44:38,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:38,459 INFO L225 Difference]: With dead ends: 188 [2024-11-19 06:44:38,460 INFO L226 Difference]: Without dead ends: 188 [2024-11-19 06:44:38,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:44:38,460 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 66 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:38,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 484 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:44:38,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-19 06:44:38,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 170. [2024-11-19 06:44:38,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 150 states have (on average 1.3333333333333333) internal successors, (200), 169 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:38,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 200 transitions. [2024-11-19 06:44:38,464 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 200 transitions. Word has length 29 [2024-11-19 06:44:38,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:38,464 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 200 transitions. [2024-11-19 06:44:38,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:38,465 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 200 transitions. [2024-11-19 06:44:38,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 06:44:38,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:38,465 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:38,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 06:44:38,466 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:38,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:38,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1276636110, now seen corresponding path program 1 times [2024-11-19 06:44:38,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:38,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510420677] [2024-11-19 06:44:38,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:38,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:39,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:39,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:39,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510420677] [2024-11-19 06:44:39,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510420677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:39,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:39,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 06:44:39,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85340354] [2024-11-19 06:44:39,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:39,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:44:39,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:39,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:44:39,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:44:39,034 INFO L87 Difference]: Start difference. First operand 170 states and 200 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:39,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:39,417 INFO L93 Difference]: Finished difference Result 194 states and 224 transitions. [2024-11-19 06:44:39,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 06:44:39,418 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-19 06:44:39,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:39,419 INFO L225 Difference]: With dead ends: 194 [2024-11-19 06:44:39,419 INFO L226 Difference]: Without dead ends: 194 [2024-11-19 06:44:39,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2024-11-19 06:44:39,420 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 92 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:39,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 491 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:44:39,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-19 06:44:39,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 170. [2024-11-19 06:44:39,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 150 states have (on average 1.3266666666666667) internal successors, (199), 169 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 199 transitions. [2024-11-19 06:44:39,423 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 199 transitions. Word has length 32 [2024-11-19 06:44:39,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:39,424 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 199 transitions. [2024-11-19 06:44:39,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:39,424 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 199 transitions. [2024-11-19 06:44:39,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 06:44:39,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:39,424 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:39,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 06:44:39,425 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:39,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:39,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1276647095, now seen corresponding path program 1 times [2024-11-19 06:44:39,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:39,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702616398] [2024-11-19 06:44:39,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:39,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:39,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:39,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:39,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702616398] [2024-11-19 06:44:39,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702616398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:39,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:39,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 06:44:39,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625181633] [2024-11-19 06:44:39,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:39,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 06:44:39,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:39,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 06:44:39,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:44:39,770 INFO L87 Difference]: Start difference. First operand 170 states and 199 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:40,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:40,079 INFO L93 Difference]: Finished difference Result 191 states and 210 transitions. [2024-11-19 06:44:40,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:44:40,080 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-19 06:44:40,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:40,080 INFO L225 Difference]: With dead ends: 191 [2024-11-19 06:44:40,081 INFO L226 Difference]: Without dead ends: 191 [2024-11-19 06:44:40,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:44:40,081 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 59 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:40,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 531 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:44:40,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-19 06:44:40,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 170. [2024-11-19 06:44:40,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 150 states have (on average 1.3133333333333332) internal successors, (197), 169 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:40,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 197 transitions. [2024-11-19 06:44:40,090 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 197 transitions. Word has length 32 [2024-11-19 06:44:40,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:40,090 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 197 transitions. [2024-11-19 06:44:40,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:40,091 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 197 transitions. [2024-11-19 06:44:40,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 06:44:40,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:40,091 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:40,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 06:44:40,091 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:40,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:40,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1383997955, now seen corresponding path program 3 times [2024-11-19 06:44:40,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:40,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937524168] [2024-11-19 06:44:40,092 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 06:44:40,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:40,129 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-19 06:44:40,129 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:44:40,694 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:40,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:40,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937524168] [2024-11-19 06:44:40,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937524168] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:44:40,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772112049] [2024-11-19 06:44:40,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 06:44:40,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:44:40,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:44:40,697 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) [2024-11-19 06:44:40,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 06:44:40,848 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-19 06:44:40,848 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:44:40,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-19 06:44:40,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:44:40,869 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 06:44:40,887 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2024-11-19 06:44:40,894 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:44:40,894 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 06:44:40,928 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 1 [2024-11-19 06:44:40,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 06:44:41,053 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:44:41,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 06:44:41,058 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 13 [2024-11-19 06:44:41,173 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:44:41,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 06:44:41,185 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 13 [2024-11-19 06:44:41,301 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:44:41,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 06:44:41,307 INFO L378 Elim1Store]: Elim1 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 43 treesize of output 24 [2024-11-19 06:44:41,415 INFO L378 Elim1Store]: Elim1 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 31 treesize of output 13 [2024-11-19 06:44:41,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 32 treesize of output 14 [2024-11-19 06:44:41,455 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:41,456 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:44:41,987 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_739 (Array Int Int)) (v_ArrVal_738 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_738))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (or (< |c_ULTIMATE.start_create_data_~counter~0#1| (div (+ (- 1) (* (- 1) .cse0)) 4)) (forall ((v_ArrVal_740 (Array Int Int))) (< (+ .cse0 (mod (+ (* .cse0 3) 3) 4)) (+ 8 (select (select (store .cse1 (select (select (store |c_#memory_$Pointer$#2.base| .cse2 v_ArrVal_739) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_740) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_739 (Array Int Int)) (v_ArrVal_738 (Array Int Int))) (let ((.cse5 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse4 (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_738))) (or (< (+ (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse5 4) 0) (forall ((v_ArrVal_740 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse2 v_ArrVal_739))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (< (+ .cse5 (select (select (store .cse4 .cse6 v_ArrVal_740) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 11) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_741) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))))))))) is different from false [2024-11-19 06:44:42,198 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_738 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_737))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse1 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_736) .cse3 v_ArrVal_738))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (< (+ (mod (+ 3 (* 3 .cse0)) 4) .cse0) (+ 8 (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_739) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) v_ArrVal_740) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (< (+ |c_ULTIMATE.start_create_data_~counter~0#1| 1) (div (+ (- 1) (* (- 1) .cse0)) 4)))))))) (forall ((v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_738 (Array Int Int)) (v_ArrVal_740 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_737))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse5 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse6 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_736) .cse10 v_ArrVal_738))) (or (let ((.cse8 (store .cse9 .cse10 v_ArrVal_739))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (< (+ .cse5 15 (select (select (store .cse6 .cse7 v_ArrVal_740) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_741) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))))) (< (+ .cse5 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) 8) 0)))))))) is different from false [2024-11-19 06:44:42,258 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (and (forall ((v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_738 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse5 v_ArrVal_737))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse1 (store (store |c_#memory_$Pointer$#2.offset| .cse5 v_ArrVal_736) .cse3 v_ArrVal_738))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (< (+ |c_ULTIMATE.start_create_data_~counter~0#1| 1) (div (+ (- 1) (* (- 1) .cse0)) 4)) (< (+ (mod (+ (* .cse0 3) 3) 4) .cse0) (+ (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_739) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) v_ArrVal_740) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) 8)))))))) (forall ((v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_738 (Array Int Int)) (v_ArrVal_740 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| .cse5 v_ArrVal_737))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse6 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse7 (store (store |c_#memory_$Pointer$#2.offset| .cse5 v_ArrVal_736) .cse11 v_ArrVal_738))) (or (< (+ .cse6 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) 8) 0) (let ((.cse9 (store .cse10 .cse11 v_ArrVal_739))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (< (+ .cse6 (select (select (store .cse7 .cse8 v_ArrVal_740) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) 15) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_741) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))))))))))))) is different from false [2024-11-19 06:44:42,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:44:42,484 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 224 treesize of output 214 [2024-11-19 06:44:42,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:44:42,492 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 204 treesize of output 134 [2024-11-19 06:44:42,505 INFO L378 Elim1Store]: Elim1 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 43717 treesize of output 38221 [2024-11-19 06:44:42,579 INFO L378 Elim1Store]: Elim1 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 2480 treesize of output 2396 [2024-11-19 06:44:42,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 164 treesize of output 132 [2024-11-19 06:44:42,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 173 treesize of output 165 [2024-11-19 06:44:42,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 128 treesize of output 116 [2024-11-19 06:44:42,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 153 treesize of output 121 [2024-11-19 06:44:42,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 121 treesize of output 113 [2024-11-19 06:44:42,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 88 treesize of output 84 [2024-11-19 06:44:42,655 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-19 06:44:42,656 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 1 [2024-11-19 06:44:42,749 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2024-11-19 06:44:42,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772112049] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:44:42,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:44:42,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 38 [2024-11-19 06:44:42,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657664104] [2024-11-19 06:44:42,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:44:42,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-19 06:44:42,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:42,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-19 06:44:42,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1024, Unknown=38, NotChecked=210, Total=1482 [2024-11-19 06:44:42,751 INFO L87 Difference]: Start difference. First operand 170 states and 197 transitions. Second operand has 39 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 39 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:43,816 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse3 (+ .cse0 .cse4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (or (and (forall ((v_ArrVal_740 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_740) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 4))) (forall ((v_ArrVal_740 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_740) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_741) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))) (< .cse3 0)) (= (select |c_#valid| |c_ULTIMATE.start_create_data_~data~0#1.base|) 1) (<= 0 .cse3) (<= (+ .cse0 .cse4 4) (select |c_#length| .cse1)))))) is different from false [2024-11-19 06:44:43,897 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse3 (+ .cse0 .cse5)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse4 (+ .cse0 |c_ULTIMATE.start_create_data_#t~mem7#1.offset|))) (and (or (and (forall ((v_ArrVal_740 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_740) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 4))) (forall ((v_ArrVal_740 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_740) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_741) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))) (< .cse3 0)) (<= (+ .cse0 |c_ULTIMATE.start_create_data_#t~mem7#1.offset| 4) (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem7#1.base|)) (<= 0 .cse4) (= (select |c_#valid| |c_ULTIMATE.start_create_data_~data~0#1.base|) 1) (<= 0 .cse3) (<= (+ .cse0 .cse5 4) (select |c_#length| .cse1)) (or (< .cse4 0) (and (forall ((v_ArrVal_740 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_740) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_740 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_740) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_741) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))))) is different from false [2024-11-19 06:44:43,926 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (let ((.cse1 (+ .cse0 |c_ULTIMATE.start_create_data_#t~mem7#1.offset|))) (and (<= (+ .cse0 |c_ULTIMATE.start_create_data_#t~mem7#1.offset| 4) (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem7#1.base|)) (<= 0 .cse1) (or (< .cse1 0) (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_740 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_740) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_740 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_740) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_741) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))))) is different from false [2024-11-19 06:44:44,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:44,067 INFO L93 Difference]: Finished difference Result 191 states and 220 transitions. [2024-11-19 06:44:44,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 06:44:44,068 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 39 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-19 06:44:44,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:44,069 INFO L225 Difference]: With dead ends: 191 [2024-11-19 06:44:44,069 INFO L226 Difference]: Without dead ends: 191 [2024-11-19 06:44:44,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=466, Invalid=1848, Unknown=62, NotChecked=594, Total=2970 [2024-11-19 06:44:44,070 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 89 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 15 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 359 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:44,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 937 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 696 Invalid, 22 Unknown, 359 Unchecked, 0.7s Time] [2024-11-19 06:44:44,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-19 06:44:44,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2024-11-19 06:44:44,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 168 states have (on average 1.2916666666666667) internal successors, (217), 187 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:44,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 217 transitions. [2024-11-19 06:44:44,078 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 217 transitions. Word has length 32 [2024-11-19 06:44:44,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:44,078 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 217 transitions. [2024-11-19 06:44:44,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 39 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:44,078 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 217 transitions. [2024-11-19 06:44:44,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 06:44:44,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:44,079 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:44,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 06:44:44,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-19 06:44:44,279 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:44,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:44,280 INFO L85 PathProgramCache]: Analyzing trace with hash 921013898, now seen corresponding path program 1 times [2024-11-19 06:44:44,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:44,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941916720] [2024-11-19 06:44:44,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:44,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:44,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:44,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:44,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941916720] [2024-11-19 06:44:44,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941916720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:44,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:44,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-19 06:44:44,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487588195] [2024-11-19 06:44:44,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:44,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 06:44:44,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:44,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 06:44:44,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-19 06:44:44,999 INFO L87 Difference]: Start difference. First operand 188 states and 217 transitions. Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:45,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:45,532 INFO L93 Difference]: Finished difference Result 203 states and 231 transitions. [2024-11-19 06:44:45,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 06:44:45,533 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-19 06:44:45,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:45,533 INFO L225 Difference]: With dead ends: 203 [2024-11-19 06:44:45,534 INFO L226 Difference]: Without dead ends: 201 [2024-11-19 06:44:45,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2024-11-19 06:44:45,535 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 64 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:45,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 862 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:44:45,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-19 06:44:45,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 183. [2024-11-19 06:44:45,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 163 states have (on average 1.2822085889570551) internal successors, (209), 182 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:45,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 209 transitions. [2024-11-19 06:44:45,539 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 209 transitions. Word has length 33 [2024-11-19 06:44:45,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:45,540 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 209 transitions. [2024-11-19 06:44:45,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:45,540 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 209 transitions. [2024-11-19 06:44:45,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 06:44:45,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:45,540 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 06:44:45,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 06:44:45,542 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:45,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:45,542 INFO L85 PathProgramCache]: Analyzing trace with hash -338052361, now seen corresponding path program 1 times [2024-11-19 06:44:45,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:45,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499039881] [2024-11-19 06:44:45,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:45,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:45,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:45,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:45,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499039881] [2024-11-19 06:44:45,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499039881] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:44:45,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879139717] [2024-11-19 06:44:45,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:45,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:44:45,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:44:45,848 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) [2024-11-19 06:44:45,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 06:44:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:45,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-19 06:44:45,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:44:46,122 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-19 06:44:46,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 15 [2024-11-19 06:44:46,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:44:46,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 97 treesize of output 69 [2024-11-19 06:44:46,578 INFO L378 Elim1Store]: Elim1 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 21 treesize of output 13 [2024-11-19 06:44:46,750 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#list~0#1.base_22| Int) (|v_ULTIMATE.start_main_#t~mem22#1.base_9| Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_22|) 0) (not (= |v_ULTIMATE.start_main_#t~mem22#1.base_9| 0)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~mem22#1.base_9| 0) |v_ULTIMATE.start_main_~#list~0#1.base_22| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_22| 1) |v_ULTIMATE.start_main_#t~mem22#1.base_9|) 0))) is different from true [2024-11-19 06:44:46,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:46,750 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:44:46,887 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2024-11-19 06:44:47,044 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_append_~node~0#1.base_13| Int) (v_ArrVal_839 Int) (|ULTIMATE.start_append_~pointerToList#1.offset| Int)) (let ((.cse0 (select (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset| |v_ULTIMATE.start_append_~node~0#1.base_13|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (= (store (store (store |c_#valid| |v_ULTIMATE.start_append_~node~0#1.base_13| v_ArrVal_839) .cse0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~node~0#1.base_13|) 0)) (= .cse0 0)))) is different from false [2024-11-19 06:44:47,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:47,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879139717] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:44:47,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:44:47,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 23 [2024-11-19 06:44:47,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157865979] [2024-11-19 06:44:47,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:44:47,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 06:44:47,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:47,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 06:44:47,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=397, Unknown=3, NotChecked=82, Total=552 [2024-11-19 06:44:47,053 INFO L87 Difference]: Start difference. First operand 183 states and 209 transitions. Second operand has 24 states, 23 states have (on average 4.130434782608695) internal successors, (95), 24 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:47,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:47,771 INFO L93 Difference]: Finished difference Result 261 states and 292 transitions. [2024-11-19 06:44:47,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:44:47,771 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.130434782608695) internal successors, (95), 24 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-19 06:44:47,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:47,772 INFO L225 Difference]: With dead ends: 261 [2024-11-19 06:44:47,772 INFO L226 Difference]: Without dead ends: 259 [2024-11-19 06:44:47,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=146, Invalid=729, Unknown=3, NotChecked=114, Total=992 [2024-11-19 06:44:47,773 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 74 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 281 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:47,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 653 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 566 Invalid, 0 Unknown, 281 Unchecked, 0.4s Time] [2024-11-19 06:44:47,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-19 06:44:47,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 213. [2024-11-19 06:44:47,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 193 states have (on average 1.2487046632124352) internal successors, (241), 212 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:47,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 241 transitions. [2024-11-19 06:44:47,779 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 241 transitions. Word has length 34 [2024-11-19 06:44:47,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:47,779 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 241 transitions. [2024-11-19 06:44:47,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.130434782608695) internal successors, (95), 24 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:47,779 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 241 transitions. [2024-11-19 06:44:47,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 06:44:47,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:47,780 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:47,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 06:44:47,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-19 06:44:47,985 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:47,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:47,986 INFO L85 PathProgramCache]: Analyzing trace with hash -338052388, now seen corresponding path program 1 times [2024-11-19 06:44:47,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:47,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187709862] [2024-11-19 06:44:47,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:47,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:48,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:48,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187709862] [2024-11-19 06:44:48,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187709862] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:44:48,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646969946] [2024-11-19 06:44:48,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:48,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:44:48,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:44:48,702 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) [2024-11-19 06:44:48,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 06:44:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:48,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-19 06:44:48,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:44:48,920 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:44:48,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 06:44:48,963 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 7 [2024-11-19 06:44:48,971 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 11 [2024-11-19 06:44:49,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:44:49,097 INFO L378 Elim1Store]: Elim1 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 27 treesize of output 15 [2024-11-19 06:44:49,163 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:44:49,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2024-11-19 06:44:49,310 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:44:49,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:44:49,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 19 [2024-11-19 06:44:49,330 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2024-11-19 06:44:49,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 19 [2024-11-19 06:44:49,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 06:44:49,494 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 7 [2024-11-19 06:44:49,527 INFO L378 Elim1Store]: Elim1 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 7 treesize of output 3 [2024-11-19 06:44:49,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:49,551 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:44:49,695 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2024-11-19 06:44:49,894 INFO L378 Elim1Store]: Elim1 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 350 treesize of output 318 [2024-11-19 06:44:49,919 INFO L378 Elim1Store]: Elim1 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 56 treesize of output 40 [2024-11-19 06:44:50,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:50,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646969946] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:44:50,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:44:50,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 33 [2024-11-19 06:44:50,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376952826] [2024-11-19 06:44:50,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:44:50,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-19 06:44:50,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:50,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-19 06:44:50,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=954, Unknown=0, NotChecked=0, Total=1056 [2024-11-19 06:44:50,077 INFO L87 Difference]: Start difference. First operand 213 states and 241 transitions. Second operand has 33 states, 33 states have (on average 2.727272727272727) internal successors, (90), 33 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:50,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:50,736 INFO L93 Difference]: Finished difference Result 276 states and 307 transitions. [2024-11-19 06:44:50,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:44:50,737 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.727272727272727) internal successors, (90), 33 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-19 06:44:50,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:50,738 INFO L225 Difference]: With dead ends: 276 [2024-11-19 06:44:50,738 INFO L226 Difference]: Without dead ends: 258 [2024-11-19 06:44:50,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=193, Invalid=1529, Unknown=0, NotChecked=0, Total=1722 [2024-11-19 06:44:50,739 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 181 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:50,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1212 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:44:50,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-19 06:44:50,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 195. [2024-11-19 06:44:50,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 175 states have (on average 1.2685714285714285) internal successors, (222), 194 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:50,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 222 transitions. [2024-11-19 06:44:50,746 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 222 transitions. Word has length 34 [2024-11-19 06:44:50,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:50,747 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 222 transitions. [2024-11-19 06:44:50,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.727272727272727) internal successors, (90), 33 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:50,747 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 222 transitions. [2024-11-19 06:44:50,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 06:44:50,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:50,747 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:50,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 06:44:50,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:44:50,953 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:50,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:50,954 INFO L85 PathProgramCache]: Analyzing trace with hash 658362991, now seen corresponding path program 1 times [2024-11-19 06:44:50,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:50,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864945038] [2024-11-19 06:44:50,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:50,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:51,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:51,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:51,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864945038] [2024-11-19 06:44:51,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864945038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:51,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:51,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 06:44:51,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702287462] [2024-11-19 06:44:51,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:51,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 06:44:51,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:51,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 06:44:51,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:44:51,316 INFO L87 Difference]: Start difference. First operand 195 states and 222 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:51,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:51,619 INFO L93 Difference]: Finished difference Result 219 states and 236 transitions. [2024-11-19 06:44:51,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:44:51,620 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-19 06:44:51,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:51,621 INFO L225 Difference]: With dead ends: 219 [2024-11-19 06:44:51,621 INFO L226 Difference]: Without dead ends: 219 [2024-11-19 06:44:51,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2024-11-19 06:44:51,621 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 147 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:51,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 326 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:44:51,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-19 06:44:51,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 197. [2024-11-19 06:44:51,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 177 states have (on average 1.265536723163842) internal successors, (224), 196 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:51,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 224 transitions. [2024-11-19 06:44:51,625 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 224 transitions. Word has length 35 [2024-11-19 06:44:51,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:51,626 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 224 transitions. [2024-11-19 06:44:51,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:51,626 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 224 transitions. [2024-11-19 06:44:51,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-19 06:44:51,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:51,626 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:51,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 06:44:51,627 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:51,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:51,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1823666657, now seen corresponding path program 1 times [2024-11-19 06:44:51,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:51,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199383480] [2024-11-19 06:44:51,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:51,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:52,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:52,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:52,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199383480] [2024-11-19 06:44:52,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199383480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:52,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:52,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 06:44:52,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648823549] [2024-11-19 06:44:52,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:52,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:44:52,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:52,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:44:52,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:44:52,044 INFO L87 Difference]: Start difference. First operand 197 states and 224 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:52,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:52,570 INFO L93 Difference]: Finished difference Result 276 states and 299 transitions. [2024-11-19 06:44:52,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 06:44:52,571 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-19 06:44:52,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:52,572 INFO L225 Difference]: With dead ends: 276 [2024-11-19 06:44:52,572 INFO L226 Difference]: Without dead ends: 276 [2024-11-19 06:44:52,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2024-11-19 06:44:52,574 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 123 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:52,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 549 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:44:52,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-19 06:44:52,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 200. [2024-11-19 06:44:52,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 180 states have (on average 1.261111111111111) internal successors, (227), 199 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:52,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 227 transitions. [2024-11-19 06:44:52,582 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 227 transitions. Word has length 38 [2024-11-19 06:44:52,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:52,582 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 227 transitions. [2024-11-19 06:44:52,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:52,582 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 227 transitions. [2024-11-19 06:44:52,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 06:44:52,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:52,583 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2024-11-19 06:44:52,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-19 06:44:52,583 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:52,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:52,584 INFO L85 PathProgramCache]: Analyzing trace with hash 155608979, now seen corresponding path program 1 times [2024-11-19 06:44:52,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:52,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636564829] [2024-11-19 06:44:52,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:52,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:52,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:52,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:52,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636564829] [2024-11-19 06:44:52,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636564829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:52,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:52,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 06:44:52,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243959965] [2024-11-19 06:44:52,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:52,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 06:44:52,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:52,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 06:44:52,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:44:52,897 INFO L87 Difference]: Start difference. First operand 200 states and 227 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:53,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:53,172 INFO L93 Difference]: Finished difference Result 225 states and 245 transitions. [2024-11-19 06:44:53,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 06:44:53,172 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-19 06:44:53,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:53,173 INFO L225 Difference]: With dead ends: 225 [2024-11-19 06:44:53,173 INFO L226 Difference]: Without dead ends: 222 [2024-11-19 06:44:53,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2024-11-19 06:44:53,174 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 87 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:53,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 525 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:44:53,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-19 06:44:53,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 200. [2024-11-19 06:44:53,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 180 states have (on average 1.25) internal successors, (225), 199 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:53,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 225 transitions. [2024-11-19 06:44:53,183 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 225 transitions. Word has length 39 [2024-11-19 06:44:53,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:53,184 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 225 transitions. [2024-11-19 06:44:53,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:53,184 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 225 transitions. [2024-11-19 06:44:53,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 06:44:53,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:53,184 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:53,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-19 06:44:53,185 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:53,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:53,185 INFO L85 PathProgramCache]: Analyzing trace with hash -699091342, now seen corresponding path program 1 times [2024-11-19 06:44:53,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:53,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399506305] [2024-11-19 06:44:53,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:53,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:53,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:53,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:53,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399506305] [2024-11-19 06:44:53,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399506305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:53,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:53,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:44:53,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693291119] [2024-11-19 06:44:53,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:53,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:44:53,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:53,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:44:53,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:44:53,355 INFO L87 Difference]: Start difference. First operand 200 states and 225 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:53,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:53,474 INFO L93 Difference]: Finished difference Result 215 states and 228 transitions. [2024-11-19 06:44:53,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:44:53,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-19 06:44:53,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:53,475 INFO L225 Difference]: With dead ends: 215 [2024-11-19 06:44:53,475 INFO L226 Difference]: Without dead ends: 215 [2024-11-19 06:44:53,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:44:53,476 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 144 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:53,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 196 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:44:53,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-19 06:44:53,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 196. [2024-11-19 06:44:53,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 176 states have (on average 1.2613636363636365) internal successors, (222), 195 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:53,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 222 transitions. [2024-11-19 06:44:53,484 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 222 transitions. Word has length 39 [2024-11-19 06:44:53,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:53,484 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 222 transitions. [2024-11-19 06:44:53,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:53,485 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 222 transitions. [2024-11-19 06:44:53,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 06:44:53,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:53,485 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:53,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-19 06:44:53,486 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:44:53,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:53,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1498240746, now seen corresponding path program 1 times [2024-11-19 06:44:53,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:53,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166564428] [2024-11-19 06:44:53,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:53,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:54,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:54,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:54,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166564428] [2024-11-19 06:44:54,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166564428] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:44:54,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625038572] [2024-11-19 06:44:54,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:54,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:44:54,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:44:54,569 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) [2024-11-19 06:44:54,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 06:44:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:54,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-19 06:44:54,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:44:55,423 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 1 [2024-11-19 06:44:55,595 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-19 06:44:55,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 15 [2024-11-19 06:44:57,178 INFO L349 Elim1Store]: treesize reduction 48, result has 56.0 percent of original size [2024-11-19 06:44:57,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 374 treesize of output 326 [2024-11-19 06:45:30,149 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse17 (select .cse7 |c_ULTIMATE.start_main_~#list~0#1.offset|))) (let ((.cse0 (not (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0))) (.cse1 (= .cse17 0))) (and (or .cse0 (not .cse1)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base|) 0) (let ((.cse29 (store |c_ULTIMATE.start_main_old_#valid#1| .cse17 1)) (.cse9 (exists ((v_prenex_1 Int)) (not (= (select .cse7 v_prenex_1) 0)))) (.cse6 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~#list~0#1.base|))) (.cse12 (= .cse17 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse2 (and (or (exists ((v_arrayElimCell_72 Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int)) (let ((.cse150 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse151 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse150 1)) (.cse152 (select .cse7 v_prenex_1))) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse150 1) v_arrayElimCell_72 0)) (= v_DerPreprocessor_3 (select .cse151 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse151 v_arrayElimCell_72) 0) (not (= .cse152 0)) (not (= 0 .cse150)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse150) (not (= .cse152 .cse150)))))) (exists ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int)) (let ((.cse155 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse153 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse155 1)) (.cse154 (select .cse7 v_prenex_1))) (and (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_72)) (= v_DerPreprocessor_3 (select .cse153 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse153 v_arrayElimCell_72) 0) (not (= .cse154 0)) (not (= 0 .cse155)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse155) (not (= .cse154 .cse155)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse155 1) v_arrayElimCell_72 (select |c_#valid| v_arrayElimCell_72)) |v_ULTIMATE.start_freeData_~data#1.base_20| 0))))))) .cse1)) (.cse14 (not .cse12)) (.cse18 (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse17) 0)) (.cse8 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int)) (let ((.cse149 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse148 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse149 1))) (and (= (select .cse148 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= v_DerPreprocessor_3 (select .cse148 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse149 1) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse149)))))) (.cse20 (and (or (exists ((v_arrayElimCell_72 Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int)) (let ((.cse144 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse145 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse144 1))) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse144 1) v_arrayElimCell_72 0)) (= v_DerPreprocessor_3 (select .cse145 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse145 v_arrayElimCell_72) 0) (not (= 0 .cse144)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse144) (not (= (select .cse7 v_prenex_1) .cse144)))))) (exists ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int)) (let ((.cse147 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse146 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse147 1))) (and (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_72)) (= v_DerPreprocessor_3 (select .cse146 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse146 v_arrayElimCell_72) 0) (not (= 0 .cse147)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse147) (not (= (select .cse7 v_prenex_1) .cse147)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse147 1) v_arrayElimCell_72 (select |c_#valid| v_arrayElimCell_72)) |v_ULTIMATE.start_freeData_~data#1.base_20| 0))))))) .cse1)) (.cse19 (exists ((v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse143 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (and (not (= .cse17 .cse143)) (not (= (select .cse7 v_prenex_1) .cse143)))))) (.cse16 (store .cse6 .cse17 1)) (.cse83 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int)) (let ((.cse142 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse141 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse142 1))) (and (= (select .cse141 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= v_DerPreprocessor_3 (select .cse141 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse142 1) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse142) (not (= (select .cse7 v_prenex_1) .cse142))))))) (.cse54 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int)) (let ((.cse140 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse139 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse140 1))) (and (= (select .cse139 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= v_DerPreprocessor_3 (select .cse139 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse140 1) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= 0 .cse140)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse140)))))) (.cse26 (exists ((v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse138 (select .cse7 v_prenex_1))) (and (not (= .cse17 .cse138)) (not (= .cse138 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))))))) (.cse10 (exists ((v_prenex_1 Int)) (not (= .cse17 (select .cse7 v_prenex_1))))) (.cse84 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_arrayElimCell_74 Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse135 (select .cse7 v_prenex_1))) (let ((.cse136 (store (store .cse6 .cse135 1) v_arrayElimCell_74 (select |c_#valid| v_arrayElimCell_74)))) (let ((.cse137 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse136 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse135 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse135) 0) (= |c_#valid| (store .cse136 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= .cse135 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse135 0)) (= (select .cse137 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= 0 (select .cse137 v_arrayElimCell_74)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_74)) (not (= .cse135 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))))))))) (.cse94 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int)) (let ((.cse133 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse132 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse133 1)) (.cse134 (select .cse7 v_prenex_1))) (and (= (select .cse132 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= v_DerPreprocessor_3 (select .cse132 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse133 1) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= .cse134 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse133) (not (= .cse134 .cse133))))))) (.cse55 (exists ((|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (not (= 0 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))))) (.cse64 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_arrayElimCell_74 Int) (v_prenex_1 Int)) (let ((.cse129 (select .cse7 v_prenex_1))) (let ((.cse130 (store (store .cse6 .cse129 1) v_arrayElimCell_74 (select |c_#valid| v_arrayElimCell_74)))) (let ((.cse131 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse130 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse129 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse129) 0) (= |c_#valid| (store .cse130 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= .cse129 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse129 0)) (= (select .cse131 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= 0 (select .cse131 v_arrayElimCell_74)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_74)))))))) (.cse71 (and (or (exists ((v_arrayElimCell_74 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int)) (let ((.cse126 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse125 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse126 1))) (and (= (select .cse125 v_arrayElimCell_74) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse126 1) v_arrayElimCell_74 0)) (= v_DerPreprocessor_3 (select .cse125 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= 0 .cse126)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse126))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_arrayElimCell_74 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int)) (let ((.cse128 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse127 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse128 1))) (and (= (select .cse127 v_arrayElimCell_74) 0) (= v_DerPreprocessor_3 (select .cse127 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse128 1) v_arrayElimCell_74 (select |c_#valid| v_arrayElimCell_74)) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_74)) (not (= 0 .cse128)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse128)))))) .cse9)) (.cse53 (exists ((v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (not (= (select .cse7 v_prenex_1) (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))))) (.cse25 (exists ((v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse124 (select .cse7 v_prenex_1)) (.cse123 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (and (not (= .cse17 .cse123)) (not (= .cse17 .cse124)) (not (= .cse124 .cse123)))))) (.cse11 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_2 Int)) (let ((.cse122 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_2) .cse17 1))) (and (= |c_#valid| (store .cse29 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= (select .cse122 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= (select .cse122 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_2))))) (.cse13 (exists ((|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (not (= .cse17 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|)))))) (or .cse2 (and (or (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (v_DerPreprocessor_21 Int)) (let ((.cse3 (select .cse7 v_prenex_1))) (let ((.cse4 (store .cse6 .cse3 1))) (let ((.cse5 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse4 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse3 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse3) 0) (not (= .cse3 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store .cse4 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= (select .cse5 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= (select .cse5 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))) (and .cse8 .cse9)) .cse1) (and .cse10 .cse11 .cse12 .cse13) (and (or (and .cse14 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_DerPreprocessor_16 Int)) (let ((.cse15 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse16 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_16) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse17 1))) (and (= (select .cse15 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= (store .cse16 |v_ULTIMATE.start_freeData_~data#1.base_20| 0) |c_#valid|) (= (select .cse15 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))) (and .cse11 .cse12)) .cse18) (and .cse11 .cse12 .cse19) .cse20 (and (or (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (v_DerPreprocessor_8 Int)) (let ((.cse21 (select .cse7 v_prenex_1))) (let ((.cse22 (store .cse6 .cse21 1))) (let ((.cse23 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse22 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_8) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse21 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse21) 0) (not (= .cse21 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store .cse22 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= (select .cse23 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= (select .cse23 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))) .cse8) .cse1) (and .cse0 (let ((.cse24 (or (exists ((v_arrayElimCell_73 Int) (v_prenex_2 Int)) (let ((.cse102 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_2) .cse17 1))) (and (= (select .cse102 v_arrayElimCell_73) 0) (= (select .cse102 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_2) (= |c_#valid| (store .cse29 v_arrayElimCell_73 0))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_arrayElimCell_73 Int) (v_prenex_2 Int)) (let ((.cse103 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_2) .cse17 1))) (and (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_73)) (= |c_#valid| (store (store .cse29 v_arrayElimCell_73 (select |c_#valid| v_arrayElimCell_73)) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= (select .cse103 v_arrayElimCell_73) 0) (= (select .cse103 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_2))))))) (let ((.cse27 (and .cse12 .cse24)) (.cse32 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_arrayElimCell_73 Int)) (let ((.cse101 (store .cse16 v_arrayElimCell_73 (select |c_#valid| v_arrayElimCell_73)))) (let ((.cse100 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse101 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse17 1))) (and (= (select .cse100 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_73)) (= |c_#valid| (store .cse101 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= (select .cse100 v_arrayElimCell_73) 0)))))) (.cse43 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_arrayElimCell_73 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int)) (let ((.cse98 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse99 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse98 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse98 1) v_arrayElimCell_73 (select |c_#valid| v_arrayElimCell_73)) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= v_DerPreprocessor_3 (select .cse99 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_73)) (= (select .cse99 v_arrayElimCell_73) 0) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse98)))))) (.cse39 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_arrayElimCell_73 Int) (v_prenex_1 Int)) (let ((.cse95 (select .cse7 v_prenex_1))) (let ((.cse97 (store (store .cse6 .cse95 1) v_arrayElimCell_73 (select |c_#valid| v_arrayElimCell_73)))) (let ((.cse96 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse97 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse95 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse95) 0) (= (select .cse96 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse96 v_arrayElimCell_73) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_73)) (not (= .cse95 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store .cse97 |v_ULTIMATE.start_freeData_~data#1.base_20| 0))))))))) (or .cse2 (and .cse10 .cse12 .cse24 .cse13) (and .cse12 .cse24 .cse25) (and .cse12 .cse26 .cse24) (and .cse10 (or .cse27 (and (or (exists ((v_arrayElimCell_73 Int) (v_DerPreprocessor_38 Int)) (let ((.cse30 (select |c_#valid| v_arrayElimCell_73))) (let ((.cse28 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_38) .cse17 1) v_arrayElimCell_73 .cse30) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse17 1))) (and (= (select .cse28 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse28 v_arrayElimCell_73) 0) (= |c_#valid| (store (store .cse29 v_arrayElimCell_73 .cse30) |c_ULTIMATE.start_main_~#list~0#1.base| 0)))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_DerPreprocessor_39 Int)) (let ((.cse31 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse16 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_39) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse17 1))) (and (= (store .cse16 |v_ULTIMATE.start_freeData_~data#1.base_20| 0) |c_#valid|) (= (select .cse31 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse31 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0)))) .cse32) .cse14)) .cse18) (and (or .cse27 (and (or (exists ((v_DerPreprocessor_35 Int) (v_arrayElimCell_73 Int)) (let ((.cse34 (select |c_#valid| v_arrayElimCell_73))) (let ((.cse33 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_35) .cse17 1) v_arrayElimCell_73 .cse34) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse17 1))) (and (= (select .cse33 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse33 v_arrayElimCell_73) 0) (= |c_#valid| (store (store .cse29 v_arrayElimCell_73 .cse34) |c_ULTIMATE.start_main_~#list~0#1.base| 0)))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_DerPreprocessor_36 Int)) (let ((.cse35 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse16 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse17 1))) (and (= (store .cse16 |v_ULTIMATE.start_freeData_~data#1.base_20| 0) |c_#valid|) (= (select .cse35 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= (select .cse35 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))) .cse32) .cse14)) .cse18) (and (or (exists ((v_arrayElimCell_73 Int) (v_prenex_1 Int) (v_DerPreprocessor_61 Int)) (let ((.cse38 (select |c_#valid| v_arrayElimCell_73)) (.cse36 (select .cse7 v_prenex_1))) (let ((.cse37 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_61) .cse36 1) v_arrayElimCell_73 .cse38) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse36 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse36) 0) (= (select .cse37 v_arrayElimCell_73) 0) (not (= .cse36 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse36 1) v_arrayElimCell_73 .cse38) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select .cse37 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))) .cse39 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (v_DerPreprocessor_62 Int)) (let ((.cse40 (select .cse7 v_prenex_1))) (let ((.cse42 (store .cse6 .cse40 1))) (let ((.cse41 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse42 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse40 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse40) 0) (not (= .cse40 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse41 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store .cse42 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= (select .cse41 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0)))))) .cse8 .cse43) .cse1) (and (or (exists ((v_arrayElimCell_73 Int) (v_prenex_1 Int) (v_DerPreprocessor_63 Int)) (let ((.cse46 (select |c_#valid| v_arrayElimCell_73)) (.cse44 (select .cse7 v_prenex_1))) (let ((.cse45 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_63) .cse44 1) v_arrayElimCell_73 .cse46) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse44 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse44) 0) (= (select .cse45 v_arrayElimCell_73) 0) (not (= .cse44 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse44 0)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse44 1) v_arrayElimCell_73 .cse46) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select .cse45 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (v_DerPreprocessor_64 Int)) (let ((.cse47 (select .cse7 v_prenex_1))) (let ((.cse49 (store .cse6 .cse47 1))) (let ((.cse48 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse49 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_64) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse47 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse47) 0) (= (select .cse48 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (not (= .cse47 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse47 0)) (= |c_#valid| (store .cse49 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= (select .cse48 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_arrayElimCell_73 Int) (v_prenex_1 Int)) (let ((.cse50 (select .cse7 v_prenex_1))) (let ((.cse52 (store (store .cse6 .cse50 1) v_arrayElimCell_73 (select |c_#valid| v_arrayElimCell_73)))) (let ((.cse51 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse52 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse50 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse50) 0) (= (select .cse51 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse51 v_arrayElimCell_73) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_73)) (not (= .cse50 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse50 0)) (= |c_#valid| (store .cse52 |v_ULTIMATE.start_freeData_~data#1.base_20| 0))))))) (and (or .cse8 .cse43) .cse9)) .cse1) (and .cse12 .cse24 .cse53) (and (or .cse54 (and .cse55 (or .cse39 (exists ((v_arrayElimCell_73 Int) (v_prenex_1 Int) (v_DerPreprocessor_54 Int)) (let ((.cse58 (select |c_#valid| v_arrayElimCell_73)) (.cse57 (select .cse7 v_prenex_1))) (let ((.cse56 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_54) .cse57 1) v_arrayElimCell_73 .cse58) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse57 1))) (and (= (select .cse56 v_arrayElimCell_73) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse57) 0) (= (select .cse56 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse57 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse57 1) v_arrayElimCell_73 .cse58) |c_ULTIMATE.start_main_~#list~0#1.base| 0)))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_DerPreprocessor_55 Int) (v_prenex_1 Int)) (let ((.cse59 (select .cse7 v_prenex_1))) (let ((.cse60 (store .cse6 .cse59 1))) (let ((.cse61 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse60 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_55) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse59 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse59) 0) (not (= .cse59 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store .cse60 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= (select .cse61 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse61 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0)))))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_arrayElimCell_73 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int)) (let ((.cse62 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse63 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse62 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse62 1) v_arrayElimCell_73 (select |c_#valid| v_arrayElimCell_73)) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= v_DerPreprocessor_3 (select .cse63 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_73)) (= (select .cse63 v_arrayElimCell_73) 0) (not (= 0 .cse62)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse62)))))) .cse1) .cse20 (and (or (and .cse55 (or .cse64 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_DerPreprocessor_48 Int) (v_prenex_1 Int)) (let ((.cse65 (select .cse7 v_prenex_1))) (let ((.cse66 (store .cse6 .cse65 1))) (let ((.cse67 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse66 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse65 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse65) 0) (not (= .cse65 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse65 0)) (= |c_#valid| (store .cse66 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= (select .cse67 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse67 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0)))))) (exists ((v_DerPreprocessor_47 Int) (v_arrayElimCell_74 Int) (v_prenex_1 Int)) (let ((.cse69 (select |c_#valid| v_arrayElimCell_74)) (.cse68 (select .cse7 v_prenex_1))) (let ((.cse70 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_47) .cse68 1) v_arrayElimCell_74 .cse69) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse68 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse68) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse68 1) v_arrayElimCell_74 .cse69) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select .cse70 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse70 v_arrayElimCell_74) 0) (not (= .cse68 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse68 0)))))))) .cse71) .cse1) (and (or (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_51 Int)) (let ((.cse72 (select .cse7 v_prenex_1))) (let ((.cse74 (store .cse6 .cse72 1))) (let ((.cse73 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse74 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_51) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse72 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse72) 0) (= (select .cse73 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse72 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse73 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= |c_#valid| (store .cse74 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= .cse72 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|)))))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_arrayElimCell_73 Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse75 (select .cse7 v_prenex_1))) (let ((.cse77 (store (store .cse6 .cse75 1) v_arrayElimCell_73 (select |c_#valid| v_arrayElimCell_73)))) (let ((.cse76 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse77 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse75 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse75) 0) (= (select .cse76 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse76 v_arrayElimCell_73) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_73)) (not (= .cse75 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store .cse77 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= .cse75 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|)))))))) (exists ((v_arrayElimCell_73 Int) (v_prenex_1 Int) (v_DerPreprocessor_50 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse80 (select |c_#valid| v_arrayElimCell_73)) (.cse78 (select .cse7 v_prenex_1))) (let ((.cse79 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_50) .cse78 1) v_arrayElimCell_73 .cse80) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse78 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse78) 0) (not (= .cse78 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse79 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse78 1) v_arrayElimCell_73 .cse80) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= .cse78 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (= (select .cse79 v_arrayElimCell_73) 0))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_arrayElimCell_73 Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int)) (let ((.cse81 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse82 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse81 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse81 1) v_arrayElimCell_73 (select |c_#valid| v_arrayElimCell_73)) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= v_DerPreprocessor_3 (select .cse82 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_73)) (= (select .cse82 v_arrayElimCell_73) 0) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse81) (not (= (select .cse7 v_prenex_1) .cse81)))))) .cse83) .cse1) (and .cse12 .cse24 .cse13) (and .cse12 .cse24 .cse19) (and (or .cse84 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_arrayElimCell_73 Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int)) (let ((.cse85 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse86 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse85 1)) (.cse87 (select .cse7 v_prenex_1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse85 1) v_arrayElimCell_73 (select |c_#valid| v_arrayElimCell_73)) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= v_DerPreprocessor_3 (select .cse86 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_73)) (= (select .cse86 v_arrayElimCell_73) 0) (not (= .cse87 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse85) (not (= .cse87 .cse85)))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_41 Int)) (let ((.cse88 (select .cse7 v_prenex_1))) (let ((.cse90 (store .cse6 .cse88 1))) (let ((.cse89 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse90 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse88 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse88) 0) (= (select .cse89 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse89 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (not (= .cse88 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse88 0)) (= |c_#valid| (store .cse90 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= .cse88 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|)))))))) (exists ((v_arrayElimCell_74 Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_40 Int)) (let ((.cse93 (select |c_#valid| v_arrayElimCell_74)) (.cse91 (select .cse7 v_prenex_1))) (let ((.cse92 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_40) .cse91 1) v_arrayElimCell_74 .cse93) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse91 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse91) 0) (= (select .cse92 v_arrayElimCell_74) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse91 1) v_arrayElimCell_74 .cse93) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select .cse92 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse91 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse91 0)) (not (= .cse91 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))))))) .cse94) .cse1))))) (and .cse1 (or .cse83 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_DerPreprocessor_33 Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse104 (select .cse7 v_prenex_1))) (let ((.cse105 (store .cse6 .cse104 1))) (let ((.cse106 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse105 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_33) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse104 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse104) 0) (not (= .cse104 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store .cse105 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= (select .cse106 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (not (= .cse104 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (= (select .cse106 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))))) (and (or (and .cse55 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_DerPreprocessor_12 Int) (v_prenex_1 Int)) (let ((.cse108 (select .cse7 v_prenex_1))) (let ((.cse109 (store .cse6 .cse108 1))) (let ((.cse107 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse109 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse108 1))) (and (= (select .cse107 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse108) 0) (= (select .cse107 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse108 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store .cse109 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)))))))) .cse54) .cse1) (and .cse11 .cse12 .cse26) (and .cse10 .cse11 .cse12) (and (or .cse84 (exists ((v_arrayElimCell_74 Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_5 Int)) (let ((.cse112 (select |c_#valid| v_arrayElimCell_74)) (.cse111 (select .cse7 v_prenex_1))) (let ((.cse110 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_5) .cse111 1) v_arrayElimCell_74 .cse112) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse111 1))) (and (= (select .cse110 v_arrayElimCell_74) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse111) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse111 1) v_arrayElimCell_74 .cse112) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= 1 (select .cse110 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse111 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse111 0)) (not (= .cse111 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse113 (select .cse7 v_prenex_1))) (let ((.cse115 (store .cse6 .cse113 1))) (let ((.cse114 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse115 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse113 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse113) 0) (= 0 (select .cse114 |v_ULTIMATE.start_freeData_~data#1.base_20|)) (not (= .cse113 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse113 0)) (= |c_#valid| (store .cse115 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= (select .cse114 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse113 (select .cse7 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|)))))))) .cse94) .cse1) (and (or (and .cse55 (or .cse64 (exists ((v_arrayElimCell_74 Int) (v_DerPreprocessor_18 Int) (v_prenex_1 Int)) (let ((.cse117 (select |c_#valid| v_arrayElimCell_74)) (.cse116 (select .cse7 v_prenex_1))) (let ((.cse118 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_18) .cse116 1) v_arrayElimCell_74 .cse117) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse116 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse116) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse116 1) v_arrayElimCell_74 .cse117) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= .cse116 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse116 0)) (= (select .cse118 v_arrayElimCell_74) 0) (= (select .cse118 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (v_DerPreprocessor_19 Int)) (let ((.cse120 (select .cse7 v_prenex_1))) (let ((.cse121 (store .cse6 .cse120 1))) (let ((.cse119 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse121 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse120 1))) (and (= (select .cse119 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse120) 0) (not (= .cse120 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse120 0)) (= (select .cse119 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store .cse121 |v_ULTIMATE.start_freeData_~data#1.base_20| 0))))))))) .cse71) .cse1) (and .cse11 .cse12 .cse53) (and .cse11 .cse12 .cse25) (and .cse11 .cse12 .cse13)))))))) is different from false