./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db322df1d89bf1549765f136e3e3b8000484c0c3108c31998992cf725d6dcc20 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:58:04,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:58:04,419 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 17:58:04,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:58:04,425 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:58:04,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:58:04,447 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:58:04,447 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:58:04,448 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:58:04,449 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:58:04,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:58:04,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:58:04,450 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:58:04,450 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:58:04,451 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:58:04,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:58:04,453 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:58:04,453 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:58:04,453 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:58:04,453 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:58:04,454 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:58:04,456 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:58:04,457 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 17:58:04,457 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:58:04,457 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:58:04,457 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:58:04,457 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:58:04,457 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:58:04,458 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:58:04,458 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:58:04,458 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:58:04,458 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:58:04,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:58:04,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:58:04,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:58:04,459 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:58:04,459 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:58:04,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:58:04,459 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:58:04,459 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:58:04,460 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:58:04,460 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:58:04,461 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 -> db322df1d89bf1549765f136e3e3b8000484c0c3108c31998992cf725d6dcc20 [2024-10-14 17:58:04,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:58:04,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:58:04,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:58:04,684 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:58:04,684 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:58:04,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i [2024-10-14 17:58:05,862 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:58:06,068 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:58:06,068 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i [2024-10-14 17:58:06,082 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff45af996/76ad00eb5dfd401d8d61327e663bd3de/FLAG34ec2a554 [2024-10-14 17:58:06,096 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff45af996/76ad00eb5dfd401d8d61327e663bd3de [2024-10-14 17:58:06,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:58:06,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:58:06,104 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:58:06,104 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:58:06,108 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:58:06,109 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:58:06" (1/1) ... [2024-10-14 17:58:06,109 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34379b39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:58:06, skipping insertion in model container [2024-10-14 17:58:06,110 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:58:06" (1/1) ... [2024-10-14 17:58:06,142 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:58:06,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:58:06,375 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:58:06,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:58:06,459 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:58:06,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:58:06 WrapperNode [2024-10-14 17:58:06,459 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:58:06,460 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:58:06,460 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:58:06,460 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:58:06,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:58:06" (1/1) ... [2024-10-14 17:58:06,483 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:58:06" (1/1) ... [2024-10-14 17:58:06,515 INFO L138 Inliner]: procedures = 125, calls = 95, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 365 [2024-10-14 17:58:06,516 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:58:06,516 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:58:06,516 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:58:06,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:58:06,524 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:58:06" (1/1) ... [2024-10-14 17:58:06,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:58:06" (1/1) ... [2024-10-14 17:58:06,530 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:58:06" (1/1) ... [2024-10-14 17:58:06,560 INFO L175 MemorySlicer]: Split 66 memory accesses to 3 slices as follows [2, 10, 54]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 11 writes are split as follows [0, 5, 6]. [2024-10-14 17:58:06,560 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:58:06" (1/1) ... [2024-10-14 17:58:06,560 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:58:06" (1/1) ... [2024-10-14 17:58:06,569 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:58:06" (1/1) ... [2024-10-14 17:58:06,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:58:06" (1/1) ... [2024-10-14 17:58:06,579 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:58:06" (1/1) ... [2024-10-14 17:58:06,580 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:58:06" (1/1) ... [2024-10-14 17:58:06,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:58:06,586 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:58:06,586 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:58:06,586 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:58:06,587 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:58:06" (1/1) ... [2024-10-14 17:58:06,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:58:06,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:58:06,616 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-10-14 17:58:06,619 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-10-14 17:58:06,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 17:58:06,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 17:58:06,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 17:58:06,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 17:58:06,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 17:58:06,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 17:58:06,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:58:06,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:58:06,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 17:58:06,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 17:58:06,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 17:58:06,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 17:58:06,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 17:58:06,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 17:58:06,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:58:06,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 17:58:06,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 17:58:06,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 17:58:06,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:58:06,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:58:06,655 INFO L130 BoogieDeclarations]: Found specification of procedure append [2024-10-14 17:58:06,655 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2024-10-14 17:58:06,752 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:58:06,753 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:58:07,301 INFO L? ?]: Removed 359 outVars from TransFormulas that were not future-live. [2024-10-14 17:58:07,301 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:58:07,340 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:58:07,343 INFO L314 CfgBuilder]: Removed 11 assume(true) statements. [2024-10-14 17:58:07,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:58:07 BoogieIcfgContainer [2024-10-14 17:58:07,343 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:58:07,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:58:07,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:58:07,347 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:58:07,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:58:06" (1/3) ... [2024-10-14 17:58:07,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64bece4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:58:07, skipping insertion in model container [2024-10-14 17:58:07,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:58:06" (2/3) ... [2024-10-14 17:58:07,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64bece4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:58:07, skipping insertion in model container [2024-10-14 17:58:07,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:58:07" (3/3) ... [2024-10-14 17:58:07,349 INFO L112 eAbstractionObserver]: Analyzing ICFG split_list_test05-2.i [2024-10-14 17:58:07,366 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:58:07,366 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 147 error locations. [2024-10-14 17:58:07,408 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:58:07,413 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;@62fad855, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:58:07,414 INFO L334 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2024-10-14 17:58:07,417 INFO L276 IsEmpty]: Start isEmpty. Operand has 293 states, 129 states have (on average 2.4031007751937983) internal successors, (310), 278 states have internal predecessors, (310), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 17:58:07,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 17:58:07,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:58:07,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 17:58:07,422 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:58:07,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:58:07,426 INFO L85 PathProgramCache]: Analyzing trace with hash 18387, now seen corresponding path program 1 times [2024-10-14 17:58:07,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:58:07,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877671034] [2024-10-14 17:58:07,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:07,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:58:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:07,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:58:07,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:58:07,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877671034] [2024-10-14 17:58:07,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877671034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:58:07,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:58:07,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 17:58:07,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191594664] [2024-10-14 17:58:07,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:58:07,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:58:07,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:58:07,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:58:07,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:58:07,599 INFO L87 Difference]: Start difference. First operand has 293 states, 129 states have (on average 2.4031007751937983) internal successors, (310), 278 states have internal predecessors, (310), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:58:07,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:58:07,965 INFO L93 Difference]: Finished difference Result 498 states and 552 transitions. [2024-10-14 17:58:07,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:58:07,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-14 17:58:07,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:58:07,979 INFO L225 Difference]: With dead ends: 498 [2024-10-14 17:58:07,979 INFO L226 Difference]: Without dead ends: 497 [2024-10-14 17:58:07,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-14 17:58:07,983 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 221 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:58:07,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 374 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:58:07,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-10-14 17:58:08,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 364. [2024-10-14 17:58:08,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 203 states have (on average 2.3201970443349755) internal successors, (471), 349 states have internal predecessors, (471), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 17:58:08,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 501 transitions. [2024-10-14 17:58:08,038 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 501 transitions. Word has length 2 [2024-10-14 17:58:08,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:58:08,038 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 501 transitions. [2024-10-14 17:58:08,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:58:08,039 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 501 transitions. [2024-10-14 17:58:08,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 17:58:08,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:58:08,040 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 17:58:08,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:58:08,040 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:58:08,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:58:08,041 INFO L85 PathProgramCache]: Analyzing trace with hash 18388, now seen corresponding path program 1 times [2024-10-14 17:58:08,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:58:08,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321081909] [2024-10-14 17:58:08,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:08,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:58:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:08,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:58:08,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:58:08,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321081909] [2024-10-14 17:58:08,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321081909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:58:08,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:58:08,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 17:58:08,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276585605] [2024-10-14 17:58:08,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:58:08,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:58:08,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:58:08,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:58:08,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:58:08,165 INFO L87 Difference]: Start difference. First operand 364 states and 501 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:58:08,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:58:08,326 INFO L93 Difference]: Finished difference Result 365 states and 504 transitions. [2024-10-14 17:58:08,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:58:08,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-14 17:58:08,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:58:08,328 INFO L225 Difference]: With dead ends: 365 [2024-10-14 17:58:08,328 INFO L226 Difference]: Without dead ends: 365 [2024-10-14 17:58:08,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-14 17:58:08,329 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 5 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:58:08,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 471 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:58:08,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-10-14 17:58:08,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2024-10-14 17:58:08,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 203 states have (on average 2.310344827586207) internal successors, (469), 347 states have internal predecessors, (469), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 17:58:08,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 499 transitions. [2024-10-14 17:58:08,350 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 499 transitions. Word has length 2 [2024-10-14 17:58:08,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:58:08,350 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 499 transitions. [2024-10-14 17:58:08,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:58:08,350 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 499 transitions. [2024-10-14 17:58:08,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 17:58:08,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:58:08,351 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:58:08,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:58:08,351 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:58:08,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:58:08,352 INFO L85 PathProgramCache]: Analyzing trace with hash -702363284, now seen corresponding path program 1 times [2024-10-14 17:58:08,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:58:08,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362133428] [2024-10-14 17:58:08,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:08,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:58:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:08,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:58:08,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:58:08,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362133428] [2024-10-14 17:58:08,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362133428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:58:08,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:58:08,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:58:08,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819992729] [2024-10-14 17:58:08,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:58:08,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:58:08,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:58:08,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:58:08,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:58:08,434 INFO L87 Difference]: Start difference. First operand 362 states and 499 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-10-14 17:58:08,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:58:08,588 INFO L93 Difference]: Finished difference Result 357 states and 494 transitions. [2024-10-14 17:58:08,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:58:08,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2024-10-14 17:58:08,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:58:08,589 INFO L225 Difference]: With dead ends: 357 [2024-10-14 17:58:08,589 INFO L226 Difference]: Without dead ends: 357 [2024-10-14 17:58:08,590 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-10-14 17:58:08,590 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 31 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:58:08,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 426 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:58:08,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-10-14 17:58:08,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2024-10-14 17:58:08,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 203 states have (on average 2.2857142857142856) internal successors, (464), 342 states have internal predecessors, (464), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 17:58:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 494 transitions. [2024-10-14 17:58:08,603 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 494 transitions. Word has length 8 [2024-10-14 17:58:08,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:58:08,603 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 494 transitions. [2024-10-14 17:58:08,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-10-14 17:58:08,603 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 494 transitions. [2024-10-14 17:58:08,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 17:58:08,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:58:08,604 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:58:08,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:58:08,604 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:58:08,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:58:08,605 INFO L85 PathProgramCache]: Analyzing trace with hash -702363283, now seen corresponding path program 1 times [2024-10-14 17:58:08,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:58:08,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808488178] [2024-10-14 17:58:08,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:08,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:58:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:08,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:58:08,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:58:08,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808488178] [2024-10-14 17:58:08,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808488178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:58:08,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:58:08,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:58:08,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172996402] [2024-10-14 17:58:08,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:58:08,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:58:08,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:58:08,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:58:08,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:58:08,683 INFO L87 Difference]: Start difference. First operand 357 states and 494 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-10-14 17:58:08,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:58:08,826 INFO L93 Difference]: Finished difference Result 352 states and 489 transitions. [2024-10-14 17:58:08,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:58:08,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2024-10-14 17:58:08,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:58:08,828 INFO L225 Difference]: With dead ends: 352 [2024-10-14 17:58:08,829 INFO L226 Difference]: Without dead ends: 352 [2024-10-14 17:58:08,829 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-10-14 17:58:08,829 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 31 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:58:08,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 437 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:58:08,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-14 17:58:08,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2024-10-14 17:58:08,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 203 states have (on average 2.2610837438423643) internal successors, (459), 337 states have internal predecessors, (459), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 17:58:08,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 489 transitions. [2024-10-14 17:58:08,839 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 489 transitions. Word has length 8 [2024-10-14 17:58:08,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:58:08,839 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 489 transitions. [2024-10-14 17:58:08,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-10-14 17:58:08,840 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 489 transitions. [2024-10-14 17:58:08,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 17:58:08,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:58:08,840 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:58:08,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:58:08,842 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:58:08,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:58:08,842 INFO L85 PathProgramCache]: Analyzing trace with hash -298424900, now seen corresponding path program 1 times [2024-10-14 17:58:08,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:58:08,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484027511] [2024-10-14 17:58:08,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:08,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:58:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:08,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:58:08,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:58:08,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484027511] [2024-10-14 17:58:08,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484027511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:58:08,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:58:08,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:58:08,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632321394] [2024-10-14 17:58:08,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:58:08,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:58:08,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:58:08,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:58:08,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:58:08,987 INFO L87 Difference]: Start difference. First operand 352 states and 489 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-10-14 17:58:09,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:58:09,376 INFO L93 Difference]: Finished difference Result 474 states and 526 transitions. [2024-10-14 17:58:09,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:58:09,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 9 [2024-10-14 17:58:09,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:58:09,377 INFO L225 Difference]: With dead ends: 474 [2024-10-14 17:58:09,378 INFO L226 Difference]: Without dead ends: 474 [2024-10-14 17:58:09,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:58:09,378 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 288 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:58:09,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 522 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 17:58:09,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-10-14 17:58:09,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 344. [2024-10-14 17:58:09,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 203 states have (on average 2.2216748768472905) internal successors, (451), 329 states have internal predecessors, (451), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 17:58:09,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 481 transitions. [2024-10-14 17:58:09,384 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 481 transitions. Word has length 9 [2024-10-14 17:58:09,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:58:09,385 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 481 transitions. [2024-10-14 17:58:09,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-10-14 17:58:09,385 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 481 transitions. [2024-10-14 17:58:09,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 17:58:09,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:58:09,385 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:58:09,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:58:09,386 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:58:09,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:58:09,386 INFO L85 PathProgramCache]: Analyzing trace with hash -298424899, now seen corresponding path program 1 times [2024-10-14 17:58:09,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:58:09,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232859442] [2024-10-14 17:58:09,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:09,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:58:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:09,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:58:09,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:58:09,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232859442] [2024-10-14 17:58:09,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232859442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:58:09,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:58:09,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:58:09,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763651229] [2024-10-14 17:58:09,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:58:09,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:58:09,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:58:09,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:58:09,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:58:09,524 INFO L87 Difference]: Start difference. First operand 344 states and 481 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-10-14 17:58:10,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:58:10,089 INFO L93 Difference]: Finished difference Result 464 states and 516 transitions. [2024-10-14 17:58:10,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:58:10,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 9 [2024-10-14 17:58:10,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:58:10,092 INFO L225 Difference]: With dead ends: 464 [2024-10-14 17:58:10,092 INFO L226 Difference]: Without dead ends: 464 [2024-10-14 17:58:10,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:58:10,093 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 484 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 17:58:10,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 337 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 17:58:10,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-10-14 17:58:10,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 335. [2024-10-14 17:58:10,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 203 states have (on average 2.1724137931034484) internal successors, (441), 320 states have internal predecessors, (441), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 17:58:10,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 471 transitions. [2024-10-14 17:58:10,105 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 471 transitions. Word has length 9 [2024-10-14 17:58:10,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:58:10,105 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 471 transitions. [2024-10-14 17:58:10,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-10-14 17:58:10,106 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 471 transitions. [2024-10-14 17:58:10,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 17:58:10,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:58:10,107 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:58:10,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:58:10,107 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:58:10,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:58:10,108 INFO L85 PathProgramCache]: Analyzing trace with hash 718604548, now seen corresponding path program 1 times [2024-10-14 17:58:10,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:58:10,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290099872] [2024-10-14 17:58:10,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:10,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:58:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:10,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:58:10,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:58:10,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290099872] [2024-10-14 17:58:10,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290099872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:58:10,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:58:10,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 17:58:10,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370785445] [2024-10-14 17:58:10,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:58:10,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:58:10,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:58:10,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:58:10,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:58:10,340 INFO L87 Difference]: Start difference. First operand 335 states and 471 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:58:10,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:58:10,515 INFO L93 Difference]: Finished difference Result 353 states and 492 transitions. [2024-10-14 17:58:10,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:58:10,515 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-14 17:58:10,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:58:10,516 INFO L225 Difference]: With dead ends: 353 [2024-10-14 17:58:10,517 INFO L226 Difference]: Without dead ends: 353 [2024-10-14 17:58:10,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:58:10,517 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 27 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:58:10,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1265 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:58:10,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-10-14 17:58:10,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 342. [2024-10-14 17:58:10,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 209 states have (on average 2.1435406698564594) internal successors, (448), 326 states have internal predecessors, (448), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 17:58:10,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 480 transitions. [2024-10-14 17:58:10,526 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 480 transitions. Word has length 16 [2024-10-14 17:58:10,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:58:10,527 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 480 transitions. [2024-10-14 17:58:10,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:58:10,527 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 480 transitions. [2024-10-14 17:58:10,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 17:58:10,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:58:10,527 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:58:10,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:58:10,527 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:58:10,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:58:10,528 INFO L85 PathProgramCache]: Analyzing trace with hash -517000016, now seen corresponding path program 1 times [2024-10-14 17:58:10,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:58:10,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449191861] [2024-10-14 17:58:10,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:10,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:58:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:10,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:58:10,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:58:10,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449191861] [2024-10-14 17:58:10,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449191861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:58:10,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:58:10,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 17:58:10,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139077773] [2024-10-14 17:58:10,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:58:10,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 17:58:10,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:58:10,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 17:58:10,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:58:10,755 INFO L87 Difference]: Start difference. First operand 342 states and 480 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 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-10-14 17:58:10,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:58:10,961 INFO L93 Difference]: Finished difference Result 346 states and 484 transitions. [2024-10-14 17:58:10,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:58:10,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 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 17 [2024-10-14 17:58:10,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:58:10,963 INFO L225 Difference]: With dead ends: 346 [2024-10-14 17:58:10,963 INFO L226 Difference]: Without dead ends: 346 [2024-10-14 17:58:10,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-14 17:58:10,964 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 246 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:58:10,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1279 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:58:10,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-10-14 17:58:10,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 344. [2024-10-14 17:58:10,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 211 states have (on average 2.132701421800948) internal successors, (450), 328 states have internal predecessors, (450), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 17:58:10,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 482 transitions. [2024-10-14 17:58:10,969 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 482 transitions. Word has length 17 [2024-10-14 17:58:10,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:58:10,970 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 482 transitions. [2024-10-14 17:58:10,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 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-10-14 17:58:10,970 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 482 transitions. [2024-10-14 17:58:10,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 17:58:10,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:58:10,971 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:58:10,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:58:10,971 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:58:10,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:58:10,971 INFO L85 PathProgramCache]: Analyzing trace with hash -342667833, now seen corresponding path program 1 times [2024-10-14 17:58:10,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:58:10,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115678453] [2024-10-14 17:58:10,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:10,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:58:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:11,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 17:58:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:58:11,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:58:11,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115678453] [2024-10-14 17:58:11,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115678453] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:58:11,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312049830] [2024-10-14 17:58:11,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:11,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:58:11,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:58:11,503 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-10-14 17:58:11,505 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-10-14 17:58:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:11,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-14 17:58:11,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:58:11,653 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-10-14 17:58:11,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 17:58:11,766 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-10-14 17:58:11,767 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 18 treesize of output 20 [2024-10-14 17:58:11,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-14 17:58:11,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:58:11,847 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:58:11,948 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 34 treesize of output 28 [2024-10-14 17:58:12,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:58:12,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312049830] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:58:12,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:58:12,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 18 [2024-10-14 17:58:12,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316046594] [2024-10-14 17:58:12,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:58:12,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 17:58:12,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:58:12,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 17:58:12,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-10-14 17:58:12,058 INFO L87 Difference]: Start difference. First operand 344 states and 482 transitions. Second operand has 19 states, 18 states have (on average 4.0) internal successors, (72), 17 states have internal predecessors, (72), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:58:13,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:58:13,185 INFO L93 Difference]: Finished difference Result 478 states and 531 transitions. [2024-10-14 17:58:13,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 17:58:13,186 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.0) internal successors, (72), 17 states have internal predecessors, (72), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2024-10-14 17:58:13,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:58:13,187 INFO L225 Difference]: With dead ends: 478 [2024-10-14 17:58:13,188 INFO L226 Difference]: Without dead ends: 478 [2024-10-14 17:58:13,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2024-10-14 17:58:13,189 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 958 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 1943 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 1608 SdHoareTripleChecker+Invalid, 2021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:58:13,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 1608 Invalid, 2021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1943 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 17:58:13,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-10-14 17:58:13,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 349. [2024-10-14 17:58:13,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 216 states have (on average 2.1018518518518516) internal successors, (454), 333 states have internal predecessors, (454), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 17:58:13,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 486 transitions. [2024-10-14 17:58:13,198 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 486 transitions. Word has length 31 [2024-10-14 17:58:13,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:58:13,199 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 486 transitions. [2024-10-14 17:58:13,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.0) internal successors, (72), 17 states have internal predecessors, (72), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:58:13,199 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 486 transitions. [2024-10-14 17:58:13,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 17:58:13,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:58:13,200 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:58:13,213 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-10-14 17:58:13,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:58:13,401 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:58:13,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:58:13,401 INFO L85 PathProgramCache]: Analyzing trace with hash -342667832, now seen corresponding path program 1 times [2024-10-14 17:58:13,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:58:13,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840917260] [2024-10-14 17:58:13,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:13,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:58:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:14,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 17:58:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:14,263 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:58:14,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:58:14,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840917260] [2024-10-14 17:58:14,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840917260] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:58:14,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168996113] [2024-10-14 17:58:14,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:14,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:58:14,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:58:14,266 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-10-14 17:58:14,267 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-10-14 17:58:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:14,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-14 17:58:14,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:58:14,386 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-10-14 17:58:14,391 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-10-14 17:58:14,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 17:58:14,475 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-10-14 17:58:14,561 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-10-14 17:58:14,562 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 17 treesize of output 17 [2024-10-14 17:58:14,569 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 20 treesize of output 15 [2024-10-14 17:58:14,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-14 17:58:14,633 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:58:14,633 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:58:14,979 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 76 treesize of output 70 [2024-10-14 17:58:14,982 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 106 treesize of output 94 [2024-10-14 17:58:15,016 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 34 treesize of output 28 [2024-10-14 17:58:15,192 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:58:15,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168996113] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:58:15,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:58:15,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 23 [2024-10-14 17:58:15,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996416488] [2024-10-14 17:58:15,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:58:15,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 17:58:15,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:58:15,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 17:58:15,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2024-10-14 17:58:15,194 INFO L87 Difference]: Start difference. First operand 349 states and 486 transitions. Second operand has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 22 states have internal predecessors, (79), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 17:58:17,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:58:17,288 INFO L93 Difference]: Finished difference Result 477 states and 530 transitions. [2024-10-14 17:58:17,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 17:58:17,289 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 22 states have internal predecessors, (79), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2024-10-14 17:58:17,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:58:17,290 INFO L225 Difference]: With dead ends: 477 [2024-10-14 17:58:17,290 INFO L226 Difference]: Without dead ends: 477 [2024-10-14 17:58:17,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=844, Unknown=0, NotChecked=0, Total=992 [2024-10-14 17:58:17,291 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 957 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 3524 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 3601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 3524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 17:58:17,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 1520 Invalid, 3601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 3524 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 17:58:17,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-10-14 17:58:17,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 348. [2024-10-14 17:58:17,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 216 states have (on average 2.0972222222222223) internal successors, (453), 332 states have internal predecessors, (453), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 17:58:17,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 485 transitions. [2024-10-14 17:58:17,299 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 485 transitions. Word has length 31 [2024-10-14 17:58:17,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:58:17,299 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 485 transitions. [2024-10-14 17:58:17,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 22 states have internal predecessors, (79), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 17:58:17,300 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 485 transitions. [2024-10-14 17:58:17,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-14 17:58:17,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:58:17,306 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 17:58:17,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 17:58:17,510 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,SelfDestructingSolverStorable9 [2024-10-14 17:58:17,512 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:58:17,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:58:17,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1640282576, now seen corresponding path program 1 times [2024-10-14 17:58:17,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:58:17,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385875289] [2024-10-14 17:58:17,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:17,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:58:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:17,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 17:58:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:17,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 17:58:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:17,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 17:58:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:17,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 17:58:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:17,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 17:58:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:17,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 17:58:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:17,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 17:58:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:17,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 17:58:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:17,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 17:58:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:17,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 17:58:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:17,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 17:58:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:17,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 17:58:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:17,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-14 17:58:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:17,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-14 17:58:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:17,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-14 17:58:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:17,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 49 proven. 133 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2024-10-14 17:58:17,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:58:17,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385875289] [2024-10-14 17:58:17,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385875289] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:58:17,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455940315] [2024-10-14 17:58:17,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:17,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:58:17,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:58:17,879 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-10-14 17:58:17,880 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-10-14 17:58:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:18,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 2035 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 17:58:18,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:58:18,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 940 trivial. 0 not checked. [2024-10-14 17:58:18,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:58:18,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455940315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:58:18,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 17:58:18,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-10-14 17:58:18,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551270456] [2024-10-14 17:58:18,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:58:18,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:58:18,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:58:18,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:58:18,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:58:18,322 INFO L87 Difference]: Start difference. First operand 348 states and 485 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 17:58:18,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:58:18,369 INFO L93 Difference]: Finished difference Result 349 states and 486 transitions. [2024-10-14 17:58:18,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:58:18,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 198 [2024-10-14 17:58:18,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:58:18,371 INFO L225 Difference]: With dead ends: 349 [2024-10-14 17:58:18,371 INFO L226 Difference]: Without dead ends: 349 [2024-10-14 17:58:18,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 231 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-10-14 17:58:18,371 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 0 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:58:18,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 521 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:58:18,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-14 17:58:18,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2024-10-14 17:58:18,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 217 states have (on average 2.0921658986175116) internal successors, (454), 333 states have internal predecessors, (454), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 17:58:18,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 486 transitions. [2024-10-14 17:58:18,383 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 486 transitions. Word has length 198 [2024-10-14 17:58:18,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:58:18,383 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 486 transitions. [2024-10-14 17:58:18,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 17:58:18,384 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 486 transitions. [2024-10-14 17:58:18,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-14 17:58:18,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:58:18,386 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 17:58:18,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 17:58:18,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:58:18,587 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:58:18,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:58:18,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1786983992, now seen corresponding path program 1 times [2024-10-14 17:58:18,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:58:18,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44934848] [2024-10-14 17:58:18,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:18,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:58:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 17:58:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 17:58:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 17:58:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 17:58:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 17:58:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 17:58:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 17:58:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 17:58:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 17:58:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 17:58:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 17:58:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-14 17:58:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-14 17:58:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-14 17:58:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-14 17:58:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:19,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 963 trivial. 0 not checked. [2024-10-14 17:58:19,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:58:19,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44934848] [2024-10-14 17:58:19,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44934848] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:58:19,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624781976] [2024-10-14 17:58:19,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:19,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:58:19,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:58:19,730 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-10-14 17:58:19,731 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-10-14 17:58:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:20,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 2105 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 17:58:20,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:58:20,191 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-10-14 17:58:20,249 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 9 treesize of output 3 [2024-10-14 17:58:20,254 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 10 treesize of output 4 [2024-10-14 17:58:20,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 670 proven. 11 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2024-10-14 17:58:20,292 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:58:20,364 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 10 treesize of output 4 [2024-10-14 17:58:20,381 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 10 treesize of output 4 [2024-10-14 17:58:20,450 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 32 treesize of output 26 [2024-10-14 17:58:20,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 70 proven. 241 refuted. 0 times theorem prover too weak. 949 trivial. 0 not checked. [2024-10-14 17:58:20,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624781976] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:58:20,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:58:20,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 20 [2024-10-14 17:58:20,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627777070] [2024-10-14 17:58:20,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:58:20,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 17:58:20,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:58:20,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 17:58:20,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-10-14 17:58:20,510 INFO L87 Difference]: Start difference. First operand 349 states and 486 transitions. Second operand has 20 states, 19 states have (on average 4.473684210526316) internal successors, (85), 16 states have internal predecessors, (85), 4 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2024-10-14 17:58:21,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:58:21,247 INFO L93 Difference]: Finished difference Result 343 states and 478 transitions. [2024-10-14 17:58:21,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 17:58:21,247 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.473684210526316) internal successors, (85), 16 states have internal predecessors, (85), 4 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 212 [2024-10-14 17:58:21,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:58:21,248 INFO L225 Difference]: With dead ends: 343 [2024-10-14 17:58:21,248 INFO L226 Difference]: Without dead ends: 343 [2024-10-14 17:58:21,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 449 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=859, Unknown=0, NotChecked=0, Total=1056 [2024-10-14 17:58:21,249 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 508 mSDsluCounter, 2298 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 2535 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 17:58:21,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 2535 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 17:58:21,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-10-14 17:58:21,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2024-10-14 17:58:21,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 211 states have (on average 2.1137440758293837) internal successors, (446), 327 states have internal predecessors, (446), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 17:58:21,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 478 transitions. [2024-10-14 17:58:21,255 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 478 transitions. Word has length 212 [2024-10-14 17:58:21,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:58:21,255 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 478 transitions. [2024-10-14 17:58:21,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.473684210526316) internal successors, (85), 16 states have internal predecessors, (85), 4 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2024-10-14 17:58:21,255 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 478 transitions. [2024-10-14 17:58:21,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-10-14 17:58:21,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:58:21,257 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 17:58:21,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 17:58:21,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:58:21,458 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:58:21,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:58:21,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1766237952, now seen corresponding path program 1 times [2024-10-14 17:58:21,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:58:21,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113940359] [2024-10-14 17:58:21,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:21,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:58:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:33,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 17:58:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:33,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 17:58:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:33,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 17:58:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:34,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 17:58:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:34,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 17:58:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:34,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 17:58:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:34,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 17:58:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:34,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 17:58:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:34,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 17:58:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:34,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 17:58:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:34,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 17:58:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:34,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-14 17:58:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:35,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 17:58:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:35,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-14 17:58:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:35,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-14 17:58:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:35,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 0 proven. 384 refuted. 0 times theorem prover too weak. 897 trivial. 0 not checked. [2024-10-14 17:58:35,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:58:35,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113940359] [2024-10-14 17:58:35,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113940359] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:58:35,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198227272] [2024-10-14 17:58:35,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:58:35,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:58:35,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:58:35,321 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-10-14 17:58:35,322 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-10-14 17:58:35,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:58:35,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 2259 conjuncts, 500 conjuncts are in the unsatisfiable core [2024-10-14 17:58:36,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:58:36,012 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-10-14 17:58:36,019 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-10-14 17:58:36,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 17:58:36,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 17:58:36,111 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 36 treesize of output 27 [2024-10-14 17:58:36,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-14 17:58:36,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 39 [2024-10-14 17:58:36,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:58:36,546 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-10-14 17:58:36,552 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 17:58:36,553 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-10-14 17:58:36,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 14 [2024-10-14 17:58:36,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-14 17:58:36,763 INFO L349 Elim1Store]: treesize reduction 42, result has 36.4 percent of original size [2024-10-14 17:58:36,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 41 [2024-10-14 17:58:36,767 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 30 treesize of output 13 [2024-10-14 17:58:36,770 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 52 treesize of output 28 [2024-10-14 17:58:37,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:58:37,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-10-14 17:58:37,048 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:58:37,061 INFO L349 Elim1Store]: treesize reduction 73, result has 35.4 percent of original size [2024-10-14 17:58:37,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 60 [2024-10-14 17:58:37,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 47 [2024-10-14 17:58:37,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-14 17:58:37,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-14 17:58:37,291 INFO L349 Elim1Store]: treesize reduction 120, result has 35.5 percent of original size [2024-10-14 17:58:37,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 89 [2024-10-14 17:58:37,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-10-14 17:58:37,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 55 [2024-10-14 17:58:37,578 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-10-14 17:58:37,579 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 1 case distinctions, treesize of input 22 treesize of output 24 [2024-10-14 17:58:37,611 INFO L349 Elim1Store]: treesize reduction 134, result has 18.8 percent of original size [2024-10-14 17:58:37,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 54 [2024-10-14 17:58:37,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 43 [2024-10-14 17:58:37,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-14 17:58:38,079 INFO L349 Elim1Store]: treesize reduction 291, result has 22.6 percent of original size [2024-10-14 17:58:38,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 67 treesize of output 103 [2024-10-14 17:58:38,090 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2024-10-14 17:58:38,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 27 [2024-10-14 17:58:38,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 60 [2024-10-14 17:58:38,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-14 17:58:38,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-14 17:58:38,787 INFO L349 Elim1Store]: treesize reduction 198, result has 29.8 percent of original size [2024-10-14 17:58:38,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 53 treesize of output 113 [2024-10-14 17:58:38,807 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-14 17:58:38,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2024-10-14 17:58:38,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 65 [2024-10-14 17:58:39,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 82 [2024-10-14 17:58:39,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:58:39,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:58:39,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:58:39,689 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-14 17:58:39,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 40 [2024-10-14 17:58:39,712 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:58:39,779 INFO L349 Elim1Store]: treesize reduction 255, result has 29.9 percent of original size [2024-10-14 17:58:39,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 16 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 63 treesize of output 144 [2024-10-14 17:58:39,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 14 [2024-10-14 17:58:40,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-14 17:58:40,605 INFO L349 Elim1Store]: treesize reduction 378, result has 27.2 percent of original size [2024-10-14 17:58:40,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 23 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 82 treesize of output 168 [2024-10-14 17:58:40,625 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-14 17:58:40,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 25 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 54 [2024-10-14 17:58:40,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 96 [2024-10-14 17:58:42,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 92 [2024-10-14 17:58:42,430 INFO L349 Elim1Store]: treesize reduction 296, result has 30.4 percent of original size [2024-10-14 17:58:42,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 31 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 68 treesize of output 167 [2024-10-14 17:58:42,463 INFO L349 Elim1Store]: treesize reduction 39, result has 11.4 percent of original size [2024-10-14 17:58:42,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 33 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 56 [2024-10-14 17:58:42,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 14 [2024-10-14 17:58:53,340 INFO L349 Elim1Store]: treesize reduction 344, result has 31.2 percent of original size [2024-10-14 17:58:53,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 39 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 23 case distinctions, treesize of input 79 treesize of output 197 [2024-10-14 17:58:53,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 249 treesize of output 121 [2024-10-14 17:58:53,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 21 [2024-10-14 17:58:53,430 INFO L349 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2024-10-14 17:58:53,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 42 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 64 [2024-10-14 17:59:06,709 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-10-14 17:59:06,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-10-14 17:59:06,710 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-10-14 17:59:06,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 17:59:06,911 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,SelfDestructingSolverStorable12 [2024-10-14 17:59:06,912 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:86) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:947) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:553) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:290) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 46 more [2024-10-14 17:59:06,917 INFO L158 Benchmark]: Toolchain (without parser) took 60817.10ms. Allocated memory was 188.7MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 120.9MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 878.9MB. Max. memory is 16.1GB. [2024-10-14 17:59:06,917 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 123.7MB. Free memory was 86.3MB in the beginning and 86.1MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:59:06,917 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.74ms. Allocated memory is still 188.7MB. Free memory was 120.9MB in the beginning and 100.5MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 17:59:06,917 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.65ms. Allocated memory is still 188.7MB. Free memory was 100.5MB in the beginning and 97.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 17:59:06,920 INFO L158 Benchmark]: Boogie Preprocessor took 69.35ms. Allocated memory is still 188.7MB. Free memory was 97.6MB in the beginning and 92.2MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 17:59:06,920 INFO L158 Benchmark]: RCFGBuilder took 757.28ms. Allocated memory is still 188.7MB. Free memory was 92.2MB in the beginning and 113.2MB in the end (delta: -21.0MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2024-10-14 17:59:06,920 INFO L158 Benchmark]: TraceAbstraction took 59572.07ms. Allocated memory was 188.7MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 112.1MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 869.5MB. Max. memory is 16.1GB. [2024-10-14 17:59:06,921 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 123.7MB. Free memory was 86.3MB in the beginning and 86.1MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 355.74ms. Allocated memory is still 188.7MB. Free memory was 120.9MB in the beginning and 100.5MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.65ms. Allocated memory is still 188.7MB. Free memory was 100.5MB in the beginning and 97.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.35ms. Allocated memory is still 188.7MB. Free memory was 97.6MB in the beginning and 92.2MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 757.28ms. Allocated memory is still 188.7MB. Free memory was 92.2MB in the beginning and 113.2MB in the end (delta: -21.0MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. * TraceAbstraction took 59572.07ms. Allocated memory was 188.7MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 112.1MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 869.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 db322df1d89bf1549765f136e3e3b8000484c0c3108c31998992cf725d6dcc20 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:59:08,579 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:59:08,642 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-14 17:59:08,646 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:59:08,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:59:08,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:59:08,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:59:08,675 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:59:08,675 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:59:08,676 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:59:08,677 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:59:08,677 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:59:08,678 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:59:08,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:59:08,680 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:59:08,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:59:08,680 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:59:08,681 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:59:08,681 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:59:08,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:59:08,681 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:59:08,681 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:59:08,682 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 17:59:08,682 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:59:08,682 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:59:08,682 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 17:59:08,683 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:59:08,683 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 17:59:08,683 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:59:08,683 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:59:08,683 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:59:08,684 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:59:08,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:59:08,684 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:59:08,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:59:08,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:59:08,685 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:59:08,686 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:59:08,686 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 17:59:08,686 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 17:59:08,686 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:59:08,686 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:59:08,686 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:59:08,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:59:08,687 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 17:59:08,687 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 -> db322df1d89bf1549765f136e3e3b8000484c0c3108c31998992cf725d6dcc20 [2024-10-14 17:59:08,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:59:08,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:59:08,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:59:08,956 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:59:08,956 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:59:08,957 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i [2024-10-14 17:59:10,196 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:59:10,387 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:59:10,387 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i [2024-10-14 17:59:10,397 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d0f15234/cc6057e549894ec4a1a064f1eba57afc/FLAGd958dfbce [2024-10-14 17:59:10,762 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d0f15234/cc6057e549894ec4a1a064f1eba57afc [2024-10-14 17:59:10,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:59:10,766 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:59:10,768 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:59:10,768 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:59:10,772 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:59:10,772 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:59:10" (1/1) ... [2024-10-14 17:59:10,774 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c0c40de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:10, skipping insertion in model container [2024-10-14 17:59:10,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:59:10" (1/1) ... [2024-10-14 17:59:10,811 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:59:11,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:59:11,102 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:59:11,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:59:11,184 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:59:11,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:11 WrapperNode [2024-10-14 17:59:11,185 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:59:11,186 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:59:11,186 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:59:11,186 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:59:11,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:11" (1/1) ... [2024-10-14 17:59:11,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:11" (1/1) ... [2024-10-14 17:59:11,246 INFO L138 Inliner]: procedures = 126, calls = 95, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 355 [2024-10-14 17:59:11,247 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:59:11,247 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:59:11,247 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:59:11,248 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:59:11,256 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:11" (1/1) ... [2024-10-14 17:59:11,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:11" (1/1) ... [2024-10-14 17:59:11,267 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:11" (1/1) ... [2024-10-14 17:59:11,296 INFO L175 MemorySlicer]: Split 66 memory accesses to 3 slices as follows [2, 10, 54]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 11 writes are split as follows [0, 5, 6]. [2024-10-14 17:59:11,296 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:11" (1/1) ... [2024-10-14 17:59:11,296 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:11" (1/1) ... [2024-10-14 17:59:11,308 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:11" (1/1) ... [2024-10-14 17:59:11,311 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:11" (1/1) ... [2024-10-14 17:59:11,313 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:11" (1/1) ... [2024-10-14 17:59:11,315 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:11" (1/1) ... [2024-10-14 17:59:11,318 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:59:11,318 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:59:11,318 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:59:11,319 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:59:11,320 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:11" (1/1) ... [2024-10-14 17:59:11,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:59:11,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:59:11,345 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-10-14 17:59:11,352 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-10-14 17:59:11,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 17:59:11,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 17:59:11,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-14 17:59:11,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:59:11,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:59:11,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 17:59:11,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 17:59:11,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 17:59:11,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 17:59:11,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 17:59:11,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 17:59:11,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-14 17:59:11,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-14 17:59:11,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-14 17:59:11,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:59:11,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 17:59:11,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 17:59:11,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 17:59:11,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:59:11,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:59:11,387 INFO L130 BoogieDeclarations]: Found specification of procedure append [2024-10-14 17:59:11,387 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2024-10-14 17:59:11,500 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:59:11,502 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:59:12,280 INFO L? ?]: Removed 359 outVars from TransFormulas that were not future-live. [2024-10-14 17:59:12,280 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:59:12,330 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:59:12,330 INFO L314 CfgBuilder]: Removed 11 assume(true) statements. [2024-10-14 17:59:12,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:59:12 BoogieIcfgContainer [2024-10-14 17:59:12,331 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:59:12,333 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:59:12,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:59:12,336 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:59:12,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:59:10" (1/3) ... [2024-10-14 17:59:12,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@346d8e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:59:12, skipping insertion in model container [2024-10-14 17:59:12,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:11" (2/3) ... [2024-10-14 17:59:12,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@346d8e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:59:12, skipping insertion in model container [2024-10-14 17:59:12,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:59:12" (3/3) ... [2024-10-14 17:59:12,338 INFO L112 eAbstractionObserver]: Analyzing ICFG split_list_test05-2.i [2024-10-14 17:59:12,349 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:59:12,350 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 147 error locations. [2024-10-14 17:59:12,398 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:59:12,403 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;@2f951e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:59:12,404 INFO L334 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2024-10-14 17:59:12,407 INFO L276 IsEmpty]: Start isEmpty. Operand has 293 states, 129 states have (on average 2.4031007751937983) internal successors, (310), 278 states have internal predecessors, (310), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 17:59:12,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 17:59:12,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:12,414 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 17:59:12,414 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:59:12,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:12,420 INFO L85 PathProgramCache]: Analyzing trace with hash 18387, now seen corresponding path program 1 times [2024-10-14 17:59:12,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:59:12,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817131428] [2024-10-14 17:59:12,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:12,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:12,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:59:12,435 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:59:12,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 17:59:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:12,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:59:12,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:12,548 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 7 [2024-10-14 17:59:12,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:12,574 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:59:12,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:59:12,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817131428] [2024-10-14 17:59:12,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [817131428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:59:12,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:59:12,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 17:59:12,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093729335] [2024-10-14 17:59:12,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:59:12,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:59:12,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:59:12,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:59:12,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:59:12,606 INFO L87 Difference]: Start difference. First operand has 293 states, 129 states have (on average 2.4031007751937983) internal successors, (310), 278 states have internal predecessors, (310), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:13,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:13,118 INFO L93 Difference]: Finished difference Result 498 states and 552 transitions. [2024-10-14 17:59:13,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:59:13,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-14 17:59:13,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:13,130 INFO L225 Difference]: With dead ends: 498 [2024-10-14 17:59:13,130 INFO L226 Difference]: Without dead ends: 497 [2024-10-14 17:59:13,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-14 17:59:13,134 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 221 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:13,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 374 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 17:59:13,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-10-14 17:59:13,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 364. [2024-10-14 17:59:13,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 203 states have (on average 2.3201970443349755) internal successors, (471), 349 states have internal predecessors, (471), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 17:59:13,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 501 transitions. [2024-10-14 17:59:13,181 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 501 transitions. Word has length 2 [2024-10-14 17:59:13,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:13,181 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 501 transitions. [2024-10-14 17:59:13,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:13,181 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 501 transitions. [2024-10-14 17:59:13,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 17:59:13,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:13,182 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 17:59:13,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 17:59:13,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:13,385 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:59:13,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:13,386 INFO L85 PathProgramCache]: Analyzing trace with hash 18388, now seen corresponding path program 1 times [2024-10-14 17:59:13,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:59:13,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392459562] [2024-10-14 17:59:13,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:13,387 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:13,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:59:13,389 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:59:13,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 17:59:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:13,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:59:13,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:13,438 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-10-14 17:59:13,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:13,446 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:59:13,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:59:13,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1392459562] [2024-10-14 17:59:13,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1392459562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:59:13,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:59:13,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 17:59:13,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170802638] [2024-10-14 17:59:13,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:59:13,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:59:13,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:59:13,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:59:13,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:59:13,449 INFO L87 Difference]: Start difference. First operand 364 states and 501 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:13,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:13,793 INFO L93 Difference]: Finished difference Result 365 states and 504 transitions. [2024-10-14 17:59:13,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:59:13,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-14 17:59:13,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:13,795 INFO L225 Difference]: With dead ends: 365 [2024-10-14 17:59:13,795 INFO L226 Difference]: Without dead ends: 365 [2024-10-14 17:59:13,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-14 17:59:13,796 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 5 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:13,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 471 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:59:13,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-10-14 17:59:13,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2024-10-14 17:59:13,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 203 states have (on average 2.310344827586207) internal successors, (469), 347 states have internal predecessors, (469), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 17:59:13,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 499 transitions. [2024-10-14 17:59:13,831 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 499 transitions. Word has length 2 [2024-10-14 17:59:13,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:13,831 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 499 transitions. [2024-10-14 17:59:13,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:13,833 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 499 transitions. [2024-10-14 17:59:13,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 17:59:13,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:13,834 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:13,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 17:59:14,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:14,036 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:59:14,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:14,036 INFO L85 PathProgramCache]: Analyzing trace with hash -702363284, now seen corresponding path program 1 times [2024-10-14 17:59:14,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:59:14,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140576950] [2024-10-14 17:59:14,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:14,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:14,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:59:14,054 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:59:14,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 17:59:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:14,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:59:14,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:14,119 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 7 [2024-10-14 17:59:14,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:14,122 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:59:14,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:59:14,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140576950] [2024-10-14 17:59:14,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140576950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:59:14,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:59:14,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:59:14,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120944668] [2024-10-14 17:59:14,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:59:14,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:59:14,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:59:14,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:59:14,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:59:14,124 INFO L87 Difference]: Start difference. First operand 362 states and 499 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-10-14 17:59:14,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:14,369 INFO L93 Difference]: Finished difference Result 357 states and 494 transitions. [2024-10-14 17:59:14,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:59:14,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2024-10-14 17:59:14,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:14,371 INFO L225 Difference]: With dead ends: 357 [2024-10-14 17:59:14,371 INFO L226 Difference]: Without dead ends: 357 [2024-10-14 17:59:14,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-10-14 17:59:14,372 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 31 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:14,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 426 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:59:14,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-10-14 17:59:14,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2024-10-14 17:59:14,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 203 states have (on average 2.2857142857142856) internal successors, (464), 342 states have internal predecessors, (464), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 17:59:14,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 494 transitions. [2024-10-14 17:59:14,381 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 494 transitions. Word has length 8 [2024-10-14 17:59:14,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:14,381 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 494 transitions. [2024-10-14 17:59:14,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-10-14 17:59:14,381 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 494 transitions. [2024-10-14 17:59:14,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 17:59:14,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:14,382 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:14,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-14 17:59:14,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:14,582 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:59:14,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:14,583 INFO L85 PathProgramCache]: Analyzing trace with hash -702363283, now seen corresponding path program 1 times [2024-10-14 17:59:14,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:59:14,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [529879524] [2024-10-14 17:59:14,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:14,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:14,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:59:14,587 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:59:14,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 17:59:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:14,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:59:14,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:14,650 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-10-14 17:59:14,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:14,659 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:59:14,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:59:14,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [529879524] [2024-10-14 17:59:14,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [529879524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:59:14,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:59:14,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:59:14,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616638590] [2024-10-14 17:59:14,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:59:14,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:59:14,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:59:14,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:59:14,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:59:14,660 INFO L87 Difference]: Start difference. First operand 357 states and 494 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-10-14 17:59:14,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:14,993 INFO L93 Difference]: Finished difference Result 352 states and 489 transitions. [2024-10-14 17:59:14,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:59:14,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2024-10-14 17:59:14,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:14,995 INFO L225 Difference]: With dead ends: 352 [2024-10-14 17:59:14,995 INFO L226 Difference]: Without dead ends: 352 [2024-10-14 17:59:14,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-10-14 17:59:14,996 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 31 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:14,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 437 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:59:14,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-14 17:59:15,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2024-10-14 17:59:15,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 203 states have (on average 2.2610837438423643) internal successors, (459), 337 states have internal predecessors, (459), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 17:59:15,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 489 transitions. [2024-10-14 17:59:15,004 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 489 transitions. Word has length 8 [2024-10-14 17:59:15,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:15,004 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 489 transitions. [2024-10-14 17:59:15,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-10-14 17:59:15,004 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 489 transitions. [2024-10-14 17:59:15,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 17:59:15,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:15,004 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:15,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-14 17:59:15,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:15,208 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:59:15,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:15,208 INFO L85 PathProgramCache]: Analyzing trace with hash -298424900, now seen corresponding path program 1 times [2024-10-14 17:59:15,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:59:15,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083768692] [2024-10-14 17:59:15,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:15,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:15,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:59:15,211 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:59:15,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 17:59:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:15,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 17:59:15,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:15,290 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 7 [2024-10-14 17:59:15,352 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-14 17:59:15,353 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 20 [2024-10-14 17:59:15,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:15,383 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:59:15,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:59:15,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083768692] [2024-10-14 17:59:15,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1083768692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:59:15,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:59:15,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:59:15,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598223953] [2024-10-14 17:59:15,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:59:15,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:59:15,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:59:15,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:59:15,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:59:15,385 INFO L87 Difference]: Start difference. First operand 352 states and 489 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-10-14 17:59:16,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:16,156 INFO L93 Difference]: Finished difference Result 474 states and 526 transitions. [2024-10-14 17:59:16,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:59:16,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2024-10-14 17:59:16,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:16,159 INFO L225 Difference]: With dead ends: 474 [2024-10-14 17:59:16,159 INFO L226 Difference]: Without dead ends: 474 [2024-10-14 17:59:16,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-10-14 17:59:16,160 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 274 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:16,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 522 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 17:59:16,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-10-14 17:59:16,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 344. [2024-10-14 17:59:16,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 203 states have (on average 2.2216748768472905) internal successors, (451), 329 states have internal predecessors, (451), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 17:59:16,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 481 transitions. [2024-10-14 17:59:16,167 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 481 transitions. Word has length 9 [2024-10-14 17:59:16,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:16,167 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 481 transitions. [2024-10-14 17:59:16,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-10-14 17:59:16,168 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 481 transitions. [2024-10-14 17:59:16,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 17:59:16,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:16,168 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:16,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-14 17:59:16,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:16,369 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:59:16,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:16,370 INFO L85 PathProgramCache]: Analyzing trace with hash -298424899, now seen corresponding path program 1 times [2024-10-14 17:59:16,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:59:16,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512684228] [2024-10-14 17:59:16,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:16,371 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:16,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:59:16,372 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:59:16,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 17:59:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:16,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 17:59:16,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:16,462 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 7 [2024-10-14 17:59:16,467 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-10-14 17:59:16,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:59:16,561 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-10-14 17:59:16,573 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 17:59:16,573 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 13 treesize of output 13 [2024-10-14 17:59:16,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:16,593 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:59:16,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:59:16,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512684228] [2024-10-14 17:59:16,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512684228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:59:16,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:59:16,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:59:16,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203327189] [2024-10-14 17:59:16,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:59:16,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:59:16,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:59:16,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:59:16,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:59:16,595 INFO L87 Difference]: Start difference. First operand 344 states and 481 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-10-14 17:59:17,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:17,635 INFO L93 Difference]: Finished difference Result 465 states and 517 transitions. [2024-10-14 17:59:17,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:59:17,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2024-10-14 17:59:17,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:17,637 INFO L225 Difference]: With dead ends: 465 [2024-10-14 17:59:17,637 INFO L226 Difference]: Without dead ends: 465 [2024-10-14 17:59:17,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-10-14 17:59:17,637 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 264 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:17,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 334 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 17:59:17,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-10-14 17:59:17,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 336. [2024-10-14 17:59:17,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 203 states have (on average 2.1773399014778323) internal successors, (442), 321 states have internal predecessors, (442), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 17:59:17,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 472 transitions. [2024-10-14 17:59:17,644 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 472 transitions. Word has length 9 [2024-10-14 17:59:17,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:17,644 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 472 transitions. [2024-10-14 17:59:17,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-10-14 17:59:17,644 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 472 transitions. [2024-10-14 17:59:17,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 17:59:17,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:17,645 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:17,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-14 17:59:17,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:17,846 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:59:17,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:17,846 INFO L85 PathProgramCache]: Analyzing trace with hash 718604548, now seen corresponding path program 1 times [2024-10-14 17:59:17,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:59:17,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [910734180] [2024-10-14 17:59:17,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:17,847 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:17,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:59:17,849 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:59:17,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 17:59:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:17,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 17:59:17,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:17,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 17:59:17,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 17:59:17,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-14 17:59:17,971 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 21 treesize of output 20 [2024-10-14 17:59:18,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:18,092 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:59:18,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:59:18,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [910734180] [2024-10-14 17:59:18,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [910734180] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:59:18,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:59:18,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 17:59:18,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482977799] [2024-10-14 17:59:18,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:59:18,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 17:59:18,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:59:18,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 17:59:18,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:59:18,094 INFO L87 Difference]: Start difference. First operand 336 states and 472 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:18,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:18,470 INFO L93 Difference]: Finished difference Result 346 states and 484 transitions. [2024-10-14 17:59:18,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:59:18,470 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-14 17:59:18,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:18,472 INFO L225 Difference]: With dead ends: 346 [2024-10-14 17:59:18,472 INFO L226 Difference]: Without dead ends: 346 [2024-10-14 17:59:18,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-14 17:59:18,473 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 12 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:18,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1273 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:59:18,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-10-14 17:59:18,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 345. [2024-10-14 17:59:18,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 211 states have (on average 2.137440758293839) internal successors, (451), 329 states have internal predecessors, (451), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 17:59:18,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 483 transitions. [2024-10-14 17:59:18,484 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 483 transitions. Word has length 16 [2024-10-14 17:59:18,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:18,485 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 483 transitions. [2024-10-14 17:59:18,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:18,485 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 483 transitions. [2024-10-14 17:59:18,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 17:59:18,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:18,486 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:18,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-14 17:59:18,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:18,690 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:59:18,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:18,691 INFO L85 PathProgramCache]: Analyzing trace with hash -342667833, now seen corresponding path program 1 times [2024-10-14 17:59:18,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:59:18,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [358291517] [2024-10-14 17:59:18,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:18,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:18,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:59:18,693 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:59:18,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-14 17:59:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:18,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 17:59:18,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:18,841 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 7 [2024-10-14 17:59:18,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 17:59:18,957 INFO L349 Elim1Store]: treesize reduction 35, result has 27.1 percent of original size [2024-10-14 17:59:18,958 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 20 treesize of output 26 [2024-10-14 17:59:19,036 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 11 [2024-10-14 17:59:19,050 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:19,051 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:59:19,185 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 38 treesize of output 32 [2024-10-14 17:59:19,328 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:19,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:59:19,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [358291517] [2024-10-14 17:59:19,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [358291517] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:59:19,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:59:19,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-10-14 17:59:19,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650374313] [2024-10-14 17:59:19,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:59:19,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 17:59:19,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:59:19,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 17:59:19,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-14 17:59:19,331 INFO L87 Difference]: Start difference. First operand 345 states and 483 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:59:20,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:20,568 INFO L93 Difference]: Finished difference Result 475 states and 529 transitions. [2024-10-14 17:59:20,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:59:20,568 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2024-10-14 17:59:20,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:20,570 INFO L225 Difference]: With dead ends: 475 [2024-10-14 17:59:20,570 INFO L226 Difference]: Without dead ends: 475 [2024-10-14 17:59:20,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-14 17:59:20,571 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 265 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:20,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 818 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 17:59:20,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-10-14 17:59:20,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 344. [2024-10-14 17:59:20,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 211 states have (on average 2.132701421800948) internal successors, (450), 328 states have internal predecessors, (450), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 17:59:20,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 482 transitions. [2024-10-14 17:59:20,577 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 482 transitions. Word has length 31 [2024-10-14 17:59:20,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:20,578 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 482 transitions. [2024-10-14 17:59:20,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:59:20,578 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 482 transitions. [2024-10-14 17:59:20,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 17:59:20,578 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:20,579 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:20,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 17:59:20,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:20,784 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2024-10-14 17:59:20,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:20,785 INFO L85 PathProgramCache]: Analyzing trace with hash -342667832, now seen corresponding path program 1 times [2024-10-14 17:59:20,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:59:20,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261562147] [2024-10-14 17:59:20,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:20,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:20,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:59:20,787 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:59:20,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-14 17:59:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:20,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-14 17:59:20,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:20,931 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 7 [2024-10-14 17:59:20,936 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-10-14 17:59:21,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 17:59:21,035 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-10-14 17:59:21,135 INFO L349 Elim1Store]: treesize reduction 6, result has 62.5 percent of original size [2024-10-14 17:59:21,136 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 19 treesize of output 19 [2024-10-14 17:59:21,141 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 20 treesize of output 15 [2024-10-14 17:59:21,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-14 17:59:21,217 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:21,217 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:59:21,706 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 76 treesize of output 70 [2024-10-14 17:59:21,713 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 106 treesize of output 94 [2024-10-14 17:59:21,922 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 44 treesize of output 32 [2024-10-14 17:59:23,293 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:23,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:59:23,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261562147] [2024-10-14 17:59:23,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [261562147] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:59:23,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:59:23,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-14 17:59:23,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276500886] [2024-10-14 17:59:23,294 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:59:23,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 17:59:23,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:59:23,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 17:59:23,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-10-14 17:59:23,296 INFO L87 Difference]: Start difference. First operand 344 states and 482 transitions. Second operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)