./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/length_test03-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/memsafety-ext2/length_test03-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 8d477dcc38abb71f88978d460e8393ef9ba09f24c134f3de362c4df2a3599c9a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:43:29,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:43:29,963 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 18:43:29,968 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:43:29,970 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:43:29,995 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:43:29,995 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:43:29,996 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:43:29,996 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:43:29,996 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:43:29,997 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:43:29,997 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:43:29,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:43:29,998 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:43:29,998 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:43:29,998 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:43:29,998 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 18:43:29,999 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:43:29,999 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 18:43:29,999 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:43:29,999 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:43:30,001 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:43:30,001 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 18:43:30,001 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:43:30,002 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:43:30,002 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:43:30,002 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:43:30,002 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 18:43:30,002 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:43:30,002 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:43:30,003 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:43:30,003 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:43:30,003 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:43:30,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:43:30,003 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:43:30,003 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:43:30,004 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 18:43:30,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 18:43:30,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:43:30,005 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:43:30,005 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:43:30,006 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:43:30,006 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 -> 8d477dcc38abb71f88978d460e8393ef9ba09f24c134f3de362c4df2a3599c9a [2024-11-22 18:43:30,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:43:30,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:43:30,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:43:30,232 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:43:30,233 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:43:30,233 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/length_test03-2.i [2024-11-22 18:43:31,475 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:43:31,686 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:43:31,688 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/length_test03-2.i [2024-11-22 18:43:31,703 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8806e1602/f21d809ab5024d6dbd2f346634104360/FLAGb2c87237e [2024-11-22 18:43:32,037 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8806e1602/f21d809ab5024d6dbd2f346634104360 [2024-11-22 18:43:32,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:43:32,040 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:43:32,041 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:43:32,041 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:43:32,045 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:43:32,046 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:43:32" (1/1) ... [2024-11-22 18:43:32,047 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@184194d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:43:32, skipping insertion in model container [2024-11-22 18:43:32,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:43:32" (1/1) ... [2024-11-22 18:43:32,083 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:43:32,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:43:32,328 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 18:43:32,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:43:32,407 INFO L204 MainTranslator]: Completed translation [2024-11-22 18:43:32,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:43:32 WrapperNode [2024-11-22 18:43:32,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:43:32,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 18:43:32,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 18:43:32,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 18:43:32,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:43:32" (1/1) ... [2024-11-22 18:43:32,432 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:43:32" (1/1) ... [2024-11-22 18:43:32,454 INFO L138 Inliner]: procedures = 123, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 101 [2024-11-22 18:43:32,455 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 18:43:32,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 18:43:32,456 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 18:43:32,456 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 18:43:32,465 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:43:32" (1/1) ... [2024-11-22 18:43:32,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:43:32" (1/1) ... [2024-11-22 18:43:32,469 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:43:32" (1/1) ... [2024-11-22 18:43:32,520 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 10, 13]. 52 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 13 writes are split as follows [0, 6, 7]. [2024-11-22 18:43:32,520 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:43:32" (1/1) ... [2024-11-22 18:43:32,520 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:43:32" (1/1) ... [2024-11-22 18:43:32,530 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:43:32" (1/1) ... [2024-11-22 18:43:32,548 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:43:32" (1/1) ... [2024-11-22 18:43:32,550 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:43:32" (1/1) ... [2024-11-22 18:43:32,550 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:43:32" (1/1) ... [2024-11-22 18:43:32,561 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 18:43:32,565 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 18:43:32,565 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 18:43:32,565 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 18:43:32,566 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:43:32" (1/1) ... [2024-11-22 18:43:32,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:43:32,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:43:32,612 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 18:43:32,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 18:43:32,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 18:43:32,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 18:43:32,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-22 18:43:32,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 18:43:32,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 18:43:32,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 18:43:32,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 18:43:32,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-22 18:43:32,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 18:43:32,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 18:43:32,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-22 18:43:32,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 18:43:32,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 18:43:32,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 18:43:32,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-22 18:43:32,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 18:43:32,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 18:43:32,657 INFO L130 BoogieDeclarations]: Found specification of procedure append [2024-11-22 18:43:32,657 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2024-11-22 18:43:32,752 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 18:43:32,753 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 18:43:33,037 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-11-22 18:43:33,037 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 18:43:33,052 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 18:43:33,053 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-22 18:43:33,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:43:33 BoogieIcfgContainer [2024-11-22 18:43:33,053 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 18:43:33,056 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 18:43:33,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 18:43:33,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 18:43:33,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:43:32" (1/3) ... [2024-11-22 18:43:33,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a9ad3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:43:33, skipping insertion in model container [2024-11-22 18:43:33,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:43:32" (2/3) ... [2024-11-22 18:43:33,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a9ad3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:43:33, skipping insertion in model container [2024-11-22 18:43:33,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:43:33" (3/3) ... [2024-11-22 18:43:33,063 INFO L112 eAbstractionObserver]: Analyzing ICFG length_test03-2.i [2024-11-22 18:43:33,075 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 18:43:33,076 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2024-11-22 18:43:33,118 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:43:33,123 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;@11b6b8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:43:33,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2024-11-22 18:43:33,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 67 states have (on average 2.029850746268657) internal successors, (136), 126 states have internal predecessors, (136), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:43:33,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-22 18:43:33,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:33,130 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-22 18:43:33,130 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:43:33,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:33,134 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-11-22 18:43:33,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:33,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733261737] [2024-11-22 18:43:33,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:33,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:33,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:33,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:33,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733261737] [2024-11-22 18:43:33,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733261737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:33,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:33,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:43:33,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476125772] [2024-11-22 18:43:33,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:33,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:43:33,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:33,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:43:33,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:43:33,296 INFO L87 Difference]: Start difference. First operand has 130 states, 67 states have (on average 2.029850746268657) internal successors, (136), 126 states have internal predecessors, (136), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:33,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:33,410 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2024-11-22 18:43:33,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:43:33,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-11-22 18:43:33,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:33,422 INFO L225 Difference]: With dead ends: 167 [2024-11-22 18:43:33,423 INFO L226 Difference]: Without dead ends: 165 [2024-11-22 18:43:33,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:43:33,428 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 51 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:33,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 172 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:43:33,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-22 18:43:33,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 126. [2024-11-22 18:43:33,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 66 states have (on average 1.9393939393939394) internal successors, (128), 122 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:43:33,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2024-11-22 18:43:33,463 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 3 [2024-11-22 18:43:33,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:33,463 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2024-11-22 18:43:33,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:33,463 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2024-11-22 18:43:33,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-22 18:43:33,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:33,464 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-22 18:43:33,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 18:43:33,464 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:43:33,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:33,465 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-11-22 18:43:33,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:33,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276484263] [2024-11-22 18:43:33,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:33,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:33,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:33,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:33,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276484263] [2024-11-22 18:43:33,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276484263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:33,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:33,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:43:33,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424856464] [2024-11-22 18:43:33,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:33,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:43:33,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:33,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:43:33,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:43:33,535 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:33,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:33,617 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2024-11-22 18:43:33,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:43:33,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-11-22 18:43:33,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:33,619 INFO L225 Difference]: With dead ends: 126 [2024-11-22 18:43:33,620 INFO L226 Difference]: Without dead ends: 126 [2024-11-22 18:43:33,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:43:33,621 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 10 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:33,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 193 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:43:33,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-22 18:43:33,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2024-11-22 18:43:33,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 66 states have (on average 1.9090909090909092) internal successors, (126), 120 states have internal predecessors, (126), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:43:33,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2024-11-22 18:43:33,635 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 3 [2024-11-22 18:43:33,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:33,635 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2024-11-22 18:43:33,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:33,636 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2024-11-22 18:43:33,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-22 18:43:33,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:33,636 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-22 18:43:33,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 18:43:33,637 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:43:33,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:33,637 INFO L85 PathProgramCache]: Analyzing trace with hash 889446152, now seen corresponding path program 1 times [2024-11-22 18:43:33,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:33,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059343148] [2024-11-22 18:43:33,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:33,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:33,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:33,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:33,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059343148] [2024-11-22 18:43:33,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059343148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:33,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:33,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:43:33,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542895718] [2024-11-22 18:43:33,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:33,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:43:33,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:33,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:43:33,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:43:33,711 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:33,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:33,801 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2024-11-22 18:43:33,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:43:33,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-22 18:43:33,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:33,803 INFO L225 Difference]: With dead ends: 140 [2024-11-22 18:43:33,803 INFO L226 Difference]: Without dead ends: 140 [2024-11-22 18:43:33,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:43:33,804 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 24 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:33,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 177 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:43:33,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-22 18:43:33,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 127. [2024-11-22 18:43:33,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 71 states have (on average 1.8591549295774648) internal successors, (132), 123 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:43:33,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2024-11-22 18:43:33,818 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 6 [2024-11-22 18:43:33,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:33,832 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2024-11-22 18:43:33,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:33,832 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2024-11-22 18:43:33,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-22 18:43:33,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:33,833 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-22 18:43:33,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 18:43:33,833 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:43:33,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:33,833 INFO L85 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2024-11-22 18:43:33,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:33,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366964014] [2024-11-22 18:43:33,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:33,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:33,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:33,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:33,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366964014] [2024-11-22 18:43:33,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366964014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:33,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:33,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:43:33,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813480160] [2024-11-22 18:43:33,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:33,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:43:33,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:33,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:43:33,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:43:33,942 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:34,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:34,007 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2024-11-22 18:43:34,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:43:34,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-22 18:43:34,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:34,009 INFO L225 Difference]: With dead ends: 127 [2024-11-22 18:43:34,009 INFO L226 Difference]: Without dead ends: 127 [2024-11-22 18:43:34,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:43:34,010 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 4 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:34,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 194 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:43:34,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-22 18:43:34,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2024-11-22 18:43:34,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 71 states have (on average 1.8309859154929577) internal successors, (130), 121 states have internal predecessors, (130), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:43:34,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2024-11-22 18:43:34,015 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 134 transitions. Word has length 6 [2024-11-22 18:43:34,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:34,015 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 134 transitions. [2024-11-22 18:43:34,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:34,016 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 134 transitions. [2024-11-22 18:43:34,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-22 18:43:34,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:34,016 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:34,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 18:43:34,016 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:43:34,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:34,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1036552302, now seen corresponding path program 1 times [2024-11-22 18:43:34,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:34,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686863202] [2024-11-22 18:43:34,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:34,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:34,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:34,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:34,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686863202] [2024-11-22 18:43:34,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686863202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:34,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:34,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:43:34,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729843130] [2024-11-22 18:43:34,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:34,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:43:34,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:34,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:43:34,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:43:34,094 INFO L87 Difference]: Start difference. First operand 125 states and 134 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:34,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:34,154 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2024-11-22 18:43:34,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:43:34,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2024-11-22 18:43:34,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:34,156 INFO L225 Difference]: With dead ends: 120 [2024-11-22 18:43:34,156 INFO L226 Difference]: Without dead ends: 120 [2024-11-22 18:43:34,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:43:34,157 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 35 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:34,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 145 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:43:34,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-22 18:43:34,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-22 18:43:34,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 71 states have (on average 1.7605633802816902) internal successors, (125), 116 states have internal predecessors, (125), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:43:34,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2024-11-22 18:43:34,166 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 12 [2024-11-22 18:43:34,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:34,167 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2024-11-22 18:43:34,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:34,167 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2024-11-22 18:43:34,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-22 18:43:34,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:34,168 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:34,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 18:43:34,168 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:43:34,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:34,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1036552303, now seen corresponding path program 1 times [2024-11-22 18:43:34,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:34,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734656048] [2024-11-22 18:43:34,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:34,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:34,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:34,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:34,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734656048] [2024-11-22 18:43:34,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734656048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:34,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:34,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:43:34,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644155201] [2024-11-22 18:43:34,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:34,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:43:34,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:34,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:43:34,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:43:34,266 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:34,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:34,308 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2024-11-22 18:43:34,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:43:34,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2024-11-22 18:43:34,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:34,309 INFO L225 Difference]: With dead ends: 115 [2024-11-22 18:43:34,309 INFO L226 Difference]: Without dead ends: 115 [2024-11-22 18:43:34,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:43:34,310 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 35 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:34,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 154 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:43:34,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-22 18:43:34,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-22 18:43:34,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 71 states have (on average 1.6901408450704225) internal successors, (120), 111 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:43:34,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2024-11-22 18:43:34,314 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 12 [2024-11-22 18:43:34,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:34,314 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2024-11-22 18:43:34,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:34,315 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2024-11-22 18:43:34,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-22 18:43:34,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:34,315 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:34,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 18:43:34,315 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:43:34,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:34,317 INFO L85 PathProgramCache]: Analyzing trace with hash 2068350391, now seen corresponding path program 1 times [2024-11-22 18:43:34,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:34,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955615719] [2024-11-22 18:43:34,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:34,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:34,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:34,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:34,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955615719] [2024-11-22 18:43:34,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955615719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:34,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:34,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 18:43:34,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241400549] [2024-11-22 18:43:34,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:34,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:43:34,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:34,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:43:34,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:43:34,536 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:34,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:34,713 INFO L93 Difference]: Finished difference Result 221 states and 242 transitions. [2024-11-22 18:43:34,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:43:34,714 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-22 18:43:34,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:34,715 INFO L225 Difference]: With dead ends: 221 [2024-11-22 18:43:34,715 INFO L226 Difference]: Without dead ends: 221 [2024-11-22 18:43:34,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:43:34,716 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 240 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:34,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 220 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:43:34,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-22 18:43:34,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 149. [2024-11-22 18:43:34,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 110 states have (on average 1.6181818181818182) internal successors, (178), 144 states have internal predecessors, (178), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:43:34,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 182 transitions. [2024-11-22 18:43:34,725 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 182 transitions. Word has length 13 [2024-11-22 18:43:34,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:34,725 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 182 transitions. [2024-11-22 18:43:34,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:34,725 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 182 transitions. [2024-11-22 18:43:34,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-22 18:43:34,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:34,726 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:34,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 18:43:34,726 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:43:34,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:34,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2068350392, now seen corresponding path program 1 times [2024-11-22 18:43:34,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:34,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964586314] [2024-11-22 18:43:34,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:34,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:34,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:34,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:34,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964586314] [2024-11-22 18:43:34,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964586314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:34,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:34,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 18:43:34,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268857720] [2024-11-22 18:43:34,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:34,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:43:34,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:34,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:43:34,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:43:34,963 INFO L87 Difference]: Start difference. First operand 149 states and 182 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:35,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:35,121 INFO L93 Difference]: Finished difference Result 171 states and 207 transitions. [2024-11-22 18:43:35,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:43:35,122 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-22 18:43:35,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:35,122 INFO L225 Difference]: With dead ends: 171 [2024-11-22 18:43:35,122 INFO L226 Difference]: Without dead ends: 171 [2024-11-22 18:43:35,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:43:35,123 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 25 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:35,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 330 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:43:35,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-22 18:43:35,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2024-11-22 18:43:35,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 129 states have (on average 1.558139534883721) internal successors, (201), 163 states have internal predecessors, (201), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:43:35,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 207 transitions. [2024-11-22 18:43:35,129 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 207 transitions. Word has length 13 [2024-11-22 18:43:35,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:35,129 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 207 transitions. [2024-11-22 18:43:35,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:35,130 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 207 transitions. [2024-11-22 18:43:35,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-22 18:43:35,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:35,130 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:35,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 18:43:35,131 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:43:35,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:35,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1480883050, now seen corresponding path program 1 times [2024-11-22 18:43:35,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:35,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474503916] [2024-11-22 18:43:35,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:35,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:35,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:35,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:35,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474503916] [2024-11-22 18:43:35,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474503916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:35,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:35,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 18:43:35,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554303708] [2024-11-22 18:43:35,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:35,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 18:43:35,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:35,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 18:43:35,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:43:35,427 INFO L87 Difference]: Start difference. First operand 169 states and 207 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:35,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:35,610 INFO L93 Difference]: Finished difference Result 171 states and 206 transitions. [2024-11-22 18:43:35,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 18:43:35,611 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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 22 [2024-11-22 18:43:35,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:35,611 INFO L225 Difference]: With dead ends: 171 [2024-11-22 18:43:35,611 INFO L226 Difference]: Without dead ends: 171 [2024-11-22 18:43:35,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-22 18:43:35,612 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 38 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:35,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 676 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:43:35,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-22 18:43:35,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2024-11-22 18:43:35,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 129 states have (on average 1.550387596899225) internal successors, (200), 163 states have internal predecessors, (200), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:43:35,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 206 transitions. [2024-11-22 18:43:35,620 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 206 transitions. Word has length 22 [2024-11-22 18:43:35,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:35,620 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 206 transitions. [2024-11-22 18:43:35,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:35,620 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 206 transitions. [2024-11-22 18:43:35,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 18:43:35,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:35,621 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:35,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 18:43:35,622 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:43:35,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:35,624 INFO L85 PathProgramCache]: Analyzing trace with hash -439263795, now seen corresponding path program 1 times [2024-11-22 18:43:35,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:35,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555978790] [2024-11-22 18:43:35,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:35,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:35,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:35,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:35,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555978790] [2024-11-22 18:43:35,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555978790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:35,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:35,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 18:43:35,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617180] [2024-11-22 18:43:35,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:35,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 18:43:35,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:35,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 18:43:35,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-22 18:43:35,938 INFO L87 Difference]: Start difference. First operand 169 states and 206 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:36,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:36,144 INFO L93 Difference]: Finished difference Result 196 states and 231 transitions. [2024-11-22 18:43:36,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 18:43:36,144 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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 24 [2024-11-22 18:43:36,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:36,145 INFO L225 Difference]: With dead ends: 196 [2024-11-22 18:43:36,145 INFO L226 Difference]: Without dead ends: 196 [2024-11-22 18:43:36,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-22 18:43:36,146 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 113 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:36,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 509 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:43:36,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-22 18:43:36,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 160. [2024-11-22 18:43:36,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 121 states have (on average 1.5454545454545454) internal successors, (187), 154 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:43:36,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 193 transitions. [2024-11-22 18:43:36,149 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 193 transitions. Word has length 24 [2024-11-22 18:43:36,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:36,150 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 193 transitions. [2024-11-22 18:43:36,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:43:36,150 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 193 transitions. [2024-11-22 18:43:36,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-22 18:43:36,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:36,150 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:36,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 18:43:36,151 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:43:36,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:36,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1442887251, now seen corresponding path program 1 times [2024-11-22 18:43:36,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:36,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97444045] [2024-11-22 18:43:36,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:36,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:36,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:36,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:36,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97444045] [2024-11-22 18:43:36,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97444045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:43:36,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:43:36,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:43:36,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302852688] [2024-11-22 18:43:36,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:43:36,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:43:36,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:36,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:43:36,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:43:36,200 INFO L87 Difference]: Start difference. First operand 160 states and 193 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:43:36,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:36,210 INFO L93 Difference]: Finished difference Result 153 states and 171 transitions. [2024-11-22 18:43:36,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:43:36,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-22 18:43:36,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:36,211 INFO L225 Difference]: With dead ends: 153 [2024-11-22 18:43:36,211 INFO L226 Difference]: Without dead ends: 153 [2024-11-22 18:43:36,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:43:36,212 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 13 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:36,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 205 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:43:36,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-22 18:43:36,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 139. [2024-11-22 18:43:36,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 100 states have (on average 1.5) internal successors, (150), 133 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:43:36,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 156 transitions. [2024-11-22 18:43:36,215 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 156 transitions. Word has length 30 [2024-11-22 18:43:36,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:36,215 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 156 transitions. [2024-11-22 18:43:36,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:43:36,215 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 156 transitions. [2024-11-22 18:43:36,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-22 18:43:36,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:36,216 INFO L215 NwaCegarLoop]: trace histogram [2, 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] [2024-11-22 18:43:36,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 18:43:36,216 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:43:36,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:36,217 INFO L85 PathProgramCache]: Analyzing trace with hash -610198618, now seen corresponding path program 1 times [2024-11-22 18:43:36,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:36,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244617466] [2024-11-22 18:43:36,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:36,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:36,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:36,526 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:36,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:36,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244617466] [2024-11-22 18:43:36,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244617466] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:43:36,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811475529] [2024-11-22 18:43:36,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:36,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:43:36,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:43:36,529 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:43:36,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 18:43:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:36,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-22 18:43:36,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:43:36,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:43:36,855 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 16 treesize of output 11 [2024-11-22 18:43:36,867 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 18:43:36,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-22 18:43:36,883 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:36,884 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:43:37,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2024-11-22 18:43:37,179 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-11-22 18:43:37,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 49 [2024-11-22 18:43:37,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:43:37,304 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 29 treesize of output 33 [2024-11-22 18:43:37,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:43:37,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 76 [2024-11-22 18:43:37,503 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:37,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811475529] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:43:37,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:43:37,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2024-11-22 18:43:37,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708885313] [2024-11-22 18:43:37,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:43:37,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-22 18:43:37,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:37,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-22 18:43:37,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2024-11-22 18:43:37,505 INFO L87 Difference]: Start difference. First operand 139 states and 156 transitions. Second operand has 23 states, 22 states have (on average 3.5) internal successors, (77), 20 states have internal predecessors, (77), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:43:38,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:38,131 INFO L93 Difference]: Finished difference Result 173 states and 184 transitions. [2024-11-22 18:43:38,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 18:43:38,132 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.5) internal successors, (77), 20 states have internal predecessors, (77), 5 states have call successors, (5), 4 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 32 [2024-11-22 18:43:38,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:38,133 INFO L225 Difference]: With dead ends: 173 [2024-11-22 18:43:38,133 INFO L226 Difference]: Without dead ends: 173 [2024-11-22 18:43:38,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2024-11-22 18:43:38,134 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 390 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:38,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 600 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 18:43:38,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-22 18:43:38,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 138. [2024-11-22 18:43:38,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 132 states have internal predecessors, (143), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:43:38,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2024-11-22 18:43:38,137 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 32 [2024-11-22 18:43:38,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:38,137 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2024-11-22 18:43:38,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.5) internal successors, (77), 20 states have internal predecessors, (77), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:43:38,137 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2024-11-22 18:43:38,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-22 18:43:38,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:38,138 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:38,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 18:43:38,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-22 18:43:38,339 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:43:38,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:38,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1027331565, now seen corresponding path program 1 times [2024-11-22 18:43:38,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:38,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398480227] [2024-11-22 18:43:38,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:38,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:38,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:38,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:38,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398480227] [2024-11-22 18:43:38,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398480227] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:43:38,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055905329] [2024-11-22 18:43:38,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:38,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:43:38,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:43:38,521 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:43:38,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 18:43:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:38,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 18:43:38,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:43:38,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:43:38,650 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (select |c_old(#valid)| append_~node~0.base) 0) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))))) is different from true [2024-11-22 18:43:38,718 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-22 18:43:38,719 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 19 treesize of output 16 [2024-11-22 18:43:38,738 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-22 18:43:38,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-22 18:43:38,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-22 18:43:38,751 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:43:38,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055905329] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:43:38,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:43:38,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2024-11-22 18:43:38,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567968013] [2024-11-22 18:43:38,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:43:38,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 18:43:38,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:38,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 18:43:38,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2024-11-22 18:43:38,824 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 18:43:39,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:39,145 INFO L93 Difference]: Finished difference Result 168 states and 180 transitions. [2024-11-22 18:43:39,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 18:43:39,145 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2024-11-22 18:43:39,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:39,146 INFO L225 Difference]: With dead ends: 168 [2024-11-22 18:43:39,146 INFO L226 Difference]: Without dead ends: 168 [2024-11-22 18:43:39,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=250, Unknown=1, NotChecked=34, Total=380 [2024-11-22 18:43:39,147 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 116 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:39,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 327 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 323 Invalid, 0 Unknown, 142 Unchecked, 0.2s Time] [2024-11-22 18:43:39,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-22 18:43:39,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 141. [2024-11-22 18:43:39,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 105 states have (on average 1.4) internal successors, (147), 135 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 18:43:39,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 154 transitions. [2024-11-22 18:43:39,150 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 154 transitions. Word has length 33 [2024-11-22 18:43:39,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:39,150 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 154 transitions. [2024-11-22 18:43:39,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 18:43:39,150 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 154 transitions. [2024-11-22 18:43:39,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-22 18:43:39,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:39,151 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:39,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 18:43:39,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-22 18:43:39,356 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:43:39,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:39,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1027331566, now seen corresponding path program 1 times [2024-11-22 18:43:39,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:39,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566473770] [2024-11-22 18:43:39,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:39,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:39,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:39,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:39,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566473770] [2024-11-22 18:43:39,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566473770] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:43:39,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708375747] [2024-11-22 18:43:39,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:39,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:43:39,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:43:39,609 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:43:39,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 18:43:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:39,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-22 18:43:39,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:43:39,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:43:39,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-22 18:43:39,790 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (store |c_old(#length)| append_~node~0.base (select |c_#length| append_~node~0.base)) |c_#length|) (= (select |c_old(#valid)| append_~node~0.base) 0) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base 1)))) is different from true [2024-11-22 18:43:39,862 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 18:43:39,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-22 18:43:39,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-22 18:43:39,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:43:39,988 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 14 treesize of output 9 [2024-11-22 18:43:39,999 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-22 18:43:39,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-22 18:43:40,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-22 18:43:40,017 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:43:40,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708375747] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:43:40,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:43:40,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2024-11-22 18:43:40,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058093924] [2024-11-22 18:43:40,249 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:43:40,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 18:43:40,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:40,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 18:43:40,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=226, Unknown=1, NotChecked=30, Total=306 [2024-11-22 18:43:40,250 INFO L87 Difference]: Start difference. First operand 141 states and 154 transitions. Second operand has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:43:45,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:45,159 INFO L93 Difference]: Finished difference Result 305 states and 340 transitions. [2024-11-22 18:43:45,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-22 18:43:45,159 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (4), 3 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 33 [2024-11-22 18:43:45,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:45,161 INFO L225 Difference]: With dead ends: 305 [2024-11-22 18:43:45,161 INFO L226 Difference]: Without dead ends: 305 [2024-11-22 18:43:45,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=162, Invalid=710, Unknown=2, NotChecked=56, Total=930 [2024-11-22 18:43:45,162 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 266 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 250 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:45,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 637 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 759 Invalid, 0 Unknown, 250 Unchecked, 0.6s Time] [2024-11-22 18:43:45,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-22 18:43:45,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 217. [2024-11-22 18:43:45,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 177 states have (on average 1.4011299435028248) internal successors, (248), 206 states have internal predecessors, (248), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-22 18:43:45,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 262 transitions. [2024-11-22 18:43:45,170 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 262 transitions. Word has length 33 [2024-11-22 18:43:45,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:45,171 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 262 transitions. [2024-11-22 18:43:45,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:43:45,171 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 262 transitions. [2024-11-22 18:43:45,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-22 18:43:45,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:45,172 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:45,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 18:43:45,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:43:45,374 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:43:45,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:45,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1240813252, now seen corresponding path program 1 times [2024-11-22 18:43:45,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:45,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119697270] [2024-11-22 18:43:45,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:45,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:46,015 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:46,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:46,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119697270] [2024-11-22 18:43:46,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119697270] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:43:46,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010664735] [2024-11-22 18:43:46,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:46,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:43:46,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:43:46,019 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:43:46,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 18:43:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:46,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-22 18:43:46,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:43:46,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:43:46,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-22 18:43:46,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 18:43:46,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 18:43:46,366 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-22 18:43:46,367 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-11-22 18:43:46,370 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-11-22 18:43:46,418 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-11-22 18:43:46,432 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:46,433 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:43:46,765 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-11-22 18:43:46,779 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-11-22 18:43:46,782 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-11-22 18:43:46,993 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:46,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010664735] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:43:46,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:43:46,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 20 [2024-11-22 18:43:46,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169097604] [2024-11-22 18:43:46,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:43:46,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-22 18:43:46,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:46,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-22 18:43:46,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2024-11-22 18:43:46,995 INFO L87 Difference]: Start difference. First operand 217 states and 262 transitions. Second operand has 21 states, 20 states have (on average 5.2) internal successors, (104), 20 states have internal predecessors, (104), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:43:47,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:47,625 INFO L93 Difference]: Finished difference Result 226 states and 270 transitions. [2024-11-22 18:43:47,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 18:43:47,625 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.2) internal successors, (104), 20 states have internal predecessors, (104), 5 states have call successors, (5), 4 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 41 [2024-11-22 18:43:47,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:47,626 INFO L225 Difference]: With dead ends: 226 [2024-11-22 18:43:47,626 INFO L226 Difference]: Without dead ends: 226 [2024-11-22 18:43:47,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2024-11-22 18:43:47,627 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 211 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:47,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 732 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 18:43:47,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-22 18:43:47,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 223. [2024-11-22 18:43:47,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 182 states have (on average 1.3846153846153846) internal successors, (252), 212 states have internal predecessors, (252), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-22 18:43:47,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 266 transitions. [2024-11-22 18:43:47,632 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 266 transitions. Word has length 41 [2024-11-22 18:43:47,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:47,632 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 266 transitions. [2024-11-22 18:43:47,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.2) internal successors, (104), 20 states have internal predecessors, (104), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:43:47,632 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 266 transitions. [2024-11-22 18:43:47,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-22 18:43:47,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:47,633 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:47,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-22 18:43:47,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-22 18:43:47,837 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:43:47,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:47,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1240813253, now seen corresponding path program 1 times [2024-11-22 18:43:47,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:47,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94064738] [2024-11-22 18:43:47,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:47,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:48,287 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:48,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:48,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94064738] [2024-11-22 18:43:48,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94064738] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:43:48,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939217273] [2024-11-22 18:43:48,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:48,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:43:48,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:43:48,290 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:43:48,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 18:43:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:48,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-22 18:43:48,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:43:48,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:43:48,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 18:43:48,500 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2024-11-22 18:43:48,500 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 25 treesize of output 28 [2024-11-22 18:43:48,528 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-11-22 18:43:48,529 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:48,529 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:43:48,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2024-11-22 18:43:49,008 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:49,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939217273] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:43:49,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:43:49,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 17 [2024-11-22 18:43:49,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688457162] [2024-11-22 18:43:49,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:43:49,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-22 18:43:49,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:49,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-22 18:43:49,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-11-22 18:43:49,010 INFO L87 Difference]: Start difference. First operand 223 states and 266 transitions. Second operand has 18 states, 17 states have (on average 5.411764705882353) internal successors, (92), 17 states have internal predecessors, (92), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:43:49,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:49,404 INFO L93 Difference]: Finished difference Result 225 states and 269 transitions. [2024-11-22 18:43:49,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 18:43:49,405 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 5.411764705882353) internal successors, (92), 17 states have internal predecessors, (92), 5 states have call successors, (5), 4 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 41 [2024-11-22 18:43:49,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:49,405 INFO L225 Difference]: With dead ends: 225 [2024-11-22 18:43:49,406 INFO L226 Difference]: Without dead ends: 225 [2024-11-22 18:43:49,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2024-11-22 18:43:49,406 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 142 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:49,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 642 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:43:49,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-22 18:43:49,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2024-11-22 18:43:49,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 182 states have (on average 1.379120879120879) internal successors, (251), 212 states have internal predecessors, (251), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-22 18:43:49,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 265 transitions. [2024-11-22 18:43:49,412 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 265 transitions. Word has length 41 [2024-11-22 18:43:49,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:49,412 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 265 transitions. [2024-11-22 18:43:49,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.411764705882353) internal successors, (92), 17 states have internal predecessors, (92), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:43:49,413 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 265 transitions. [2024-11-22 18:43:49,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-22 18:43:49,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:49,413 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:49,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-22 18:43:49,613 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,SelfDestructingSolverStorable15 [2024-11-22 18:43:49,614 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:43:49,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:49,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1836513292, now seen corresponding path program 1 times [2024-11-22 18:43:49,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:49,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394816808] [2024-11-22 18:43:49,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:49,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:50,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:50,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:50,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394816808] [2024-11-22 18:43:50,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394816808] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:43:50,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008250109] [2024-11-22 18:43:50,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:50,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:43:50,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:43:50,155 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:43:50,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 18:43:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:50,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-22 18:43:50,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:43:50,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:43:50,292 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 18:43:50,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-22 18:43:50,297 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 11 treesize of output 7 [2024-11-22 18:43:50,301 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 11 treesize of output 7 [2024-11-22 18:43:50,309 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-11-22 18:43:50,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-22 18:43:50,564 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:50,564 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:43:50,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008250109] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:43:50,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:43:50,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 18 [2024-11-22 18:43:50,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343837467] [2024-11-22 18:43:50,670 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:43:50,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-22 18:43:50,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:50,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-22 18:43:50,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=281, Unknown=9, NotChecked=0, Total=342 [2024-11-22 18:43:50,671 INFO L87 Difference]: Start difference. First operand 223 states and 265 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:43:51,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:51,113 INFO L93 Difference]: Finished difference Result 304 states and 362 transitions. [2024-11-22 18:43:51,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-22 18:43:51,114 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2024-11-22 18:43:51,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:51,115 INFO L225 Difference]: With dead ends: 304 [2024-11-22 18:43:51,115 INFO L226 Difference]: Without dead ends: 304 [2024-11-22 18:43:51,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=523, Unknown=9, NotChecked=0, Total=650 [2024-11-22 18:43:51,116 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 232 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:51,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 630 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:43:51,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-22 18:43:51,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 235. [2024-11-22 18:43:51,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 192 states have (on average 1.359375) internal successors, (261), 222 states have internal predecessors, (261), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (10), 5 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-22 18:43:51,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 279 transitions. [2024-11-22 18:43:51,121 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 279 transitions. Word has length 42 [2024-11-22 18:43:51,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:51,121 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 279 transitions. [2024-11-22 18:43:51,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:43:51,121 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 279 transitions. [2024-11-22 18:43:51,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-22 18:43:51,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:51,122 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:51,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-22 18:43:51,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-22 18:43:51,326 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:43:51,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:51,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1591414825, now seen corresponding path program 1 times [2024-11-22 18:43:51,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:51,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163486349] [2024-11-22 18:43:51,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:51,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:52,213 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:52,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:52,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163486349] [2024-11-22 18:43:52,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163486349] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:43:52,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589804055] [2024-11-22 18:43:52,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:52,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:43:52,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:43:52,215 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:43:52,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-22 18:43:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:52,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-22 18:43:52,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:43:52,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:43:52,376 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 18:43:52,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-22 18:43:52,394 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 13 treesize of output 9 [2024-11-22 18:43:52,399 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 13 treesize of output 9 [2024-11-22 18:43:52,552 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 18 treesize of output 13 [2024-11-22 18:43:52,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-22 18:43:52,654 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-11-22 18:43:52,694 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:43:52,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:43:53,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589804055] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:43:53,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:43:53,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14] total 32 [2024-11-22 18:43:53,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323659721] [2024-11-22 18:43:53,596 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:43:53,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-22 18:43:53,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:53,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-22 18:43:53,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1033, Unknown=12, NotChecked=0, Total=1190 [2024-11-22 18:43:53,597 INFO L87 Difference]: Start difference. First operand 235 states and 279 transitions. Second operand has 32 states, 32 states have (on average 2.34375) internal successors, (75), 29 states have internal predecessors, (75), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:43:54,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:54,623 INFO L93 Difference]: Finished difference Result 323 states and 380 transitions. [2024-11-22 18:43:54,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-22 18:43:54,623 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.34375) internal successors, (75), 29 states have internal predecessors, (75), 4 states have call successors, (4), 3 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 44 [2024-11-22 18:43:54,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:54,624 INFO L225 Difference]: With dead ends: 323 [2024-11-22 18:43:54,624 INFO L226 Difference]: Without dead ends: 323 [2024-11-22 18:43:54,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=373, Invalid=1966, Unknown=13, NotChecked=0, Total=2352 [2024-11-22 18:43:54,626 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 273 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:54,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 978 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 18:43:54,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-22 18:43:54,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 238. [2024-11-22 18:43:54,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 194 states have (on average 1.3195876288659794) internal successors, (256), 225 states have internal predecessors, (256), 8 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (12), 5 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-22 18:43:54,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 276 transitions. [2024-11-22 18:43:54,631 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 276 transitions. Word has length 44 [2024-11-22 18:43:54,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:54,631 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 276 transitions. [2024-11-22 18:43:54,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.34375) internal successors, (75), 29 states have internal predecessors, (75), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:43:54,631 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 276 transitions. [2024-11-22 18:43:54,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-22 18:43:54,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:54,631 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-22 18:43:54,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-22 18:43:54,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:43:54,832 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:43:54,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:54,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1452710056, now seen corresponding path program 1 times [2024-11-22 18:43:54,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:54,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925480967] [2024-11-22 18:43:54,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:54,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:54,905 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-22 18:43:54,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:54,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925480967] [2024-11-22 18:43:54,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925480967] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:43:54,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22074979] [2024-11-22 18:43:54,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:54,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:43:54,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:43:54,908 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:43:54,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-22 18:43:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:55,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 18:43:55,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:43:55,062 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-22 18:43:55,063 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:43:55,081 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-22 18:43:55,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22074979] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:43:55,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:43:55,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-22 18:43:55,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547808900] [2024-11-22 18:43:55,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:43:55,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:43:55,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:55,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:43:55,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:43:55,084 INFO L87 Difference]: Start difference. First operand 238 states and 276 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-22 18:43:55,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:55,117 INFO L93 Difference]: Finished difference Result 284 states and 330 transitions. [2024-11-22 18:43:55,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:43:55,118 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 48 [2024-11-22 18:43:55,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:55,119 INFO L225 Difference]: With dead ends: 284 [2024-11-22 18:43:55,119 INFO L226 Difference]: Without dead ends: 284 [2024-11-22 18:43:55,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:43:55,120 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 71 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:55,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 216 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:43:55,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-22 18:43:55,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 274. [2024-11-22 18:43:55,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 226 states have (on average 1.3185840707964602) internal successors, (298), 255 states have internal predecessors, (298), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (20), 11 states have call predecessors, (20), 12 states have call successors, (20) [2024-11-22 18:43:55,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 330 transitions. [2024-11-22 18:43:55,129 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 330 transitions. Word has length 48 [2024-11-22 18:43:55,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:55,130 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 330 transitions. [2024-11-22 18:43:55,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-22 18:43:55,130 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 330 transitions. [2024-11-22 18:43:55,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-22 18:43:55,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:55,131 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:55,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-22 18:43:55,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:43:55,332 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:43:55,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:43:55,333 INFO L85 PathProgramCache]: Analyzing trace with hash 948068346, now seen corresponding path program 1 times [2024-11-22 18:43:55,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:43:55,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659801373] [2024-11-22 18:43:55,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:55,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:43:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:57,047 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:43:57,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:43:57,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659801373] [2024-11-22 18:43:57,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659801373] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:43:57,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044812967] [2024-11-22 18:43:57,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:43:57,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:43:57,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:43:57,049 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:43:57,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-22 18:43:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:43:57,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-22 18:43:57,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:43:57,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-22 18:43:57,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:43:57,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 18:43:57,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 18:43:57,386 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-22 18:43:57,386 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-11-22 18:43:57,389 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-11-22 18:43:57,441 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-11-22 18:43:57,469 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:43:57,469 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:43:57,822 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-11-22 18:43:57,825 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-11-22 18:43:57,845 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-11-22 18:43:58,047 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:43:58,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044812967] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:43:58,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:43:58,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 6, 6] total 41 [2024-11-22 18:43:58,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490031248] [2024-11-22 18:43:58,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:43:58,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-22 18:43:58,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:43:58,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-22 18:43:58,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1565, Unknown=0, NotChecked=0, Total=1722 [2024-11-22 18:43:58,049 INFO L87 Difference]: Start difference. First operand 274 states and 330 transitions. Second operand has 42 states, 41 states have (on average 3.341463414634146) internal successors, (137), 41 states have internal predecessors, (137), 6 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-22 18:43:59,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:43:59,852 INFO L93 Difference]: Finished difference Result 348 states and 399 transitions. [2024-11-22 18:43:59,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-22 18:43:59,853 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 3.341463414634146) internal successors, (137), 41 states have internal predecessors, (137), 6 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 60 [2024-11-22 18:43:59,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:43:59,854 INFO L225 Difference]: With dead ends: 348 [2024-11-22 18:43:59,854 INFO L226 Difference]: Without dead ends: 348 [2024-11-22 18:43:59,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=578, Invalid=3978, Unknown=0, NotChecked=0, Total=4556 [2024-11-22 18:43:59,855 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 443 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 2079 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 2133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:43:59,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1069 Invalid, 2133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2079 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-22 18:43:59,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-22 18:43:59,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 274. [2024-11-22 18:43:59,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 227 states have (on average 1.303964757709251) internal successors, (296), 255 states have internal predecessors, (296), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2024-11-22 18:43:59,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 322 transitions. [2024-11-22 18:43:59,861 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 322 transitions. Word has length 60 [2024-11-22 18:43:59,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:43:59,861 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 322 transitions. [2024-11-22 18:43:59,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.341463414634146) internal successors, (137), 41 states have internal predecessors, (137), 6 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-22 18:43:59,861 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 322 transitions. [2024-11-22 18:43:59,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-22 18:43:59,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:43:59,862 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:43:59,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-22 18:44:00,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:44:00,063 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:44:00,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:44:00,063 INFO L85 PathProgramCache]: Analyzing trace with hash 948068345, now seen corresponding path program 1 times [2024-11-22 18:44:00,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:44:00,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078007606] [2024-11-22 18:44:00,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:44:00,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:44:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:44:00,516 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:44:00,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:44:00,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078007606] [2024-11-22 18:44:00,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078007606] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:44:00,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34514849] [2024-11-22 18:44:00,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:44:00,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:44:00,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:44:00,518 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:44:00,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-22 18:44:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:44:00,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-22 18:44:00,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:44:00,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:44:00,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 18:44:00,747 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2024-11-22 18:44:00,748 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 25 treesize of output 28 [2024-11-22 18:44:00,771 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-11-22 18:44:00,772 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:44:00,772 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:44:00,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2024-11-22 18:44:01,184 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:44:01,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34514849] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:44:01,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:44:01,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 19 [2024-11-22 18:44:01,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555228047] [2024-11-22 18:44:01,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:44:01,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-22 18:44:01,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:44:01,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-22 18:44:01,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-11-22 18:44:01,185 INFO L87 Difference]: Start difference. First operand 274 states and 322 transitions. Second operand has 20 states, 19 states have (on average 5.894736842105263) internal successors, (112), 19 states have internal predecessors, (112), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-22 18:44:01,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:44:01,684 INFO L93 Difference]: Finished difference Result 306 states and 356 transitions. [2024-11-22 18:44:01,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 18:44:01,685 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 5.894736842105263) internal successors, (112), 19 states have internal predecessors, (112), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 60 [2024-11-22 18:44:01,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:44:01,686 INFO L225 Difference]: With dead ends: 306 [2024-11-22 18:44:01,686 INFO L226 Difference]: Without dead ends: 306 [2024-11-22 18:44:01,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2024-11-22 18:44:01,686 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 241 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:44:01,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 712 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 18:44:01,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-22 18:44:01,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 273. [2024-11-22 18:44:01,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 227 states have (on average 1.2951541850220265) internal successors, (294), 254 states have internal predecessors, (294), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2024-11-22 18:44:01,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 320 transitions. [2024-11-22 18:44:01,691 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 320 transitions. Word has length 60 [2024-11-22 18:44:01,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:44:01,691 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 320 transitions. [2024-11-22 18:44:01,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.894736842105263) internal successors, (112), 19 states have internal predecessors, (112), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-22 18:44:01,691 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 320 transitions. [2024-11-22 18:44:01,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-22 18:44:01,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:44:01,692 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:44:01,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-22 18:44:01,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-22 18:44:01,893 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:44:01,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:44:01,893 INFO L85 PathProgramCache]: Analyzing trace with hash 104187406, now seen corresponding path program 1 times [2024-11-22 18:44:01,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:44:01,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096482380] [2024-11-22 18:44:01,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:44:01,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:44:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:44:01,941 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-22 18:44:01,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:44:01,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096482380] [2024-11-22 18:44:01,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096482380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:44:01,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551823632] [2024-11-22 18:44:01,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:44:01,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:44:01,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:44:01,944 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:44:01,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-22 18:44:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:44:02,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 18:44:02,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:44:02,118 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-22 18:44:02,118 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:44:02,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551823632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:44:02,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 18:44:02,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2024-11-22 18:44:02,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580868125] [2024-11-22 18:44:02,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:44:02,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:44:02,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:44:02,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:44:02,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:44:02,119 INFO L87 Difference]: Start difference. First operand 273 states and 320 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:44:02,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:44:02,129 INFO L93 Difference]: Finished difference Result 267 states and 312 transitions. [2024-11-22 18:44:02,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:44:02,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2024-11-22 18:44:02,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:44:02,131 INFO L225 Difference]: With dead ends: 267 [2024-11-22 18:44:02,131 INFO L226 Difference]: Without dead ends: 267 [2024-11-22 18:44:02,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:44:02,132 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:44:02,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 195 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:44:02,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-22 18:44:02,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2024-11-22 18:44:02,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 222 states have (on average 1.2882882882882882) internal successors, (286), 248 states have internal predecessors, (286), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2024-11-22 18:44:02,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 312 transitions. [2024-11-22 18:44:02,138 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 312 transitions. Word has length 67 [2024-11-22 18:44:02,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:44:02,138 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 312 transitions. [2024-11-22 18:44:02,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:44:02,138 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 312 transitions. [2024-11-22 18:44:02,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-22 18:44:02,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:44:02,139 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-22 18:44:02,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-22 18:44:02,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-22 18:44:02,340 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:44:02,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:44:02,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1345239894, now seen corresponding path program 1 times [2024-11-22 18:44:02,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:44:02,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967784140] [2024-11-22 18:44:02,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:44:02,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:44:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:44:02,650 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-22 18:44:02,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:44:02,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967784140] [2024-11-22 18:44:02,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967784140] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:44:02,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013594673] [2024-11-22 18:44:02,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:44:02,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:44:02,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:44:02,651 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:44:02,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-22 18:44:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:44:02,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-22 18:44:02,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:44:02,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:44:02,956 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 16 treesize of output 11 [2024-11-22 18:44:02,960 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 18:44:02,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-22 18:44:02,974 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-22 18:44:02,974 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:44:03,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2024-11-22 18:44:03,130 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-11-22 18:44:03,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 49 [2024-11-22 18:44:03,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:44:03,233 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 29 treesize of output 33 [2024-11-22 18:44:03,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:44:03,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 76 [2024-11-22 18:44:03,396 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-22 18:44:03,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013594673] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:44:03,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:44:03,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2024-11-22 18:44:03,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470668713] [2024-11-22 18:44:03,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:44:03,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-22 18:44:03,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:44:03,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-22 18:44:03,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2024-11-22 18:44:03,398 INFO L87 Difference]: Start difference. First operand 267 states and 312 transitions. Second operand has 23 states, 22 states have (on average 4.818181818181818) internal successors, (106), 20 states have internal predecessors, (106), 5 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 18:44:03,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:44:03,770 INFO L93 Difference]: Finished difference Result 287 states and 329 transitions. [2024-11-22 18:44:03,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 18:44:03,770 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.818181818181818) internal successors, (106), 20 states have internal predecessors, (106), 5 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2024-11-22 18:44:03,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:44:03,771 INFO L225 Difference]: With dead ends: 287 [2024-11-22 18:44:03,771 INFO L226 Difference]: Without dead ends: 287 [2024-11-22 18:44:03,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2024-11-22 18:44:03,772 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 313 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:44:03,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 611 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:44:03,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-22 18:44:03,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 264. [2024-11-22 18:44:03,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 220 states have (on average 1.2727272727272727) internal successors, (280), 245 states have internal predecessors, (280), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2024-11-22 18:44:03,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 306 transitions. [2024-11-22 18:44:03,776 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 306 transitions. Word has length 72 [2024-11-22 18:44:03,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:44:03,776 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 306 transitions. [2024-11-22 18:44:03,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.818181818181818) internal successors, (106), 20 states have internal predecessors, (106), 5 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 18:44:03,776 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 306 transitions. [2024-11-22 18:44:03,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-22 18:44:03,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:44:03,777 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2024-11-22 18:44:03,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-22 18:44:03,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-22 18:44:03,979 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:44:03,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:44:03,980 INFO L85 PathProgramCache]: Analyzing trace with hash -2134387814, now seen corresponding path program 1 times [2024-11-22 18:44:03,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:44:03,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049919091] [2024-11-22 18:44:03,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:44:03,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:44:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:44:04,437 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 24 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-22 18:44:04,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:44:04,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049919091] [2024-11-22 18:44:04,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049919091] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:44:04,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907560387] [2024-11-22 18:44:04,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:44:04,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:44:04,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:44:04,439 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:44:04,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-22 18:44:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:44:04,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-22 18:44:04,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:44:04,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 18:44:04,796 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 18:44:04,796 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:44:04,906 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-11-22 18:44:04,957 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 18:44:04,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907560387] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:44:04,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:44:04,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 22 [2024-11-22 18:44:04,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091063065] [2024-11-22 18:44:04,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:44:04,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-22 18:44:04,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:44:04,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-22 18:44:04,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2024-11-22 18:44:04,958 INFO L87 Difference]: Start difference. First operand 264 states and 306 transitions. Second operand has 22 states, 22 states have (on average 4.863636363636363) internal successors, (107), 20 states have internal predecessors, (107), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-22 18:44:05,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:44:05,393 INFO L93 Difference]: Finished difference Result 279 states and 326 transitions. [2024-11-22 18:44:05,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-22 18:44:05,393 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.863636363636363) internal successors, (107), 20 states have internal predecessors, (107), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 73 [2024-11-22 18:44:05,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:44:05,394 INFO L225 Difference]: With dead ends: 279 [2024-11-22 18:44:05,394 INFO L226 Difference]: Without dead ends: 279 [2024-11-22 18:44:05,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=299, Invalid=1341, Unknown=0, NotChecked=0, Total=1640 [2024-11-22 18:44:05,395 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 51 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:44:05,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 963 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:44:05,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-22 18:44:05,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 255. [2024-11-22 18:44:05,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 212 states have (on average 1.2735849056603774) internal successors, (270), 236 states have internal predecessors, (270), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-22 18:44:05,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 294 transitions. [2024-11-22 18:44:05,400 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 294 transitions. Word has length 73 [2024-11-22 18:44:05,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:44:05,400 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 294 transitions. [2024-11-22 18:44:05,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.863636363636363) internal successors, (107), 20 states have internal predecessors, (107), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-22 18:44:05,400 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 294 transitions. [2024-11-22 18:44:05,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-22 18:44:05,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:44:05,401 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:44:05,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-22 18:44:05,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-22 18:44:05,602 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:44:05,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:44:05,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1959490770, now seen corresponding path program 2 times [2024-11-22 18:44:05,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:44:05,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782021863] [2024-11-22 18:44:05,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:44:05,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:44:05,647 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:44:05,647 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:44:06,226 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-22 18:44:06,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:44:06,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782021863] [2024-11-22 18:44:06,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782021863] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:44:06,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825075930] [2024-11-22 18:44:06,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:44:06,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:44:06,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:44:06,229 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:44:06,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-22 18:44:06,454 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:44:06,454 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:44:06,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-22 18:44:06,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:44:06,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:44:06,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-22 18:44:06,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:44:06,625 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 53 treesize of output 36 [2024-11-22 18:44:06,690 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2024-11-22 18:44:06,690 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 29 treesize of output 33 [2024-11-22 18:44:06,702 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 26 treesize of output 9 [2024-11-22 18:44:06,917 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-11-22 18:44:06,917 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 26 treesize of output 19 [2024-11-22 18:44:06,924 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 54 treesize of output 20 [2024-11-22 18:44:06,937 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-11-22 18:44:06,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2024-11-22 18:44:07,097 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-22 18:44:07,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-22 18:44:07,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:44:07,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-11-22 18:44:07,219 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-11-22 18:44:07,219 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 3 case distinctions, treesize of input 26 treesize of output 38 [2024-11-22 18:44:07,316 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:44:07,316 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:44:07,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825075930] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:44:07,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:44:07,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 28 [2024-11-22 18:44:07,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819807867] [2024-11-22 18:44:07,588 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:44:07,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-22 18:44:07,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:44:07,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-22 18:44:07,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=877, Unknown=0, NotChecked=0, Total=992 [2024-11-22 18:44:07,589 INFO L87 Difference]: Start difference. First operand 255 states and 294 transitions. Second operand has 29 states, 28 states have (on average 4.464285714285714) internal successors, (125), 24 states have internal predecessors, (125), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:44:11,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:44:12,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:44:12,789 INFO L93 Difference]: Finished difference Result 293 states and 336 transitions. [2024-11-22 18:44:12,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-22 18:44:12,790 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.464285714285714) internal successors, (125), 24 states have internal predecessors, (125), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 75 [2024-11-22 18:44:12,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:44:12,791 INFO L225 Difference]: With dead ends: 293 [2024-11-22 18:44:12,791 INFO L226 Difference]: Without dead ends: 293 [2024-11-22 18:44:12,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=310, Invalid=2140, Unknown=0, NotChecked=0, Total=2450 [2024-11-22 18:44:12,792 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 390 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 48 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-22 18:44:12,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1054 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1098 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2024-11-22 18:44:12,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-22 18:44:12,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 167. [2024-11-22 18:44:12,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 136 states have (on average 1.2720588235294117) internal successors, (173), 157 states have internal predecessors, (173), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 18:44:12,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 185 transitions. [2024-11-22 18:44:12,795 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 185 transitions. Word has length 75 [2024-11-22 18:44:12,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:44:12,796 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 185 transitions. [2024-11-22 18:44:12,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.464285714285714) internal successors, (125), 24 states have internal predecessors, (125), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:44:12,796 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 185 transitions. [2024-11-22 18:44:12,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-22 18:44:12,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:44:12,797 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:44:12,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-22 18:44:12,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:44:12,997 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:44:12,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:44:12,998 INFO L85 PathProgramCache]: Analyzing trace with hash -850577045, now seen corresponding path program 1 times [2024-11-22 18:44:12,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:44:12,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536652934] [2024-11-22 18:44:12,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:44:12,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:44:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:44:13,447 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 46 proven. 67 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-22 18:44:13,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:44:13,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536652934] [2024-11-22 18:44:13,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536652934] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:44:13,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734289601] [2024-11-22 18:44:13,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:44:13,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:44:13,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:44:13,449 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:44:13,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-22 18:44:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:44:13,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 18:44:13,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:44:13,728 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-11-22 18:44:13,728 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:44:13,793 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-11-22 18:44:13,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734289601] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:44:13,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:44:13,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 19 [2024-11-22 18:44:13,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753863005] [2024-11-22 18:44:13,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:44:13,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-22 18:44:13,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:44:13,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-22 18:44:13,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2024-11-22 18:44:13,796 INFO L87 Difference]: Start difference. First operand 167 states and 185 transitions. Second operand has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 18 states have internal predecessors, (80), 8 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-22 18:44:14,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:44:14,123 INFO L93 Difference]: Finished difference Result 202 states and 210 transitions. [2024-11-22 18:44:14,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-22 18:44:14,124 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 18 states have internal predecessors, (80), 8 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 102 [2024-11-22 18:44:14,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:44:14,125 INFO L225 Difference]: With dead ends: 202 [2024-11-22 18:44:14,125 INFO L226 Difference]: Without dead ends: 202 [2024-11-22 18:44:14,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 203 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=995, Unknown=0, NotChecked=0, Total=1190 [2024-11-22 18:44:14,125 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 243 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:44:14,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 640 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:44:14,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-22 18:44:14,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 182. [2024-11-22 18:44:14,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 149 states have (on average 1.3020134228187918) internal successors, (194), 170 states have internal predecessors, (194), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 18:44:14,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 210 transitions. [2024-11-22 18:44:14,129 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 210 transitions. Word has length 102 [2024-11-22 18:44:14,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:44:14,129 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 210 transitions. [2024-11-22 18:44:14,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 18 states have internal predecessors, (80), 8 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-22 18:44:14,129 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 210 transitions. [2024-11-22 18:44:14,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-22 18:44:14,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:44:14,130 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:44:14,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-22 18:44:14,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-22 18:44:14,330 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:44:14,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:44:14,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1160568941, now seen corresponding path program 1 times [2024-11-22 18:44:14,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:44:14,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889303708] [2024-11-22 18:44:14,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:44:14,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:44:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:44:15,635 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 12 proven. 251 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-22 18:44:15,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:44:15,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889303708] [2024-11-22 18:44:15,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889303708] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:44:15,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131637630] [2024-11-22 18:44:15,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:44:15,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:44:15,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:44:15,637 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:44:15,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-22 18:44:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:44:15,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 1193 conjuncts, 153 conjuncts are in the unsatisfiable core [2024-11-22 18:44:15,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:44:16,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 18:44:16,225 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2024-11-22 18:44:16,225 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 29 treesize of output 33 [2024-11-22 18:44:16,232 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 26 treesize of output 9 [2024-11-22 18:44:16,521 INFO L349 Elim1Store]: treesize reduction 78, result has 35.5 percent of original size [2024-11-22 18:44:16,521 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 40 treesize of output 63 [2024-11-22 18:44:16,527 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 57 treesize of output 20 [2024-11-22 18:44:16,535 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 26 treesize of output 9 [2024-11-22 18:44:16,841 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-11-22 18:44:16,841 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 26 treesize of output 19 [2024-11-22 18:44:16,852 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:44:16,877 INFO L349 Elim1Store]: treesize reduction 91, result has 34.1 percent of original size [2024-11-22 18:44:16,877 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 45 treesize of output 70 [2024-11-22 18:44:16,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 24 [2024-11-22 18:44:17,170 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (store |c_old(#length)| append_~node~0.base (select |c_#length| append_~node~0.base)) |c_#length|) (= (select |c_old(#valid)| append_~node~0.base) 0))) is different from true [2024-11-22 18:44:17,191 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 42 treesize of output 18 [2024-11-22 18:44:17,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:44:17,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-22 18:44:17,214 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2024-11-22 18:44:17,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2024-11-22 18:44:17,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 18:44:17,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 18:44:17,353 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-11-22 18:44:17,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 26 treesize of output 19 [2024-11-22 18:44:17,686 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 35 treesize of output 23 [2024-11-22 18:44:17,689 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-11-22 18:44:17,699 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-22 18:44:17,699 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 17 [2024-11-22 18:44:17,756 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 62 proven. 221 refuted. 0 times theorem prover too weak. 13 trivial. 24 not checked. [2024-11-22 18:44:17,756 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:44:17,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131637630] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:44:17,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:44:17,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 33] total 46 [2024-11-22 18:44:17,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772254510] [2024-11-22 18:44:17,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:44:17,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-22 18:44:17,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:44:17,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-22 18:44:17,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=2012, Unknown=1, NotChecked=92, Total=2352 [2024-11-22 18:44:17,939 INFO L87 Difference]: Start difference. First operand 182 states and 210 transitions. Second operand has 47 states, 46 states have (on average 4.586956521739131) internal successors, (211), 43 states have internal predecessors, (211), 8 states have call successors, (8), 5 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2024-11-22 18:44:21,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:44:25,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:44:30,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:44:34,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:44:38,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:44:39,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:44:39,183 INFO L93 Difference]: Finished difference Result 219 states and 251 transitions. [2024-11-22 18:44:39,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-22 18:44:39,184 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 4.586956521739131) internal successors, (211), 43 states have internal predecessors, (211), 8 states have call successors, (8), 5 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) Word has length 148 [2024-11-22 18:44:39,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:44:39,185 INFO L225 Difference]: With dead ends: 219 [2024-11-22 18:44:39,185 INFO L226 Difference]: Without dead ends: 219 [2024-11-22 18:44:39,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1476 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=575, Invalid=3984, Unknown=1, NotChecked=132, Total=4692 [2024-11-22 18:44:39,186 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 410 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 31 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 162 IncrementalHoareTripleChecker+Unchecked, 20.6s IncrementalHoareTripleChecker+Time [2024-11-22 18:44:39,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 918 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 845 Invalid, 5 Unknown, 162 Unchecked, 20.6s Time] [2024-11-22 18:44:39,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-22 18:44:39,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 181. [2024-11-22 18:44:39,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 149 states have (on average 1.2953020134228188) internal successors, (193), 169 states have internal predecessors, (193), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 18:44:39,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 209 transitions. [2024-11-22 18:44:39,190 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 209 transitions. Word has length 148 [2024-11-22 18:44:39,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:44:39,191 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 209 transitions. [2024-11-22 18:44:39,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 4.586956521739131) internal successors, (211), 43 states have internal predecessors, (211), 8 states have call successors, (8), 5 states have call predecessors, (8), 12 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2024-11-22 18:44:39,191 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 209 transitions. [2024-11-22 18:44:39,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-22 18:44:39,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:44:39,194 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:44:39,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-22 18:44:39,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-22 18:44:39,394 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:44:39,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:44:39,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1384744403, now seen corresponding path program 1 times [2024-11-22 18:44:39,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:44:39,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649524825] [2024-11-22 18:44:39,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:44:39,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:44:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:44:41,146 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 6 proven. 105 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2024-11-22 18:44:41,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:44:41,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649524825] [2024-11-22 18:44:41,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649524825] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:44:41,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015307521] [2024-11-22 18:44:41,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:44:41,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:44:41,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:44:41,148 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:44:41,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-22 18:44:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:44:41,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 1205 conjuncts, 159 conjuncts are in the unsatisfiable core [2024-11-22 18:44:41,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:44:41,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:44:41,481 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 18:44:41,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-22 18:44:41,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:44:41,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:44:41,521 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 22 [2024-11-22 18:44:41,667 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2024-11-22 18:44:41,705 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-11-22 18:44:41,705 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 30 treesize of output 27 [2024-11-22 18:44:41,708 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 45 treesize of output 34 [2024-11-22 18:44:41,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:44:41,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 67 treesize of output 34 [2024-11-22 18:44:41,939 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-11-22 18:44:41,940 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 38 treesize of output 35 [2024-11-22 18:44:42,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:44:42,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 67 treesize of output 34 [2024-11-22 18:44:42,127 INFO L349 Elim1Store]: treesize reduction 60, result has 48.7 percent of original size [2024-11-22 18:44:42,128 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 3 case distinctions, treesize of input 47 treesize of output 73 [2024-11-22 18:44:42,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:44:42,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 67 treesize of output 34 [2024-11-22 18:44:42,306 INFO L349 Elim1Store]: treesize reduction 56, result has 47.7 percent of original size [2024-11-22 18:44:42,306 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 3 case distinctions, treesize of input 43 treesize of output 65 [2024-11-22 18:44:42,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:44:42,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 67 treesize of output 34 [2024-11-22 18:44:42,514 INFO L349 Elim1Store]: treesize reduction 60, result has 48.7 percent of original size [2024-11-22 18:44:42,514 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 3 case distinctions, treesize of input 47 treesize of output 73 [2024-11-22 18:44:42,782 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 56 treesize of output 41 [2024-11-22 18:44:42,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2024-11-22 18:44:42,806 INFO L349 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2024-11-22 18:44:42,806 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 3 case distinctions, treesize of input 29 treesize of output 54 [2024-11-22 18:44:42,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:44:42,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 39 [2024-11-22 18:44:42,940 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 30 proven. 141 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-11-22 18:44:42,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:44:42,991 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4594 (Array Int Int)) (v_append_~node~0.base_134 Int)) (let ((.cse0 (store |c_#valid| v_append_~node~0.base_134 1))) (or (not (= (select .cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list2~0#1.base|) (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) 1)) (= (select .cse0 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list2~0#1.base| v_ArrVal_4594) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) 1)))) is different from false [2024-11-22 18:44:42,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015307521] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:44:42,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:44:42,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25] total 36 [2024-11-22 18:44:42,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935046125] [2024-11-22 18:44:42,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:44:42,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-22 18:44:42,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:44:42,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-22 18:44:42,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1214, Unknown=1, NotChecked=70, Total=1406 [2024-11-22 18:44:42,994 INFO L87 Difference]: Start difference. First operand 181 states and 209 transitions. Second operand has 37 states, 36 states have (on average 3.4722222222222223) internal successors, (125), 36 states have internal predecessors, (125), 5 states have call successors, (5), 2 states have call predecessors, (5), 7 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-22 18:44:44,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:44:44,403 INFO L93 Difference]: Finished difference Result 274 states and 307 transitions. [2024-11-22 18:44:44,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-22 18:44:44,403 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.4722222222222223) internal successors, (125), 36 states have internal predecessors, (125), 5 states have call successors, (5), 2 states have call predecessors, (5), 7 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 150 [2024-11-22 18:44:44,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:44:44,404 INFO L225 Difference]: With dead ends: 274 [2024-11-22 18:44:44,404 INFO L226 Difference]: Without dead ends: 274 [2024-11-22 18:44:44,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 156 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=474, Invalid=3435, Unknown=1, NotChecked=122, Total=4032 [2024-11-22 18:44:44,406 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 472 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 18:44:44,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 839 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1167 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 18:44:44,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-22 18:44:44,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 179. [2024-11-22 18:44:44,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 150 states have (on average 1.2466666666666666) internal successors, (187), 167 states have internal predecessors, (187), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 18:44:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 203 transitions. [2024-11-22 18:44:44,411 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 203 transitions. Word has length 150 [2024-11-22 18:44:44,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:44:44,411 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 203 transitions. [2024-11-22 18:44:44,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.4722222222222223) internal successors, (125), 36 states have internal predecessors, (125), 5 states have call successors, (5), 2 states have call predecessors, (5), 7 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-22 18:44:44,411 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 203 transitions. [2024-11-22 18:44:44,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-22 18:44:44,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:44:44,412 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:44:44,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-22 18:44:44,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-22 18:44:44,613 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:44:44,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:44:44,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1384744404, now seen corresponding path program 1 times [2024-11-22 18:44:44,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:44:44,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729377476] [2024-11-22 18:44:44,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:44:44,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:44:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:44:47,385 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 6 proven. 214 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-22 18:44:47,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:44:47,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729377476] [2024-11-22 18:44:47,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729377476] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:44:47,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491098941] [2024-11-22 18:44:47,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:44:47,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:44:47,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:44:47,386 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:44:47,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-22 18:44:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:44:47,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 1205 conjuncts, 195 conjuncts are in the unsatisfiable core [2024-11-22 18:44:47,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:44:47,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:44:47,740 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 18:44:47,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-22 18:44:47,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-22 18:44:47,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:44:47,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:44:47,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:44:47,847 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 36 treesize of output 27 [2024-11-22 18:44:47,854 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-11-22 18:44:48,184 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2024-11-22 18:44:48,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:44:48,250 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 32 treesize of output 15 [2024-11-22 18:44:48,263 INFO L349 Elim1Store]: treesize reduction 48, result has 36.8 percent of original size [2024-11-22 18:44:48,263 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 35 treesize of output 45 [2024-11-22 18:44:48,267 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 60 treesize of output 47 [2024-11-22 18:44:48,277 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 25 treesize of output 18 [2024-11-22 18:44:48,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:44:48,634 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 32 treesize of output 15 [2024-11-22 18:44:48,662 INFO L349 Elim1Store]: treesize reduction 96, result has 36.4 percent of original size [2024-11-22 18:44:48,663 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 46 treesize of output 75 [2024-11-22 18:44:48,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:44:48,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 114 treesize of output 59 [2024-11-22 18:44:48,687 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 25 treesize of output 18 [2024-11-22 18:44:49,109 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 25 treesize of output 18 [2024-11-22 18:44:49,115 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 83 treesize of output 62 [2024-11-22 18:44:49,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-11-22 18:44:49,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:44:49,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-22 18:44:49,139 INFO L349 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2024-11-22 18:44:49,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 29 [2024-11-22 18:44:49,391 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 25 treesize of output 18 [2024-11-22 18:44:49,412 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-11-22 18:44:49,412 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 30 treesize of output 27 [2024-11-22 18:44:49,417 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 56 treesize of output 35 [2024-11-22 18:44:49,764 INFO L349 Elim1Store]: treesize reduction 68, result has 50.4 percent of original size [2024-11-22 18:44:49,764 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 3 case distinctions, treesize of input 41 treesize of output 75 [2024-11-22 18:44:49,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:44:49,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 101 treesize of output 58 [2024-11-22 18:44:49,796 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 36 treesize of output 23 [2024-11-22 18:44:50,284 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 64 treesize of output 49 [2024-11-22 18:44:50,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2024-11-22 18:44:50,293 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 47 treesize of output 36 [2024-11-22 18:44:50,306 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-22 18:44:50,306 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 26 treesize of output 29 [2024-11-22 18:44:50,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-22 18:44:50,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2024-11-22 18:44:50,420 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 20 proven. 289 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-22 18:44:50,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:44:50,629 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse3)) (.cse2 (+ 9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse3)))) (and (forall ((v_ArrVal_5142 Int)) (or (forall ((v_append_~node~0.base_140 Int)) (let ((.cse0 (store |c_#length| v_append_~node~0.base_140 v_ArrVal_5142))) (or (< (select .cse0 .cse1) .cse2) (forall ((v_ArrVal_5141 (Array Int Int)) (v_ArrVal_5140 (Array Int Int))) (<= (+ 9 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~list2~0#1.base| v_ArrVal_5141) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select .cse0 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list2~0#1.base| v_ArrVal_5140) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (< v_ArrVal_5142 9))) (or (forall ((v_ArrVal_5141 (Array Int Int))) (<= 0 (+ 5 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~list2~0#1.base| v_ArrVal_5141) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (forall ((v_append_~node~0.base_140 Int) (v_ArrVal_5142 Int)) (or (< (select (store |c_#length| v_append_~node~0.base_140 v_ArrVal_5142) .cse1) .cse2) (< v_ArrVal_5142 9))))))) is different from false [2024-11-22 18:44:50,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491098941] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:44:50,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:44:50,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 36] total 53 [2024-11-22 18:44:50,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421757487] [2024-11-22 18:44:50,631 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:44:50,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-22 18:44:50,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:44:50,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-22 18:44:50,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=2942, Unknown=1, NotChecked=110, Total=3306 [2024-11-22 18:44:50,633 INFO L87 Difference]: Start difference. First operand 179 states and 203 transitions. Second operand has 54 states, 53 states have (on average 4.018867924528302) internal successors, (213), 52 states have internal predecessors, (213), 11 states have call successors, (11), 3 states have call predecessors, (11), 11 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-22 18:44:53,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:44:53,466 INFO L93 Difference]: Finished difference Result 339 states and 383 transitions. [2024-11-22 18:44:53,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-22 18:44:53,466 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 4.018867924528302) internal successors, (213), 52 states have internal predecessors, (213), 11 states have call successors, (11), 3 states have call predecessors, (11), 11 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 150 [2024-11-22 18:44:53,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:44:53,467 INFO L225 Difference]: With dead ends: 339 [2024-11-22 18:44:53,467 INFO L226 Difference]: Without dead ends: 339 [2024-11-22 18:44:53,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2175 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=800, Invalid=6685, Unknown=1, NotChecked=170, Total=7656 [2024-11-22 18:44:53,469 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 720 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 1661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:44:53,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 1351 Invalid, 1661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1619 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-22 18:44:53,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-11-22 18:44:53,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 180. [2024-11-22 18:44:53,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 152 states have (on average 1.230263157894737) internal successors, (187), 168 states have internal predecessors, (187), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 18:44:53,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 203 transitions. [2024-11-22 18:44:53,472 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 203 transitions. Word has length 150 [2024-11-22 18:44:53,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:44:53,473 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 203 transitions. [2024-11-22 18:44:53,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 4.018867924528302) internal successors, (213), 52 states have internal predecessors, (213), 11 states have call successors, (11), 3 states have call predecessors, (11), 11 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-22 18:44:53,473 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 203 transitions. [2024-11-22 18:44:53,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-22 18:44:53,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:44:53,474 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 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] [2024-11-22 18:44:53,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-22 18:44:53,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-22 18:44:53,675 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:44:53,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:44:53,675 INFO L85 PathProgramCache]: Analyzing trace with hash 959334360, now seen corresponding path program 1 times [2024-11-22 18:44:53,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:44:53,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386309438] [2024-11-22 18:44:53,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:44:53,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:44:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:44:54,204 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2024-11-22 18:44:54,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:44:54,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386309438] [2024-11-22 18:44:54,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386309438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:44:54,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:44:54,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:44:54,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075128703] [2024-11-22 18:44:54,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:44:54,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:44:54,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:44:54,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:44:54,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:44:54,205 INFO L87 Difference]: Start difference. First operand 180 states and 203 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 18:44:54,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:44:54,278 INFO L93 Difference]: Finished difference Result 179 states and 201 transitions. [2024-11-22 18:44:54,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:44:54,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 155 [2024-11-22 18:44:54,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:44:54,279 INFO L225 Difference]: With dead ends: 179 [2024-11-22 18:44:54,279 INFO L226 Difference]: Without dead ends: 179 [2024-11-22 18:44:54,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:44:54,280 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 84 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:44:54,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 113 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:44:54,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-22 18:44:54,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-11-22 18:44:54,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 151 states have (on average 1.2251655629139073) internal successors, (185), 167 states have internal predecessors, (185), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 18:44:54,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 201 transitions. [2024-11-22 18:44:54,283 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 201 transitions. Word has length 155 [2024-11-22 18:44:54,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:44:54,283 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 201 transitions. [2024-11-22 18:44:54,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 18:44:54,283 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 201 transitions. [2024-11-22 18:44:54,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-22 18:44:54,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:44:54,284 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 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-11-22 18:44:54,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-22 18:44:54,284 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:44:54,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:44:54,284 INFO L85 PathProgramCache]: Analyzing trace with hash -323958977, now seen corresponding path program 1 times [2024-11-22 18:44:54,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:44:54,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377554818] [2024-11-22 18:44:54,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:44:54,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:44:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:44:55,218 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 6 proven. 64 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-22 18:44:55,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:44:55,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377554818] [2024-11-22 18:44:55,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377554818] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:44:55,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899626141] [2024-11-22 18:44:55,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:44:55,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:44:55,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:44:55,220 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:44:55,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-22 18:44:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:44:55,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 1232 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-22 18:44:55,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:44:55,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:44:55,574 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 18:44:55,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-22 18:44:55,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 18:44:55,630 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 33 treesize of output 17 [2024-11-22 18:44:55,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:44:55,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2024-11-22 18:44:55,746 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_65| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_65| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse1 (select .cse0 .cse3)) (.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_65| |c_#memory_$Pointer$#2.base|))) (and (<= (select .cse0 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse1) (= |c_#memory_$Pointer$#2.base| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_65| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2))) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse2))))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse4 (select .cse5 .cse3))) (and (<= (+ .cse4 1) |c_#StackHeapBarrier|) (<= (select .cse5 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse4)))))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|))) is different from false [2024-11-22 18:44:55,748 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_65| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_65| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse1 (select .cse0 .cse3)) (.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_65| |c_#memory_$Pointer$#2.base|))) (and (<= (select .cse0 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse1) (= |c_#memory_$Pointer$#2.base| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_65| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2))) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse2))))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse4 (select .cse5 .cse3))) (and (<= (+ .cse4 1) |c_#StackHeapBarrier|) (<= (select .cse5 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse4)))))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|))) is different from true [2024-11-22 18:44:55,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:44:55,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2024-11-22 18:44:55,819 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_66| (Array Int (Array Int Int)))) (let ((.cse1 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_66| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse2 (select .cse1 .cse3)) (.cse0 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_66| |c_#memory_$Pointer$#2.base|))) (and (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse0) (<= (select .cse1 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse2) (<= (+ .cse2 1) |c_#StackHeapBarrier|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_66| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|))))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse4 (select .cse5 .cse3))) (and (<= (+ .cse4 1) |c_#StackHeapBarrier|) (<= (select .cse5 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse4)))))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|))) is different from false [2024-11-22 18:44:55,821 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_66| (Array Int (Array Int Int)))) (let ((.cse1 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_66| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse2 (select .cse1 .cse3)) (.cse0 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_66| |c_#memory_$Pointer$#2.base|))) (and (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse0) (<= (select .cse1 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse2) (<= (+ .cse2 1) |c_#StackHeapBarrier|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_66| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|))))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse4 (select .cse5 .cse3))) (and (<= (+ .cse4 1) |c_#StackHeapBarrier|) (<= (select .cse5 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse4)))))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|))) is different from true [2024-11-22 18:44:55,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:44:55,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2024-11-22 18:44:55,905 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_67| (Array Int (Array Int Int)))) (let ((.cse2 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_67| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse1 (select .cse2 .cse3)) (.cse0 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_67| |c_#memory_$Pointer$#2.base|))) (and (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse0) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (<= (select .cse2 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_67| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|))))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse4 (select .cse5 .cse3))) (and (<= (+ .cse4 1) |c_#StackHeapBarrier|) (<= (select .cse5 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse4))))))) is different from false [2024-11-22 18:44:55,907 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_67| (Array Int (Array Int Int)))) (let ((.cse2 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_67| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse1 (select .cse2 .cse3)) (.cse0 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_67| |c_#memory_$Pointer$#2.base|))) (and (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse0) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (<= (select .cse2 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_67| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|))))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse4 (select .cse5 .cse3))) (and (<= (+ .cse4 1) |c_#StackHeapBarrier|) (<= (select .cse5 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse4))))))) is different from true [2024-11-22 18:44:55,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:44:55,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2024-11-22 18:44:55,978 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_68| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_68| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_68| |c_#memory_$Pointer$#2.base|)) (.cse1 (select .cse0 .cse3))) (and (<= (select .cse0 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_68| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|) (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse2) (<= (+ .cse1 1) |c_#StackHeapBarrier|))))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse4 (select .cse5 .cse3))) (and (<= (+ .cse4 1) |c_#StackHeapBarrier|) (<= (select .cse5 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse4)))))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|))) is different from false [2024-11-22 18:44:55,980 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_68| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_68| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_68| |c_#memory_$Pointer$#2.base|)) (.cse1 (select .cse0 .cse3))) (and (<= (select .cse0 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_68| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|) (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse2) (<= (+ .cse1 1) |c_#StackHeapBarrier|))))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse4 (select .cse5 .cse3))) (and (<= (+ .cse4 1) |c_#StackHeapBarrier|) (<= (select .cse5 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse4)))))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|))) is different from true [2024-11-22 18:44:56,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:44:56,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2024-11-22 18:44:56,065 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_69| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_69| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse1 (select .cse0 .cse3)) (.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_69| |c_#memory_$Pointer$#2.base|))) (and (<= (select .cse0 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse1) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (= .cse2 |c_ULTIMATE.start_main_~list2~0#1.base|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_69| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|))))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse4 (select .cse5 .cse3))) (and (<= (+ .cse4 1) |c_#StackHeapBarrier|) (<= (select .cse5 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse4)))))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|))) is different from false [2024-11-22 18:44:56,067 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_69| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_69| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse1 (select .cse0 .cse3)) (.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_69| |c_#memory_$Pointer$#2.base|))) (and (<= (select .cse0 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse1) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (= .cse2 |c_ULTIMATE.start_main_~list2~0#1.base|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_69| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|))))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse4 (select .cse5 .cse3))) (and (<= (+ .cse4 1) |c_#StackHeapBarrier|) (<= (select .cse5 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse4)))))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|))) is different from true [2024-11-22 18:44:56,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:44:56,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2024-11-22 18:44:56,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:44:56,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 12 [2024-11-22 18:44:56,185 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 6 proven. 59 refuted. 0 times theorem prover too weak. 240 trivial. 15 not checked. [2024-11-22 18:44:56,185 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:44:56,231 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5912 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list2~0#1.base| v_ArrVal_5912) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2024-11-22 18:44:56,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899626141] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:44:56,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:44:56,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 24 [2024-11-22 18:44:56,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893614153] [2024-11-22 18:44:56,232 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:44:56,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-22 18:44:56,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:44:56,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-22 18:44:56,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=324, Unknown=11, NotChecked=246, Total=650 [2024-11-22 18:44:56,233 INFO L87 Difference]: Start difference. First operand 179 states and 201 transitions. Second operand has 25 states, 24 states have (on average 3.5833333333333335) internal successors, (86), 19 states have internal predecessors, (86), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (10), 9 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-22 18:44:58,054 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse19 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse20 (select .cse19 .cse3))) (let ((.cse5 (<= (+ .cse20 1) |c_#StackHeapBarrier|)) (.cse15 (<= (select .cse19 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse20))) (let ((.cse4 (and .cse5 .cse15))) (and (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_68| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_68| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_68| |c_#memory_$Pointer$#2.base|)) (.cse1 (select .cse0 .cse3))) (and (<= (select .cse0 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_68| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|) (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse2) (<= (+ .cse1 1) |c_#StackHeapBarrier|))))) .cse4) .cse5 (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_65| (Array Int (Array Int Int)))) (let ((.cse6 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_65| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse7 (select .cse6 .cse3)) (.cse8 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_65| |c_#memory_$Pointer$#2.base|))) (and (<= (select .cse6 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse7) (= |c_#memory_$Pointer$#2.base| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_65| .cse8 (select |c_#memory_$Pointer$#2.base| .cse8))) (<= (+ .cse7 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse8))))) .cse4) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_66| (Array Int (Array Int Int)))) (let ((.cse10 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_66| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse11 (select .cse10 .cse3)) (.cse9 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_66| |c_#memory_$Pointer$#2.base|))) (and (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse9) (<= (select .cse10 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse11) (<= (+ .cse11 1) |c_#StackHeapBarrier|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_66| .cse9 (select |c_#memory_$Pointer$#2.base| .cse9)) |c_#memory_$Pointer$#2.base|))))) .cse4) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_69| (Array Int (Array Int Int)))) (let ((.cse12 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_69| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse13 (select .cse12 .cse3)) (.cse14 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_69| |c_#memory_$Pointer$#2.base|))) (and (<= (select .cse12 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse13) (<= (+ .cse13 1) |c_#StackHeapBarrier|) (= .cse14 |c_ULTIMATE.start_main_~list2~0#1.base|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_69| .cse14 (select |c_#memory_$Pointer$#2.base| .cse14)) |c_#memory_$Pointer$#2.base|))))) .cse4) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|)) .cse15 (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_67| (Array Int (Array Int Int)))) (let ((.cse18 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_67| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse17 (select .cse18 .cse3)) (.cse16 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_67| |c_#memory_$Pointer$#2.base|))) (and (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse16) (<= (+ .cse17 1) |c_#StackHeapBarrier|) (<= (select .cse18 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse17) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_67| .cse16 (select |c_#memory_$Pointer$#2.base| .cse16)) |c_#memory_$Pointer$#2.base|))))) .cse4)))))) is different from false [2024-11-22 18:44:58,058 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse19 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse20 (select .cse19 .cse3))) (let ((.cse5 (<= (+ .cse20 1) |c_#StackHeapBarrier|)) (.cse15 (<= (select .cse19 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse20))) (let ((.cse4 (and .cse5 .cse15))) (and (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_68| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_68| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_68| |c_#memory_$Pointer$#2.base|)) (.cse1 (select .cse0 .cse3))) (and (<= (select .cse0 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_68| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|) (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse2) (<= (+ .cse1 1) |c_#StackHeapBarrier|))))) .cse4) .cse5 (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_65| (Array Int (Array Int Int)))) (let ((.cse6 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_65| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse7 (select .cse6 .cse3)) (.cse8 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_65| |c_#memory_$Pointer$#2.base|))) (and (<= (select .cse6 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse7) (= |c_#memory_$Pointer$#2.base| (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_65| .cse8 (select |c_#memory_$Pointer$#2.base| .cse8))) (<= (+ .cse7 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse8))))) .cse4) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_66| (Array Int (Array Int Int)))) (let ((.cse10 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_66| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse11 (select .cse10 .cse3)) (.cse9 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_66| |c_#memory_$Pointer$#2.base|))) (and (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse9) (<= (select .cse10 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse11) (<= (+ .cse11 1) |c_#StackHeapBarrier|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_66| .cse9 (select |c_#memory_$Pointer$#2.base| .cse9)) |c_#memory_$Pointer$#2.base|))))) .cse4) (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_69| (Array Int (Array Int Int)))) (let ((.cse12 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_69| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse13 (select .cse12 .cse3)) (.cse14 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_69| |c_#memory_$Pointer$#2.base|))) (and (<= (select .cse12 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse13) (<= (+ .cse13 1) |c_#StackHeapBarrier|) (= .cse14 |c_ULTIMATE.start_main_~list2~0#1.base|) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_69| .cse14 (select |c_#memory_$Pointer$#2.base| .cse14)) |c_#memory_$Pointer$#2.base|))))) .cse4) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|)) .cse15 (or (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_67| (Array Int (Array Int Int)))) (let ((.cse18 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_67| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse17 (select .cse18 .cse3)) (.cse16 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_67| |c_#memory_$Pointer$#2.base|))) (and (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse16) (<= (+ .cse17 1) |c_#StackHeapBarrier|) (<= (select .cse18 |c_ULTIMATE.start_main_~list~0#1.offset|) .cse17) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_67| .cse16 (select |c_#memory_$Pointer$#2.base| .cse16)) |c_#memory_$Pointer$#2.base|))))) .cse4)))))) is different from true [2024-11-22 18:44:58,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:44:58,288 INFO L93 Difference]: Finished difference Result 300 states and 348 transitions. [2024-11-22 18:44:58,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-22 18:44:58,288 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.5833333333333335) internal successors, (86), 19 states have internal predecessors, (86), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (10), 9 states have call predecessors, (10), 3 states have call successors, (10) Word has length 156 [2024-11-22 18:44:58,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:44:58,289 INFO L225 Difference]: With dead ends: 300 [2024-11-22 18:44:58,289 INFO L226 Difference]: Without dead ends: 300 [2024-11-22 18:44:58,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 170 SyntacticMatches, 9 SemanticMatches, 41 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=207, Invalid=1068, Unknown=13, NotChecked=518, Total=1806 [2024-11-22 18:44:58,290 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 314 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 970 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:44:58,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 513 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 491 Invalid, 0 Unknown, 970 Unchecked, 0.3s Time] [2024-11-22 18:44:58,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-22 18:44:58,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 180. [2024-11-22 18:44:58,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 152 states have (on average 1.2236842105263157) internal successors, (186), 168 states have internal predecessors, (186), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 18:44:58,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 202 transitions. [2024-11-22 18:44:58,296 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 202 transitions. Word has length 156 [2024-11-22 18:44:58,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:44:58,296 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 202 transitions. [2024-11-22 18:44:58,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.5833333333333335) internal successors, (86), 19 states have internal predecessors, (86), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (10), 9 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-22 18:44:58,296 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 202 transitions. [2024-11-22 18:44:58,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-22 18:44:58,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:44:58,297 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:44:58,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-22 18:44:58,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:44:58,498 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-22 18:44:58,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:44:58,498 INFO L85 PathProgramCache]: Analyzing trace with hash -270265747, now seen corresponding path program 1 times [2024-11-22 18:44:58,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:44:58,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748409872] [2024-11-22 18:44:58,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:44:58,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:44:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat