./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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/list-simple/dll2c_prepend_equal.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 e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 08:01:54,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 08:01:54,093 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 08:01:54,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 08:01:54,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 08:01:54,127 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 08:01:54,128 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 08:01:54,128 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 08:01:54,129 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 08:01:54,129 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 08:01:54,130 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 08:01:54,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 08:01:54,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 08:01:54,131 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 08:01:54,131 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 08:01:54,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 08:01:54,132 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 08:01:54,135 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 08:01:54,136 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 08:01:54,136 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 08:01:54,136 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 08:01:54,137 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 08:01:54,137 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 08:01:54,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 08:01:54,138 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 08:01:54,138 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 08:01:54,138 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 08:01:54,138 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 08:01:54,139 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 08:01:54,139 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 08:01:54,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 08:01:54,139 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 08:01:54,140 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 08:01:54,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:01:54,140 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 08:01:54,141 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 08:01:54,141 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 08:01:54,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 08:01:54,141 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 08:01:54,141 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 08:01:54,142 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 08:01:54,142 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 08:01:54,142 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 -> e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 [2024-11-09 08:01:54,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 08:01:54,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 08:01:54,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 08:01:54,470 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 08:01:54,470 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 08:01:54,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2024-11-09 08:01:55,897 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 08:01:56,187 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 08:01:56,188 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2024-11-09 08:01:56,205 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2507e581b/bc8881050ca34b6baf62407e9f847d0e/FLAGc83d1243b [2024-11-09 08:01:56,220 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2507e581b/bc8881050ca34b6baf62407e9f847d0e [2024-11-09 08:01:56,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 08:01:56,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 08:01:56,227 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 08:01:56,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 08:01:56,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 08:01:56,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:01:56" (1/1) ... [2024-11-09 08:01:56,234 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5815e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:56, skipping insertion in model container [2024-11-09 08:01:56,236 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:01:56" (1/1) ... [2024-11-09 08:01:56,286 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 08:01:56,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:01:56,652 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 08:01:56,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:01:56,746 INFO L204 MainTranslator]: Completed translation [2024-11-09 08:01:56,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:56 WrapperNode [2024-11-09 08:01:56,747 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 08:01:56,748 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 08:01:56,748 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 08:01:56,751 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 08:01:56,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:56" (1/1) ... [2024-11-09 08:01:56,777 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:56" (1/1) ... [2024-11-09 08:01:56,809 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 145 [2024-11-09 08:01:56,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 08:01:56,810 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 08:01:56,810 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 08:01:56,811 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 08:01:56,823 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:56" (1/1) ... [2024-11-09 08:01:56,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:56" (1/1) ... [2024-11-09 08:01:56,827 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:56" (1/1) ... [2024-11-09 08:01:56,852 INFO L175 MemorySlicer]: Split 29 memory accesses to 3 slices as follows [2, 18, 9]. 62 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 15 writes are split as follows [0, 13, 2]. [2024-11-09 08:01:56,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:56" (1/1) ... [2024-11-09 08:01:56,853 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:56" (1/1) ... [2024-11-09 08:01:56,861 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:56" (1/1) ... [2024-11-09 08:01:56,865 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:56" (1/1) ... [2024-11-09 08:01:56,869 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:56" (1/1) ... [2024-11-09 08:01:56,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:56" (1/1) ... [2024-11-09 08:01:56,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 08:01:56,876 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 08:01:56,876 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 08:01:56,876 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 08:01:56,877 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:56" (1/1) ... [2024-11-09 08:01:56,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:01:56,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:01:56,910 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-09 08:01:56,913 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-09 08:01:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 08:01:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 08:01:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 08:01:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 08:01:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 08:01:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 08:01:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 08:01:56,965 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 08:01:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 08:01:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 08:01:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 08:01:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 08:01:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 08:01:56,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 08:01:56,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 08:01:56,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 08:01:56,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 08:01:56,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 08:01:56,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 08:01:56,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 08:01:56,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 08:01:56,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 08:01:56,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 08:01:56,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 08:01:56,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 08:01:56,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 08:01:57,127 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 08:01:57,130 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 08:01:57,585 INFO L? ?]: Removed 146 outVars from TransFormulas that were not future-live. [2024-11-09 08:01:57,586 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 08:01:57,604 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 08:01:57,605 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 08:01:57,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:01:57 BoogieIcfgContainer [2024-11-09 08:01:57,605 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 08:01:57,607 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 08:01:57,607 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 08:01:57,610 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 08:01:57,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:01:56" (1/3) ... [2024-11-09 08:01:57,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c06deef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:01:57, skipping insertion in model container [2024-11-09 08:01:57,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:56" (2/3) ... [2024-11-09 08:01:57,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c06deef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:01:57, skipping insertion in model container [2024-11-09 08:01:57,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:01:57" (3/3) ... [2024-11-09 08:01:57,614 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_equal.i [2024-11-09 08:01:57,631 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 08:01:57,631 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2024-11-09 08:01:57,686 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 08:01:57,694 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;@7bd63383, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 08:01:57,694 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2024-11-09 08:01:57,699 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 129 states have internal predecessors, (142), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:01:57,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 08:01:57,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:01:57,708 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 08:01:57,709 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 08:01:57,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:01:57,716 INFO L85 PathProgramCache]: Analyzing trace with hash 895580210, now seen corresponding path program 1 times [2024-11-09 08:01:57,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:01:57,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19850482] [2024-11-09 08:01:57,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:01:57,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:01:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:57,997 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-09 08:01:57,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:01:57,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19850482] [2024-11-09 08:01:57,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19850482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:01:57,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:01:58,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:01:58,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645717192] [2024-11-09 08:01:58,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:01:58,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:01:58,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:01:58,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:01:58,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:01:58,046 INFO L87 Difference]: Start difference. First operand has 134 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 129 states have internal predecessors, (142), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:01:58,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:01:58,219 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2024-11-09 08:01:58,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:01:58,222 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 08:01:58,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:01:58,232 INFO L225 Difference]: With dead ends: 130 [2024-11-09 08:01:58,232 INFO L226 Difference]: Without dead ends: 127 [2024-11-09 08:01:58,235 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-09 08:01:58,240 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 3 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:01:58,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 204 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:01:58,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-09 08:01:58,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-09 08:01:58,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 66 states have (on average 1.9545454545454546) internal successors, (129), 122 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:01:58,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2024-11-09 08:01:58,287 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 6 [2024-11-09 08:01:58,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:01:58,287 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2024-11-09 08:01:58,288 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:01:58,288 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2024-11-09 08:01:58,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 08:01:58,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:01:58,288 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 08:01:58,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 08:01:58,289 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 08:01:58,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:01:58,290 INFO L85 PathProgramCache]: Analyzing trace with hash 895580211, now seen corresponding path program 1 times [2024-11-09 08:01:58,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:01:58,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459062434] [2024-11-09 08:01:58,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:01:58,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:01:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:58,467 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-09 08:01:58,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:01:58,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459062434] [2024-11-09 08:01:58,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459062434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:01:58,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:01:58,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:01:58,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983894704] [2024-11-09 08:01:58,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:01:58,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:01:58,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:01:58,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:01:58,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:01:58,472 INFO L87 Difference]: Start difference. First operand 127 states and 135 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:01:58,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:01:58,565 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2024-11-09 08:01:58,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:01:58,566 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 08:01:58,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:01:58,567 INFO L225 Difference]: With dead ends: 124 [2024-11-09 08:01:58,567 INFO L226 Difference]: Without dead ends: 124 [2024-11-09 08:01:58,568 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-09 08:01:58,569 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 3 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:01:58,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 205 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:01:58,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-09 08:01:58,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-09 08:01:58,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 66 states have (on average 1.9090909090909092) internal successors, (126), 119 states have internal predecessors, (126), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:01:58,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2024-11-09 08:01:58,590 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 6 [2024-11-09 08:01:58,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:01:58,591 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2024-11-09 08:01:58,591 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:01:58,591 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2024-11-09 08:01:58,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 08:01:58,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:01:58,592 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:01:58,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 08:01:58,592 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 08:01:58,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:01:58,593 INFO L85 PathProgramCache]: Analyzing trace with hash -2012688925, now seen corresponding path program 1 times [2024-11-09 08:01:58,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:01:58,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56161920] [2024-11-09 08:01:58,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:01:58,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:01:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:58,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:01:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:58,787 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-09 08:01:58,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:01:58,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56161920] [2024-11-09 08:01:58,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56161920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:01:58,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:01:58,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 08:01:58,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551079062] [2024-11-09 08:01:58,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:01:58,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 08:01:58,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:01:58,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 08:01:58,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 08:01:58,791 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 08:01:58,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:01:58,965 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2024-11-09 08:01:58,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 08:01:58,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-09 08:01:58,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:01:58,967 INFO L225 Difference]: With dead ends: 135 [2024-11-09 08:01:58,967 INFO L226 Difference]: Without dead ends: 135 [2024-11-09 08:01:58,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 08:01:58,969 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 10 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:01:58,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 299 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:01:58,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-09 08:01:58,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125. [2024-11-09 08:01:58,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 120 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:01:58,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2024-11-09 08:01:58,991 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 14 [2024-11-09 08:01:58,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:01:58,992 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2024-11-09 08:01:58,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 08:01:58,992 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2024-11-09 08:01:58,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 08:01:58,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:01:58,993 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:01:58,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 08:01:58,993 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 08:01:58,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:01:58,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1796020736, now seen corresponding path program 1 times [2024-11-09 08:01:58,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:01:58,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815698283] [2024-11-09 08:01:58,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:01:58,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:01:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:59,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:01:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:59,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:01:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:59,253 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:01:59,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:01:59,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815698283] [2024-11-09 08:01:59,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815698283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:01:59,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:01:59,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 08:01:59,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615357845] [2024-11-09 08:01:59,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:01:59,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:01:59,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:01:59,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:01:59,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:01:59,259 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:01:59,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:01:59,533 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2024-11-09 08:01:59,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:01:59,534 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-09 08:01:59,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:01:59,535 INFO L225 Difference]: With dead ends: 124 [2024-11-09 08:01:59,537 INFO L226 Difference]: Without dead ends: 124 [2024-11-09 08:01:59,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:01:59,538 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 7 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 08:01:59,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 418 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 08:01:59,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-09 08:01:59,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-09 08:01:59,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 67 states have (on average 1.8805970149253732) internal successors, (126), 119 states have internal predecessors, (126), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:01:59,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2024-11-09 08:01:59,552 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 24 [2024-11-09 08:01:59,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:01:59,553 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2024-11-09 08:01:59,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:01:59,553 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2024-11-09 08:01:59,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 08:01:59,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:01:59,554 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:01:59,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 08:01:59,557 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 08:01:59,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:01:59,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1796020737, now seen corresponding path program 1 times [2024-11-09 08:01:59,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:01:59,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473615116] [2024-11-09 08:01:59,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:01:59,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:01:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:59,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:01:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:59,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:01:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:59,865 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:01:59,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:01:59,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473615116] [2024-11-09 08:01:59,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473615116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:01:59,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:01:59,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 08:01:59,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642692438] [2024-11-09 08:01:59,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:01:59,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 08:01:59,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:01:59,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 08:01:59,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:01:59,870 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:00,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:00,120 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2024-11-09 08:02:00,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:02:00,121 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-09 08:02:00,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:00,122 INFO L225 Difference]: With dead ends: 123 [2024-11-09 08:02:00,123 INFO L226 Difference]: Without dead ends: 123 [2024-11-09 08:02:00,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:02:00,124 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 9 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:00,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 489 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:02:00,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-09 08:02:00,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-09 08:02:00,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 67 states have (on average 1.8656716417910448) internal successors, (125), 118 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:02:00,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2024-11-09 08:02:00,131 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 24 [2024-11-09 08:02:00,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:00,132 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2024-11-09 08:02:00,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:00,132 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2024-11-09 08:02:00,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 08:02:00,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:00,133 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:00,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 08:02:00,134 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 08:02:00,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:00,134 INFO L85 PathProgramCache]: Analyzing trace with hash -600925983, now seen corresponding path program 1 times [2024-11-09 08:02:00,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:00,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490141657] [2024-11-09 08:02:00,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:00,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:00,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:00,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:00,499 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:00,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:00,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490141657] [2024-11-09 08:02:00,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490141657] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:00,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28349046] [2024-11-09 08:02:00,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:00,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:00,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:00,505 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-09 08:02:00,506 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-09 08:02:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:00,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 08:02:00,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:00,681 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-09 08:02:00,734 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-09 08:02:00,781 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 08:02:00,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-09 08:02:00,800 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-09 08:02:00,800 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:00,998 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:02:00,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28349046] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:02:00,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:02:00,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 11 [2024-11-09 08:02:00,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006478943] [2024-11-09 08:02:00,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:01,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 08:02:01,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:01,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 08:02:01,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-11-09 08:02:01,002 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 08:02:01,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:01,422 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2024-11-09 08:02:01,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:02:01,423 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2024-11-09 08:02:01,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:01,425 INFO L225 Difference]: With dead ends: 128 [2024-11-09 08:02:01,425 INFO L226 Difference]: Without dead ends: 128 [2024-11-09 08:02:01,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=119, Unknown=1, NotChecked=22, Total=182 [2024-11-09 08:02:01,426 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:01,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 518 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 501 Invalid, 0 Unknown, 132 Unchecked, 0.4s Time] [2024-11-09 08:02:01,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-09 08:02:01,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-09 08:02:01,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 71 states have (on average 1.8450704225352113) internal successors, (131), 122 states have internal predecessors, (131), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 08:02:01,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2024-11-09 08:02:01,433 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 26 [2024-11-09 08:02:01,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:01,433 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2024-11-09 08:02:01,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 08:02:01,433 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2024-11-09 08:02:01,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 08:02:01,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:01,434 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:01,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 08:02:01,635 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,SelfDestructingSolverStorable5 [2024-11-09 08:02:01,635 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 08:02:01,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:01,636 INFO L85 PathProgramCache]: Analyzing trace with hash -600925982, now seen corresponding path program 1 times [2024-11-09 08:02:01,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:01,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549067204] [2024-11-09 08:02:01,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:01,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:01,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:01,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:02,060 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:02,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:02,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549067204] [2024-11-09 08:02:02,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549067204] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:02,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457868181] [2024-11-09 08:02:02,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:02,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:02,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:02,064 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-09 08:02:02,065 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-09 08:02:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:02,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 08:02:02,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:02,212 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-09 08:02:02,215 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-09 08:02:02,390 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-09 08:02:02,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:02,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:02:02,467 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:02:02,468 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-09 08:02:02,500 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-09 08:02:02,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:02,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457868181] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:02,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:02:02,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-09 08:02:02,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110349765] [2024-11-09 08:02:02,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:02,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 08:02:02,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:02,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 08:02:02,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=232, Unknown=1, NotChecked=30, Total=306 [2024-11-09 08:02:02,622 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 16 states, 15 states have (on average 2.8) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 08:02:03,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:03,120 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2024-11-09 08:02:03,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 08:02:03,121 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2024-11-09 08:02:03,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:03,122 INFO L225 Difference]: With dead ends: 128 [2024-11-09 08:02:03,122 INFO L226 Difference]: Without dead ends: 128 [2024-11-09 08:02:03,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=358, Unknown=1, NotChecked=38, Total=462 [2024-11-09 08:02:03,124 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:03,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 586 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 580 Invalid, 0 Unknown, 131 Unchecked, 0.4s Time] [2024-11-09 08:02:03,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-09 08:02:03,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-09 08:02:03,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 71 states have (on average 1.8309859154929577) internal successors, (130), 122 states have internal predecessors, (130), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 08:02:03,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2024-11-09 08:02:03,134 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 26 [2024-11-09 08:02:03,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:03,135 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2024-11-09 08:02:03,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 08:02:03,135 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2024-11-09 08:02:03,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 08:02:03,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:03,136 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:03,155 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-09 08:02:03,340 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,SelfDestructingSolverStorable6 [2024-11-09 08:02:03,341 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 08:02:03,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:03,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1964097865, now seen corresponding path program 1 times [2024-11-09 08:02:03,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:03,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686120500] [2024-11-09 08:02:03,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:03,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:03,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:03,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:03,495 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:03,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:03,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686120500] [2024-11-09 08:02:03,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686120500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:03,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041525676] [2024-11-09 08:02:03,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:03,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:03,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:03,498 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-09 08:02:03,499 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-09 08:02:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:03,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 08:02:03,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:03,637 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-09 08:02:03,711 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-09 08:02:03,733 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 08:02:03,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-09 08:02:03,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2024-11-09 08:02:03,762 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:03,925 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:03,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041525676] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:02:03,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:02:03,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 14 [2024-11-09 08:02:03,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031153320] [2024-11-09 08:02:03,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:03,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 08:02:03,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:03,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 08:02:03,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=131, Unknown=1, NotChecked=22, Total=182 [2024-11-09 08:02:03,927 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 08:02:04,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:04,256 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2024-11-09 08:02:04,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 08:02:04,257 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 28 [2024-11-09 08:02:04,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:04,259 INFO L225 Difference]: With dead ends: 127 [2024-11-09 08:02:04,259 INFO L226 Difference]: Without dead ends: 127 [2024-11-09 08:02:04,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=229, Unknown=1, NotChecked=30, Total=306 [2024-11-09 08:02:04,260 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 10 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:04,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 923 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 451 Invalid, 0 Unknown, 129 Unchecked, 0.3s Time] [2024-11-09 08:02:04,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-09 08:02:04,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-09 08:02:04,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 71 states have (on average 1.8028169014084507) internal successors, (128), 121 states have internal predecessors, (128), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 08:02:04,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2024-11-09 08:02:04,269 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 28 [2024-11-09 08:02:04,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:04,269 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2024-11-09 08:02:04,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 08:02:04,270 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2024-11-09 08:02:04,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 08:02:04,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:04,270 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:04,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 08:02:04,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:04,472 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 08:02:04,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:04,472 INFO L85 PathProgramCache]: Analyzing trace with hash -762272333, now seen corresponding path program 1 times [2024-11-09 08:02:04,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:04,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784236863] [2024-11-09 08:02:04,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:04,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:04,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:04,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:04,700 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:04,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:04,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784236863] [2024-11-09 08:02:04,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784236863] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:04,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496980643] [2024-11-09 08:02:04,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:04,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:04,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:04,707 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-09 08:02:04,709 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-09 08:02:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:04,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 08:02:04,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:04,858 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-09 08:02:04,862 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-09 08:02:04,999 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-09 08:02:05,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:05,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:02:05,040 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:02:05,041 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-09 08:02:05,078 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-09 08:02:05,079 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:05,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496980643] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:05,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:02:05,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-09 08:02:05,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594676551] [2024-11-09 08:02:05,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:05,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 08:02:05,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:05,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 08:02:05,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=230, Unknown=1, NotChecked=30, Total=306 [2024-11-09 08:02:05,193 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand has 16 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 08:02:05,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:05,731 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2024-11-09 08:02:05,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 08:02:05,732 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2024-11-09 08:02:05,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:05,734 INFO L225 Difference]: With dead ends: 144 [2024-11-09 08:02:05,735 INFO L226 Difference]: Without dead ends: 144 [2024-11-09 08:02:05,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=353, Unknown=1, NotChecked=38, Total=462 [2024-11-09 08:02:05,736 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 12 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:05,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 968 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 685 Invalid, 0 Unknown, 151 Unchecked, 0.4s Time] [2024-11-09 08:02:05,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-09 08:02:05,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 137. [2024-11-09 08:02:05,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 80 states have (on average 1.775) internal successors, (142), 130 states have internal predecessors, (142), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 08:02:05,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 152 transitions. [2024-11-09 08:02:05,749 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 152 transitions. Word has length 29 [2024-11-09 08:02:05,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:05,749 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 152 transitions. [2024-11-09 08:02:05,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 08:02:05,750 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 152 transitions. [2024-11-09 08:02:05,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 08:02:05,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:05,751 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:05,768 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-09 08:02:05,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:05,955 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 08:02:05,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:05,955 INFO L85 PathProgramCache]: Analyzing trace with hash 2139361427, now seen corresponding path program 1 times [2024-11-09 08:02:05,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:05,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873315738] [2024-11-09 08:02:05,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:05,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:06,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:06,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:06,133 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:02:06,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:06,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873315738] [2024-11-09 08:02:06,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873315738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:06,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:06,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 08:02:06,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014134428] [2024-11-09 08:02:06,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:06,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 08:02:06,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:06,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 08:02:06,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:02:06,136 INFO L87 Difference]: Start difference. First operand 137 states and 152 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:06,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:06,406 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2024-11-09 08:02:06,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 08:02:06,406 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-09 08:02:06,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:06,407 INFO L225 Difference]: With dead ends: 136 [2024-11-09 08:02:06,407 INFO L226 Difference]: Without dead ends: 136 [2024-11-09 08:02:06,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:02:06,408 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 7 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:06,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 468 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 08:02:06,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-09 08:02:06,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-09 08:02:06,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 80 states have (on average 1.7625) internal successors, (141), 129 states have internal predecessors, (141), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 08:02:06,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 151 transitions. [2024-11-09 08:02:06,414 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 151 transitions. Word has length 30 [2024-11-09 08:02:06,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:06,416 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 151 transitions. [2024-11-09 08:02:06,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:06,416 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 151 transitions. [2024-11-09 08:02:06,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 08:02:06,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:06,417 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:06,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 08:02:06,418 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 08:02:06,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:06,418 INFO L85 PathProgramCache]: Analyzing trace with hash 2139361428, now seen corresponding path program 1 times [2024-11-09 08:02:06,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:06,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752557853] [2024-11-09 08:02:06,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:06,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:06,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:06,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:06,662 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:06,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:06,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752557853] [2024-11-09 08:02:06,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752557853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:06,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:06,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 08:02:06,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325466356] [2024-11-09 08:02:06,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:06,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 08:02:06,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:06,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 08:02:06,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:02:06,663 INFO L87 Difference]: Start difference. First operand 136 states and 151 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:06,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:06,920 INFO L93 Difference]: Finished difference Result 135 states and 150 transitions. [2024-11-09 08:02:06,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 08:02:06,921 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-09 08:02:06,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:06,922 INFO L225 Difference]: With dead ends: 135 [2024-11-09 08:02:06,923 INFO L226 Difference]: Without dead ends: 135 [2024-11-09 08:02:06,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:02:06,923 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 6 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:06,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 493 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:02:06,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-09 08:02:06,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-09 08:02:06,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 80 states have (on average 1.75) internal successors, (140), 128 states have internal predecessors, (140), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 08:02:06,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2024-11-09 08:02:06,930 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 30 [2024-11-09 08:02:06,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:06,930 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2024-11-09 08:02:06,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 08:02:06,930 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2024-11-09 08:02:06,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 08:02:06,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:06,931 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:06,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 08:02:06,932 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 08:02:06,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:06,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2057187888, now seen corresponding path program 1 times [2024-11-09 08:02:06,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:06,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004191929] [2024-11-09 08:02:06,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:06,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:07,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:07,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:07,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 08:02:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:07,095 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 08:02:07,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:07,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004191929] [2024-11-09 08:02:07,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004191929] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:07,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88247906] [2024-11-09 08:02:07,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:07,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:07,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:07,098 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-09 08:02:07,100 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-09 08:02:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:07,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 08:02:07,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:07,294 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 08:02:07,295 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:02:07,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88247906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:07,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 08:02:07,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-09 08:02:07,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726700900] [2024-11-09 08:02:07,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:07,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 08:02:07,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:07,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 08:02:07,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:02:07,296 INFO L87 Difference]: Start difference. First operand 135 states and 150 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 08:02:07,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:07,311 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2024-11-09 08:02:07,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 08:02:07,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2024-11-09 08:02:07,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:07,313 INFO L225 Difference]: With dead ends: 117 [2024-11-09 08:02:07,313 INFO L226 Difference]: Without dead ends: 117 [2024-11-09 08:02:07,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 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-09 08:02:07,313 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:07,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 347 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:02:07,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-09 08:02:07,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-09 08:02:07,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 67 states have (on average 1.7462686567164178) internal successors, (117), 112 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:02:07,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2024-11-09 08:02:07,317 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 41 [2024-11-09 08:02:07,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:07,317 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2024-11-09 08:02:07,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 08:02:07,317 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2024-11-09 08:02:07,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 08:02:07,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:07,318 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:07,334 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-09 08:02:07,522 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,SelfDestructingSolverStorable11 [2024-11-09 08:02:07,523 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 08:02:07,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:07,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1908476144, now seen corresponding path program 1 times [2024-11-09 08:02:07,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:07,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516165979] [2024-11-09 08:02:07,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:07,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:07,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:07,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:07,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:07,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 08:02:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:07,968 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 08:02:07,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:07,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516165979] [2024-11-09 08:02:07,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516165979] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:07,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154280701] [2024-11-09 08:02:07,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:07,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:07,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:07,971 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-09 08:02:07,972 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-09 08:02:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:08,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-09 08:02:08,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:08,173 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-09 08:02:08,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 5 treesize of output 3 [2024-11-09 08:02:08,236 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:02:08,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 08:02:08,300 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 7 [2024-11-09 08:02:08,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:08,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 08:02:08,580 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-09 08:02:08,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:08,610 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2024-11-09 08:02:08,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2024-11-09 08:02:08,650 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 14 not checked. [2024-11-09 08:02:08,650 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:20,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154280701] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:20,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:02:20,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16] total 22 [2024-11-09 08:02:20,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962963141] [2024-11-09 08:02:20,953 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:20,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 08:02:20,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:20,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 08:02:20,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=588, Unknown=4, NotChecked=50, Total=756 [2024-11-09 08:02:20,955 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 19 states have internal predecessors, (61), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 08:02:21,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:21,651 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2024-11-09 08:02:21,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 08:02:21,651 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 19 states have internal predecessors, (61), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2024-11-09 08:02:21,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:21,652 INFO L225 Difference]: With dead ends: 127 [2024-11-09 08:02:21,652 INFO L226 Difference]: Without dead ends: 127 [2024-11-09 08:02:21,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=194, Invalid=928, Unknown=4, NotChecked=64, Total=1190 [2024-11-09 08:02:21,653 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 278 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:21,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 462 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 715 Invalid, 0 Unknown, 127 Unchecked, 0.5s Time] [2024-11-09 08:02:21,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-09 08:02:21,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 109. [2024-11-09 08:02:21,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 67 states have (on average 1.626865671641791) internal successors, (109), 104 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:02:21,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2024-11-09 08:02:21,659 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 43 [2024-11-09 08:02:21,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:21,659 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2024-11-09 08:02:21,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 19 states have internal predecessors, (61), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 08:02:21,659 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2024-11-09 08:02:21,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 08:02:21,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:21,664 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:21,683 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-09 08:02:21,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:21,865 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 08:02:21,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:21,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1908476143, now seen corresponding path program 1 times [2024-11-09 08:02:21,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:21,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229727139] [2024-11-09 08:02:21,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:21,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:22,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:22,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:22,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:22,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 08:02:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:22,463 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 08:02:22,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:22,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229727139] [2024-11-09 08:02:22,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229727139] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:22,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595716848] [2024-11-09 08:02:22,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:22,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:22,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:22,466 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-09 08:02:22,467 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-09 08:02:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:22,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 08:02:22,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:22,657 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-09 08:02:22,666 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-09 08:02:22,676 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 5 treesize of output 3 [2024-11-09 08:02:22,680 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 5 treesize of output 3 [2024-11-09 08:02:22,702 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-09 08:02:22,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:22,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:02:22,744 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:02:22,744 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-09 08:02:22,767 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 5 treesize of output 3 [2024-11-09 08:02:22,785 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-09 08:02:22,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:22,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:02:22,911 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 5 treesize of output 3 [2024-11-09 08:02:22,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:22,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:02:22,970 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 14 not checked. [2024-11-09 08:02:22,971 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:23,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595716848] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:23,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:02:23,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2024-11-09 08:02:23,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524853728] [2024-11-09 08:02:23,064 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:23,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 08:02:23,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:23,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 08:02:23,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=168, Unknown=2, NotChecked=54, Total=272 [2024-11-09 08:02:23,065 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 08:02:23,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:23,391 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2024-11-09 08:02:23,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 08:02:23,392 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2024-11-09 08:02:23,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:23,392 INFO L225 Difference]: With dead ends: 101 [2024-11-09 08:02:23,392 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 08:02:23,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=246, Unknown=2, NotChecked=66, Total=380 [2024-11-09 08:02:23,393 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 63 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 200 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:23,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 354 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 382 Invalid, 0 Unknown, 200 Unchecked, 0.3s Time] [2024-11-09 08:02:23,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 08:02:23,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-09 08:02:23,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 67 states have (on average 1.507462686567164) internal successors, (101), 96 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:02:23,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2024-11-09 08:02:23,397 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 43 [2024-11-09 08:02:23,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:23,397 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2024-11-09 08:02:23,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 08:02:23,397 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2024-11-09 08:02:23,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 08:02:23,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:23,398 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:23,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 08:02:23,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:23,599 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 08:02:23,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:23,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1364276453, now seen corresponding path program 1 times [2024-11-09 08:02:23,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:23,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431412143] [2024-11-09 08:02:23,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:23,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:23,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:23,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:23,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 08:02:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:23,758 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 08:02:23,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:23,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431412143] [2024-11-09 08:02:23,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431412143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:23,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:23,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 08:02:23,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389932069] [2024-11-09 08:02:23,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:23,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:02:23,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:23,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:02:23,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:02:23,760 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 08:02:23,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:23,957 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2024-11-09 08:02:23,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:02:23,958 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-11-09 08:02:23,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:23,958 INFO L225 Difference]: With dead ends: 97 [2024-11-09 08:02:23,959 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 08:02:23,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:02:23,959 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 18 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:23,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 310 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:02:23,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 08:02:23,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-09 08:02:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 67 states have (on average 1.4477611940298507) internal successors, (97), 92 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:02:23,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2024-11-09 08:02:23,962 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 46 [2024-11-09 08:02:23,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:23,962 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2024-11-09 08:02:23,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 08:02:23,963 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2024-11-09 08:02:23,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 08:02:23,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:23,963 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:23,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 08:02:23,964 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 08:02:23,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:23,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1364276454, now seen corresponding path program 1 times [2024-11-09 08:02:23,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:23,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051170552] [2024-11-09 08:02:23,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:23,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:24,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:24,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:24,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 08:02:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:24,266 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 08:02:24,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:24,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051170552] [2024-11-09 08:02:24,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051170552] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:24,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80595256] [2024-11-09 08:02:24,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:24,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:24,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:24,269 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:02:24,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 08:02:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:24,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 08:02:24,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:24,507 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-09 08:02:24,608 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 08:02:24,609 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:02:24,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80595256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:24,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 08:02:24,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-11-09 08:02:24,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053634872] [2024-11-09 08:02:24,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:24,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 08:02:24,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:24,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 08:02:24,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2024-11-09 08:02:24,611 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 08:02:24,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:24,751 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2024-11-09 08:02:24,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 08:02:24,752 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-11-09 08:02:24,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:24,753 INFO L225 Difference]: With dead ends: 93 [2024-11-09 08:02:24,753 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 08:02:24,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2024-11-09 08:02:24,754 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 17 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:24,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 294 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:24,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 08:02:24,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-09 08:02:24,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 88 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:02:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2024-11-09 08:02:24,758 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 46 [2024-11-09 08:02:24,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:24,758 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2024-11-09 08:02:24,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 08:02:24,758 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2024-11-09 08:02:24,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 08:02:24,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:24,758 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:24,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 08:02:24,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 08:02:24,959 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 08:02:24,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:24,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1364287376, now seen corresponding path program 1 times [2024-11-09 08:02:24,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:24,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733821221] [2024-11-09 08:02:24,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:24,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:25,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:25,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:25,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 08:02:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:25,368 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 08:02:25,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:25,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733821221] [2024-11-09 08:02:25,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733821221] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:25,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017285517] [2024-11-09 08:02:25,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:25,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:25,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:25,371 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:02:25,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 08:02:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:25,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 08:02:25,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:25,818 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 3 [2024-11-09 08:02:25,839 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-09 08:02:25,865 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-09 08:02:25,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2024-11-09 08:02:25,902 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 17 treesize of output 9 [2024-11-09 08:02:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 08:02:25,904 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:02:25,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017285517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:25,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 08:02:25,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2024-11-09 08:02:25,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898874910] [2024-11-09 08:02:25,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:25,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 08:02:25,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:25,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 08:02:25,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=297, Unknown=1, NotChecked=34, Total=380 [2024-11-09 08:02:25,906 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 08:02:26,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:26,081 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2024-11-09 08:02:26,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 08:02:26,081 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2024-11-09 08:02:26,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:26,082 INFO L225 Difference]: With dead ends: 92 [2024-11-09 08:02:26,082 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 08:02:26,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=365, Unknown=1, NotChecked=38, Total=462 [2024-11-09 08:02:26,083 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 8 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:26,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 364 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 241 Invalid, 0 Unknown, 155 Unchecked, 0.1s Time] [2024-11-09 08:02:26,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 08:02:26,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-09 08:02:26,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.373134328358209) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:02:26,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2024-11-09 08:02:26,086 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 46 [2024-11-09 08:02:26,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:26,087 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2024-11-09 08:02:26,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 08:02:26,087 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2024-11-09 08:02:26,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 08:02:26,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:26,088 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:26,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 08:02:26,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 08:02:26,289 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 08:02:26,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:26,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1364287377, now seen corresponding path program 1 times [2024-11-09 08:02:26,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:26,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085804658] [2024-11-09 08:02:26,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:26,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:26,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:26,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:26,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 08:02:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:26,830 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:02:26,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:26,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085804658] [2024-11-09 08:02:26,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085804658] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:26,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221776200] [2024-11-09 08:02:26,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:26,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:26,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:26,833 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:02:26,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 08:02:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:27,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-09 08:02:27,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:27,326 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 9 [2024-11-09 08:02:27,329 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 3 [2024-11-09 08:02:27,372 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (<= 0 (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) 0))) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2024-11-09 08:02:27,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:27,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-11-09 08:02:27,428 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 08:02:27,428 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 15 treesize of output 15 [2024-11-09 08:02:27,485 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 23 treesize of output 15 [2024-11-09 08:02:27,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:27,494 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 33 treesize of output 25 [2024-11-09 08:02:27,525 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2024-11-09 08:02:27,526 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:27,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221776200] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:27,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:02:27,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 25 [2024-11-09 08:02:27,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827654033] [2024-11-09 08:02:27,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:27,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 08:02:27,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:27,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 08:02:27,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=685, Unknown=1, NotChecked=52, Total=812 [2024-11-09 08:02:27,687 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 26 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 22 states have internal predecessors, (73), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 08:02:28,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:28,485 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2024-11-09 08:02:28,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 08:02:28,485 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 22 states have internal predecessors, (73), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2024-11-09 08:02:28,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:28,486 INFO L225 Difference]: With dead ends: 99 [2024-11-09 08:02:28,486 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 08:02:28,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=155, Invalid=1488, Unknown=1, NotChecked=78, Total=1722 [2024-11-09 08:02:28,487 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 55 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:28,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 1021 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 818 Invalid, 0 Unknown, 97 Unchecked, 0.5s Time] [2024-11-09 08:02:28,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 08:02:28,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-09 08:02:28,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 93 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:02:28,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2024-11-09 08:02:28,490 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 46 [2024-11-09 08:02:28,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:28,490 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2024-11-09 08:02:28,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 22 states have internal predecessors, (73), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 08:02:28,490 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2024-11-09 08:02:28,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 08:02:28,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:28,491 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:28,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 08:02:28,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 08:02:28,692 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 08:02:28,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:28,692 INFO L85 PathProgramCache]: Analyzing trace with hash 496017561, now seen corresponding path program 1 times [2024-11-09 08:02:28,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:28,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818448410] [2024-11-09 08:02:28,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:28,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:28,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:28,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:28,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 08:02:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:29,004 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 08:02:29,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:29,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818448410] [2024-11-09 08:02:29,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818448410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:29,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:29,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 08:02:29,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858146936] [2024-11-09 08:02:29,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:29,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 08:02:29,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:29,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 08:02:29,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-09 08:02:29,008 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 08:02:29,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:29,328 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2024-11-09 08:02:29,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 08:02:29,329 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2024-11-09 08:02:29,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:29,330 INFO L225 Difference]: With dead ends: 103 [2024-11-09 08:02:29,330 INFO L226 Difference]: Without dead ends: 103 [2024-11-09 08:02:29,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-09 08:02:29,330 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 45 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:29,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 463 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 08:02:29,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-09 08:02:29,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2024-11-09 08:02:29,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.32) internal successors, (99), 93 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:02:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2024-11-09 08:02:29,334 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 51 [2024-11-09 08:02:29,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:29,334 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2024-11-09 08:02:29,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 08:02:29,334 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2024-11-09 08:02:29,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 08:02:29,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:29,335 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:29,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 08:02:29,335 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 08:02:29,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:29,336 INFO L85 PathProgramCache]: Analyzing trace with hash 496017562, now seen corresponding path program 1 times [2024-11-09 08:02:29,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:29,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964309337] [2024-11-09 08:02:29,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:29,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:29,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:29,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:29,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 08:02:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:29,628 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 08:02:29,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:29,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964309337] [2024-11-09 08:02:29,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964309337] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:29,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007166460] [2024-11-09 08:02:29,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:29,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:29,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:29,631 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:02:29,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 08:02:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:29,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 08:02:29,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:30,151 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:30,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:30,154 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 16 treesize of output 11 [2024-11-09 08:02:30,176 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:30,176 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:30,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:30,224 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 17 treesize of output 17 [2024-11-09 08:02:30,418 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 08:02:30,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007166460] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:02:30,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:02:30,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 24 [2024-11-09 08:02:30,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521350605] [2024-11-09 08:02:30,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:30,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 08:02:30,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:30,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 08:02:30,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2024-11-09 08:02:30,420 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand has 24 states, 24 states have (on average 3.125) internal successors, (75), 20 states have internal predecessors, (75), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-09 08:02:34,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 08:02:38,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 08:02:42,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 08:02:46,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 08:02:50,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 08:02:54,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 08:02:58,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 08:03:02,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 08:03:06,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 08:03:06,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:06,853 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2024-11-09 08:03:06,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 08:03:06,854 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.125) internal successors, (75), 20 states have internal predecessors, (75), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 51 [2024-11-09 08:03:06,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:06,854 INFO L225 Difference]: With dead ends: 96 [2024-11-09 08:03:06,854 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 08:03:06,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2024-11-09 08:03:06,855 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 59 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 1 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.3s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:06,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1068 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 500 Invalid, 9 Unknown, 0 Unchecked, 36.3s Time] [2024-11-09 08:03:06,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 08:03:06,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-09 08:03:06,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 90 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:03:06,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2024-11-09 08:03:06,858 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 51 [2024-11-09 08:03:06,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:06,858 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2024-11-09 08:03:06,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.125) internal successors, (75), 20 states have internal predecessors, (75), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-09 08:03:06,859 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2024-11-09 08:03:06,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 08:03:06,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:06,859 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:03:06,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 08:03:07,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:03:07,060 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 08:03:07,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:07,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1046864427, now seen corresponding path program 1 times [2024-11-09 08:03:07,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:07,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378071717] [2024-11-09 08:03:07,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:07,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:07,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:03:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:07,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:03:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:07,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 08:03:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:07,203 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 08:03:07,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:07,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378071717] [2024-11-09 08:03:07,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378071717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:03:07,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:03:07,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 08:03:07,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390937633] [2024-11-09 08:03:07,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:03:07,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:03:07,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:03:07,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:03:07,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:03:07,205 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 08:03:07,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:07,373 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2024-11-09 08:03:07,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 08:03:07,373 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-11-09 08:03:07,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:07,374 INFO L225 Difference]: With dead ends: 95 [2024-11-09 08:03:07,374 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 08:03:07,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 08:03:07,375 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 2 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:07,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 354 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:03:07,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 08:03:07,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-09 08:03:07,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 89 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:03:07,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2024-11-09 08:03:07,378 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 52 [2024-11-09 08:03:07,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:07,379 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2024-11-09 08:03:07,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 08:03:07,379 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2024-11-09 08:03:07,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 08:03:07,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:07,379 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:03:07,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 08:03:07,380 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 08:03:07,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:07,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1046864426, now seen corresponding path program 1 times [2024-11-09 08:03:07,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:07,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109384657] [2024-11-09 08:03:07,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:07,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:07,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:03:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:07,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:03:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:07,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 08:03:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:07,807 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 08:03:07,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:07,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109384657] [2024-11-09 08:03:07,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109384657] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:03:07,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131665648] [2024-11-09 08:03:07,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:07,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:03:07,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:03:07,809 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:03:07,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 08:03:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:08,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 08:03:08,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:03:08,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 23 treesize of output 15 [2024-11-09 08:03:08,171 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 28 treesize of output 16 [2024-11-09 08:03:08,210 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 08:03:08,210 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:03:08,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131665648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:03:08,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 08:03:08,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2024-11-09 08:03:08,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615451382] [2024-11-09 08:03:08,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:03:08,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 08:03:08,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:03:08,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 08:03:08,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-11-09 08:03:08,212 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 08:03:08,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:08,312 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2024-11-09 08:03:08,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:03:08,313 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-11-09 08:03:08,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:08,314 INFO L225 Difference]: With dead ends: 94 [2024-11-09 08:03:08,314 INFO L226 Difference]: Without dead ends: 94 [2024-11-09 08:03:08,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2024-11-09 08:03:08,315 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 2 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:08,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 326 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:03:08,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-09 08:03:08,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-09 08:03:08,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 88 states have internal predecessors, (93), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:03:08,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2024-11-09 08:03:08,318 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 52 [2024-11-09 08:03:08,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:08,319 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2024-11-09 08:03:08,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 08:03:08,319 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2024-11-09 08:03:08,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 08:03:08,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:08,320 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:03:08,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-09 08:03:08,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-09 08:03:08,521 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 08:03:08,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:08,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1906941181, now seen corresponding path program 1 times [2024-11-09 08:03:08,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:08,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354728461] [2024-11-09 08:03:08,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:08,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:09,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:03:09,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:09,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:03:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:09,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 08:03:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:09,619 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:03:09,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:09,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354728461] [2024-11-09 08:03:09,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354728461] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:03:09,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559115209] [2024-11-09 08:03:09,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:09,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:03:09,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:03:09,622 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:03:09,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 08:03:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:09,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-11-09 08:03:09,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:03:10,062 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-09 08:03:10,081 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 13 treesize of output 5 [2024-11-09 08:03:10,087 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 08:03:10,087 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 15 treesize of output 7 [2024-11-09 08:03:10,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:03:10,319 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 22 treesize of output 17 [2024-11-09 08:03:10,342 INFO L349 Elim1Store]: treesize reduction 96, result has 30.9 percent of original size [2024-11-09 08:03:10,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 52 [2024-11-09 08:03:10,485 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 08:03:10,485 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 15 treesize of output 7 [2024-11-09 08:03:10,528 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 37 treesize of output 13 [2024-11-09 08:03:10,600 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 25 treesize of output 13 [2024-11-09 08:03:10,761 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:03:10,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:03:11,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559115209] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:03:11,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:03:11,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 37 [2024-11-09 08:03:11,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075754658] [2024-11-09 08:03:11,083 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:03:11,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-09 08:03:11,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:03:11,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 08:03:11,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1750, Unknown=0, NotChecked=0, Total=1892 [2024-11-09 08:03:11,085 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 38 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 33 states have internal predecessors, (82), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 08:03:12,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:12,231 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2024-11-09 08:03:12,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 08:03:12,232 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 33 states have internal predecessors, (82), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 53 [2024-11-09 08:03:12,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:12,233 INFO L225 Difference]: With dead ends: 93 [2024-11-09 08:03:12,233 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 08:03:12,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=247, Invalid=2833, Unknown=0, NotChecked=0, Total=3080 [2024-11-09 08:03:12,234 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 22 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:12,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1043 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 08:03:12,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 08:03:12,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-09 08:03:12,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:03:12,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2024-11-09 08:03:12,238 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 53 [2024-11-09 08:03:12,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:12,238 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2024-11-09 08:03:12,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 33 states have internal predecessors, (82), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 08:03:12,239 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2024-11-09 08:03:12,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 08:03:12,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:12,239 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:03:12,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-09 08:03:12,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-09 08:03:12,444 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 08:03:12,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:12,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1906941182, now seen corresponding path program 1 times [2024-11-09 08:03:12,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:12,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993200362] [2024-11-09 08:03:12,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:12,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:13,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:03:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:13,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:03:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:13,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 08:03:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:14,036 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 08:03:14,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:14,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993200362] [2024-11-09 08:03:14,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993200362] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:03:14,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98659135] [2024-11-09 08:03:14,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:14,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:03:14,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:03:14,038 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:03:14,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 08:03:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:14,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-11-09 08:03:14,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:03:14,344 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-09 08:03:14,350 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-09 08:03:14,622 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:03:14,623 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-09 08:03:14,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 08:03:14,805 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-09 08:03:14,809 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-09 08:03:14,987 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 61 treesize of output 19 [2024-11-09 08:03:14,991 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 17 treesize of output 3 [2024-11-09 08:03:14,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 08:03:15,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-09 08:03:15,164 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 08:03:15,165 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 26 treesize of output 29 [2024-11-09 08:03:15,170 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 3 [2024-11-09 08:03:15,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:03:15,178 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 69 treesize of output 52 [2024-11-09 08:03:15,199 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-09 08:03:15,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-11-09 08:03:15,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2024-11-09 08:03:15,324 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 66 treesize of output 50 [2024-11-09 08:03:15,392 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 47 treesize of output 17 [2024-11-09 08:03:15,393 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 13 treesize of output 3 [2024-11-09 08:03:15,482 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 16 treesize of output 8 [2024-11-09 08:03:15,570 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:03:15,570 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:03:16,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98659135] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:03:16,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:03:16,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 46 [2024-11-09 08:03:16,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001103025] [2024-11-09 08:03:16,009 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:03:16,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-09 08:03:16,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:03:16,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-09 08:03:16,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2503, Unknown=0, NotChecked=0, Total=2652 [2024-11-09 08:03:16,011 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand has 47 states, 44 states have (on average 1.9545454545454546) internal successors, (86), 39 states have internal predecessors, (86), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 08:03:17,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:17,539 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2024-11-09 08:03:17,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 08:03:17,540 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 44 states have (on average 1.9545454545454546) internal successors, (86), 39 states have internal predecessors, (86), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 53 [2024-11-09 08:03:17,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:17,540 INFO L225 Difference]: With dead ends: 92 [2024-11-09 08:03:17,540 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 08:03:17,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=273, Invalid=4419, Unknown=0, NotChecked=0, Total=4692 [2024-11-09 08:03:17,542 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 21 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 1598 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:17,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1387 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1598 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 08:03:17,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 08:03:17,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-09 08:03:17,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 86 states have internal predecessors, (91), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:03:17,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2024-11-09 08:03:17,545 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 53 [2024-11-09 08:03:17,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:17,545 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2024-11-09 08:03:17,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 44 states have (on average 1.9545454545454546) internal successors, (86), 39 states have internal predecessors, (86), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 08:03:17,546 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2024-11-09 08:03:17,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 08:03:17,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:17,546 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:03:17,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-09 08:03:17,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:03:17,747 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 08:03:17,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:17,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1070699738, now seen corresponding path program 1 times [2024-11-09 08:03:17,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:17,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141925095] [2024-11-09 08:03:17,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:17,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:18,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:03:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:18,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:03:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:18,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 08:03:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:18,252 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 08:03:18,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:18,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141925095] [2024-11-09 08:03:18,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141925095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:03:18,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:03:18,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 08:03:18,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734453731] [2024-11-09 08:03:18,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:03:18,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 08:03:18,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:03:18,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 08:03:18,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-09 08:03:18,254 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 11 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 08:03:18,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:18,475 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2024-11-09 08:03:18,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 08:03:18,475 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-11-09 08:03:18,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:18,476 INFO L225 Difference]: With dead ends: 98 [2024-11-09 08:03:18,476 INFO L226 Difference]: Without dead ends: 98 [2024-11-09 08:03:18,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-09 08:03:18,477 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 31 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:18,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 442 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:03:18,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-09 08:03:18,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2024-11-09 08:03:18,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 88 states have internal predecessors, (93), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 08:03:18,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2024-11-09 08:03:18,480 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 59 [2024-11-09 08:03:18,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:18,480 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2024-11-09 08:03:18,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 08:03:18,480 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2024-11-09 08:03:18,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 08:03:18,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:18,481 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:03:18,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 08:03:18,481 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-09 08:03:18,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:18,481 INFO L85 PathProgramCache]: Analyzing trace with hash -550718775, now seen corresponding path program 1 times [2024-11-09 08:03:18,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:18,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844350221] [2024-11-09 08:03:18,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:18,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:20,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:03:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:20,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:03:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:20,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 08:03:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:21,034 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:03:21,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:21,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844350221] [2024-11-09 08:03:21,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844350221] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:03:21,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067444324] [2024-11-09 08:03:21,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:21,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:03:21,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:03:21,038 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:03:21,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-09 08:03:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:21,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 115 conjuncts are in the unsatisfiable core [2024-11-09 08:03:21,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:03:21,416 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