./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0218.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0218.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 d0144744ce48339ff9171f70682ff014d707c8affcdd45929fe7382e980b7693 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:43:39,958 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:43:40,009 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:43:40,012 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:43:40,013 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:43:40,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:43:40,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:43:40,041 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:43:40,041 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:43:40,042 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:43:40,050 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:43:40,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:43:40,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:43:40,053 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:43:40,053 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:43:40,054 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:43:40,054 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:43:40,054 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:43:40,054 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:43:40,054 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:43:40,054 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:43:40,057 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:43:40,058 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:43:40,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:43:40,058 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:43:40,058 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:43:40,058 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:43:40,058 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:43:40,059 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:43:40,059 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:43:40,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:43:40,059 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:43:40,059 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:43:40,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:43:40,059 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:43:40,060 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:43:40,060 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:43:40,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:43:40,060 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:43:40,060 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:43:40,060 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:43:40,061 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:43:40,061 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 -> d0144744ce48339ff9171f70682ff014d707c8affcdd45929fe7382e980b7693 [2024-11-09 07:43:40,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:43:40,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:43:40,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:43:40,292 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:43:40,292 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:43:40,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0218.i [2024-11-09 07:43:41,729 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:43:41,939 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:43:41,939 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0218.i [2024-11-09 07:43:41,950 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2e0606d3/d2aef785ce6d4434b506f7d018de7046/FLAG24f86a17e [2024-11-09 07:43:41,961 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2e0606d3/d2aef785ce6d4434b506f7d018de7046 [2024-11-09 07:43:41,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:43:41,965 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:43:41,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:43:41,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:43:41,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:43:41,971 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:43:41" (1/1) ... [2024-11-09 07:43:41,972 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55b57629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:41, skipping insertion in model container [2024-11-09 07:43:41,972 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:43:41" (1/1) ... [2024-11-09 07:43:42,002 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:43:42,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:43:42,323 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:43:42,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:43:42,391 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:43:42,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:42 WrapperNode [2024-11-09 07:43:42,392 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:43:42,393 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:43:42,393 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:43:42,393 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:43:42,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:42" (1/1) ... [2024-11-09 07:43:42,421 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:42" (1/1) ... [2024-11-09 07:43:42,451 INFO L138 Inliner]: procedures = 181, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 211 [2024-11-09 07:43:42,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:43:42,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:43:42,454 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:43:42,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:43:42,464 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:42" (1/1) ... [2024-11-09 07:43:42,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:42" (1/1) ... [2024-11-09 07:43:42,471 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:42" (1/1) ... [2024-11-09 07:43:42,524 INFO L175 MemorySlicer]: Split 31 memory accesses to 2 slices as follows [2, 29]. 94 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 10 writes are split as follows [0, 10]. [2024-11-09 07:43:42,526 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:42" (1/1) ... [2024-11-09 07:43:42,526 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:42" (1/1) ... [2024-11-09 07:43:42,541 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:42" (1/1) ... [2024-11-09 07:43:42,562 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:42" (1/1) ... [2024-11-09 07:43:42,570 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:42" (1/1) ... [2024-11-09 07:43:42,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:42" (1/1) ... [2024-11-09 07:43:42,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:43:42,582 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:43:42,582 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:43:42,582 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:43:42,583 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:42" (1/1) ... [2024-11-09 07:43:42,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:43:42,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:43:42,615 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:43:42,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:43:42,662 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2024-11-09 07:43:42,662 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2024-11-09 07:43:42,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:43:42,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:43:42,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:43:42,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:43:42,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:43:42,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:43:42,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:43:42,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 07:43:42,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 07:43:42,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 07:43:42,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 07:43:42,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:43:42,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:43:42,770 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:43:42,772 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:43:43,143 INFO L? ?]: Removed 182 outVars from TransFormulas that were not future-live. [2024-11-09 07:43:43,144 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:43:43,159 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:43:43,163 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-09 07:43:43,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:43:43 BoogieIcfgContainer [2024-11-09 07:43:43,164 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:43:43,165 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:43:43,165 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:43:43,170 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:43:43,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:43:41" (1/3) ... [2024-11-09 07:43:43,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13371c45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:43:43, skipping insertion in model container [2024-11-09 07:43:43,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:42" (2/3) ... [2024-11-09 07:43:43,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13371c45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:43:43, skipping insertion in model container [2024-11-09 07:43:43,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:43:43" (3/3) ... [2024-11-09 07:43:43,174 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0218.i [2024-11-09 07:43:43,191 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:43:43,191 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2024-11-09 07:43:43,240 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:43:43,246 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;@120ec8fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:43:43,246 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2024-11-09 07:43:43,250 INFO L276 IsEmpty]: Start isEmpty. Operand has 163 states, 94 states have (on average 1.9574468085106382) internal successors, (184), 159 states have internal predecessors, (184), 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-09 07:43:43,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:43:43,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:43,254 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:43:43,255 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:43,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:43,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1074395626, now seen corresponding path program 1 times [2024-11-09 07:43:43,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:43,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725864047] [2024-11-09 07:43:43,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:43,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:43,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:43,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:43,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725864047] [2024-11-09 07:43:43,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725864047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:43,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:43,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:43:43,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087043078] [2024-11-09 07:43:43,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:43,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 07:43:43,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:43,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 07:43:43,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:43:43,415 INFO L87 Difference]: Start difference. First operand has 163 states, 94 states have (on average 1.9574468085106382) internal successors, (184), 159 states have internal predecessors, (184), 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 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-09 07:43:43,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:43,450 INFO L93 Difference]: Finished difference Result 163 states and 182 transitions. [2024-11-09 07:43:43,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 07:43:43,452 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-09 07:43:43,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:43,461 INFO L225 Difference]: With dead ends: 163 [2024-11-09 07:43:43,462 INFO L226 Difference]: Without dead ends: 161 [2024-11-09 07:43:43,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:43:43,471 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:43,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:43:43,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-09 07:43:43,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2024-11-09 07:43:43,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 93 states have (on average 1.89247311827957) internal successors, (176), 157 states have internal predecessors, (176), 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-09 07:43:43,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 180 transitions. [2024-11-09 07:43:43,521 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 180 transitions. Word has length 6 [2024-11-09 07:43:43,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:43,522 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 180 transitions. [2024-11-09 07:43:43,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-09 07:43:43,522 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 180 transitions. [2024-11-09 07:43:43,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:43:43,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:43,523 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:43,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:43:43,524 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:43,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:43,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1280335204, now seen corresponding path program 1 times [2024-11-09 07:43:43,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:43,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112363390] [2024-11-09 07:43:43,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:43,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:43,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:43,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:43,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:43,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112363390] [2024-11-09 07:43:43,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112363390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:43,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:43,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 07:43:43,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101034238] [2024-11-09 07:43:43,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:43,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:43:43,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:43,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:43:43,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:43:43,749 INFO L87 Difference]: Start difference. First operand 161 states and 180 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-09 07:43:43,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:43,946 INFO L93 Difference]: Finished difference Result 313 states and 350 transitions. [2024-11-09 07:43:43,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:43:43,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2024-11-09 07:43:43,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:43,949 INFO L225 Difference]: With dead ends: 313 [2024-11-09 07:43:43,949 INFO L226 Difference]: Without dead ends: 313 [2024-11-09 07:43:43,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:43:43,953 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 161 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:43,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 231 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:43:43,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-09 07:43:43,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 223. [2024-11-09 07:43:43,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 152 states have (on average 1.868421052631579) internal successors, (284), 216 states have internal predecessors, (284), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:43:43,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 292 transitions. [2024-11-09 07:43:43,987 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 292 transitions. Word has length 7 [2024-11-09 07:43:43,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:43,987 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 292 transitions. [2024-11-09 07:43:43,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-09 07:43:43,988 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 292 transitions. [2024-11-09 07:43:43,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:43:43,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:43,988 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:43,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:43:43,989 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:43,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:43,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1280335203, now seen corresponding path program 1 times [2024-11-09 07:43:43,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:43,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564958566] [2024-11-09 07:43:43,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:43,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:44,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:44,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:44,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564958566] [2024-11-09 07:43:44,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564958566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:44,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:44,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:43:44,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043334439] [2024-11-09 07:43:44,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:44,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:43:44,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:44,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:43:44,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:43:44,121 INFO L87 Difference]: Start difference. First operand 223 states and 292 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-09 07:43:44,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:44,243 INFO L93 Difference]: Finished difference Result 226 states and 295 transitions. [2024-11-09 07:43:44,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:43:44,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2024-11-09 07:43:44,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:44,244 INFO L225 Difference]: With dead ends: 226 [2024-11-09 07:43:44,244 INFO L226 Difference]: Without dead ends: 226 [2024-11-09 07:43:44,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:43:44,245 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 175 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:44,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 241 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:43:44,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-09 07:43:44,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2024-11-09 07:43:44,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 154 states have (on average 1.8636363636363635) internal successors, (287), 218 states have internal predecessors, (287), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:43:44,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 295 transitions. [2024-11-09 07:43:44,254 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 295 transitions. Word has length 7 [2024-11-09 07:43:44,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:44,254 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 295 transitions. [2024-11-09 07:43:44,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-09 07:43:44,255 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 295 transitions. [2024-11-09 07:43:44,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:43:44,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:44,255 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:44,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:43:44,255 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:44,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:44,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1280335141, now seen corresponding path program 1 times [2024-11-09 07:43:44,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:44,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931856635] [2024-11-09 07:43:44,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:44,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:44,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:44,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:44,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931856635] [2024-11-09 07:43:44,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931856635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:44,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:44,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:43:44,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360238613] [2024-11-09 07:43:44,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:44,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:43:44,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:44,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:43:44,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:43:44,323 INFO L87 Difference]: Start difference. First operand 225 states and 295 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-09 07:43:44,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:44,414 INFO L93 Difference]: Finished difference Result 225 states and 293 transitions. [2024-11-09 07:43:44,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:43:44,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2024-11-09 07:43:44,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:44,415 INFO L225 Difference]: With dead ends: 225 [2024-11-09 07:43:44,415 INFO L226 Difference]: Without dead ends: 225 [2024-11-09 07:43:44,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:43:44,416 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 173 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:44,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 241 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:43:44,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-09 07:43:44,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2024-11-09 07:43:44,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 152 states have (on average 1.855263157894737) internal successors, (282), 215 states have internal predecessors, (282), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:43:44,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 290 transitions. [2024-11-09 07:43:44,423 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 290 transitions. Word has length 7 [2024-11-09 07:43:44,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:44,424 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 290 transitions. [2024-11-09 07:43:44,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-09 07:43:44,424 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 290 transitions. [2024-11-09 07:43:44,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:43:44,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:44,424 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:44,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:43:44,425 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:44,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:44,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1138725070, now seen corresponding path program 1 times [2024-11-09 07:43:44,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:44,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068786233] [2024-11-09 07:43:44,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:44,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:44,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:44,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:44,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068786233] [2024-11-09 07:43:44,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068786233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:44,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:44,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:43:44,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608597872] [2024-11-09 07:43:44,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:44,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:43:44,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:44,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:43:44,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:43:44,592 INFO L87 Difference]: Start difference. First operand 222 states and 290 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-09 07:43:44,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:44,730 INFO L93 Difference]: Finished difference Result 391 states and 503 transitions. [2024-11-09 07:43:44,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:43:44,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2024-11-09 07:43:44,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:44,732 INFO L225 Difference]: With dead ends: 391 [2024-11-09 07:43:44,732 INFO L226 Difference]: Without dead ends: 391 [2024-11-09 07:43:44,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:43:44,733 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 131 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:44,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 709 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:43:44,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-09 07:43:44,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 288. [2024-11-09 07:43:44,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 212 states have (on average 1.7971698113207548) internal successors, (381), 277 states have internal predecessors, (381), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 07:43:44,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 397 transitions. [2024-11-09 07:43:44,757 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 397 transitions. Word has length 10 [2024-11-09 07:43:44,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:44,757 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 397 transitions. [2024-11-09 07:43:44,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-09 07:43:44,757 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 397 transitions. [2024-11-09 07:43:44,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:43:44,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:44,758 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:44,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:43:44,758 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:44,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:44,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1140572112, now seen corresponding path program 1 times [2024-11-09 07:43:44,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:44,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802830248] [2024-11-09 07:43:44,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:44,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:44,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:44,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:44,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802830248] [2024-11-09 07:43:44,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802830248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:44,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:44,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:43:44,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864838810] [2024-11-09 07:43:44,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:44,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:43:44,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:44,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:43:44,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:43:44,858 INFO L87 Difference]: Start difference. First operand 288 states and 397 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-09 07:43:44,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:44,987 INFO L93 Difference]: Finished difference Result 381 states and 492 transitions. [2024-11-09 07:43:44,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:43:44,987 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2024-11-09 07:43:44,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:44,989 INFO L225 Difference]: With dead ends: 381 [2024-11-09 07:43:44,991 INFO L226 Difference]: Without dead ends: 381 [2024-11-09 07:43:44,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:43:44,992 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 116 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:44,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 706 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:43:44,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-09 07:43:45,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 288. [2024-11-09 07:43:45,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 212 states have (on average 1.7971698113207548) internal successors, (381), 277 states have internal predecessors, (381), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 07:43:45,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 397 transitions. [2024-11-09 07:43:45,010 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 397 transitions. Word has length 10 [2024-11-09 07:43:45,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:45,010 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 397 transitions. [2024-11-09 07:43:45,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-09 07:43:45,010 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 397 transitions. [2024-11-09 07:43:45,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:43:45,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:45,010 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:45,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:43:45,011 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:45,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:45,011 INFO L85 PathProgramCache]: Analyzing trace with hash 940737540, now seen corresponding path program 1 times [2024-11-09 07:43:45,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:45,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476228585] [2024-11-09 07:43:45,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:45,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:45,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:45,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:45,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476228585] [2024-11-09 07:43:45,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476228585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:45,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:45,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:43:45,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293701948] [2024-11-09 07:43:45,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:45,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:43:45,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:45,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:43:45,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:43:45,039 INFO L87 Difference]: Start difference. First operand 288 states and 397 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-09 07:43:45,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:45,119 INFO L93 Difference]: Finished difference Result 339 states and 444 transitions. [2024-11-09 07:43:45,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:43:45,120 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), 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 11 [2024-11-09 07:43:45,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:45,122 INFO L225 Difference]: With dead ends: 339 [2024-11-09 07:43:45,123 INFO L226 Difference]: Without dead ends: 332 [2024-11-09 07:43:45,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:43:45,124 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 64 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:45,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 265 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:43:45,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-09 07:43:45,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 285. [2024-11-09 07:43:45,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 209 states have (on average 1.799043062200957) internal successors, (376), 274 states have internal predecessors, (376), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 07:43:45,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 392 transitions. [2024-11-09 07:43:45,135 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 392 transitions. Word has length 11 [2024-11-09 07:43:45,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:45,135 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 392 transitions. [2024-11-09 07:43:45,135 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), 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-09 07:43:45,136 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 392 transitions. [2024-11-09 07:43:45,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:43:45,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:45,137 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:45,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:43:45,137 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:45,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:45,138 INFO L85 PathProgramCache]: Analyzing trace with hash 418669755, now seen corresponding path program 1 times [2024-11-09 07:43:45,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:45,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238743247] [2024-11-09 07:43:45,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:45,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:45,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 07:43:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:45,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:45,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:45,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238743247] [2024-11-09 07:43:45,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238743247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:45,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:45,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:43:45,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301109535] [2024-11-09 07:43:45,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:45,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:43:45,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:45,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:43:45,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:43:45,229 INFO L87 Difference]: Start difference. First operand 285 states and 392 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:45,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:45,380 INFO L93 Difference]: Finished difference Result 381 states and 467 transitions. [2024-11-09 07:43:45,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:43:45,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 15 [2024-11-09 07:43:45,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:45,382 INFO L225 Difference]: With dead ends: 381 [2024-11-09 07:43:45,382 INFO L226 Difference]: Without dead ends: 381 [2024-11-09 07:43:45,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:43:45,384 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 164 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:45,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 334 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:43:45,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-09 07:43:45,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 291. [2024-11-09 07:43:45,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 215 states have (on average 1.7767441860465116) internal successors, (382), 280 states have internal predecessors, (382), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 07:43:45,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 398 transitions. [2024-11-09 07:43:45,392 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 398 transitions. Word has length 15 [2024-11-09 07:43:45,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:45,393 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 398 transitions. [2024-11-09 07:43:45,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:45,394 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 398 transitions. [2024-11-09 07:43:45,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:43:45,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:45,394 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:45,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:43:45,395 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:45,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:45,395 INFO L85 PathProgramCache]: Analyzing trace with hash 418669756, now seen corresponding path program 1 times [2024-11-09 07:43:45,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:45,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991877969] [2024-11-09 07:43:45,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:45,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:45,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:45,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 07:43:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:45,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:45,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:45,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991877969] [2024-11-09 07:43:45,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991877969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:45,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:45,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:43:45,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929299479] [2024-11-09 07:43:45,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:45,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:43:45,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:45,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:43:45,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:43:45,472 INFO L87 Difference]: Start difference. First operand 291 states and 398 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:45,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:45,565 INFO L93 Difference]: Finished difference Result 292 states and 390 transitions. [2024-11-09 07:43:45,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:43:45,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 15 [2024-11-09 07:43:45,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:45,567 INFO L225 Difference]: With dead ends: 292 [2024-11-09 07:43:45,567 INFO L226 Difference]: Without dead ends: 292 [2024-11-09 07:43:45,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:43:45,567 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 175 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:45,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 228 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:43:45,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-09 07:43:45,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 288. [2024-11-09 07:43:45,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 215 states have (on average 1.7209302325581395) internal successors, (370), 277 states have internal predecessors, (370), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 07:43:45,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 386 transitions. [2024-11-09 07:43:45,573 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 386 transitions. Word has length 15 [2024-11-09 07:43:45,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:45,573 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 386 transitions. [2024-11-09 07:43:45,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:45,574 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 386 transitions. [2024-11-09 07:43:45,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:43:45,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:45,574 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:45,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:43:45,574 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:45,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:45,575 INFO L85 PathProgramCache]: Analyzing trace with hash -66961466, now seen corresponding path program 1 times [2024-11-09 07:43:45,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:45,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455368910] [2024-11-09 07:43:45,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:45,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:45,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:43:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:45,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:45,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:45,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455368910] [2024-11-09 07:43:45,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455368910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:45,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:45,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:43:45,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145131132] [2024-11-09 07:43:45,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:45,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:43:45,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:45,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:43:45,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:43:45,653 INFO L87 Difference]: Start difference. First operand 288 states and 386 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:45,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:45,829 INFO L93 Difference]: Finished difference Result 394 states and 488 transitions. [2024-11-09 07:43:45,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:43:45,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 17 [2024-11-09 07:43:45,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:45,831 INFO L225 Difference]: With dead ends: 394 [2024-11-09 07:43:45,831 INFO L226 Difference]: Without dead ends: 394 [2024-11-09 07:43:45,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:43:45,832 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 330 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:45,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 313 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:43:45,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-09 07:43:45,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 285. [2024-11-09 07:43:45,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 216 states have (on average 1.6851851851851851) internal successors, (364), 274 states have internal predecessors, (364), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 07:43:45,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 380 transitions. [2024-11-09 07:43:45,838 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 380 transitions. Word has length 17 [2024-11-09 07:43:45,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:45,838 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 380 transitions. [2024-11-09 07:43:45,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:45,838 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 380 transitions. [2024-11-09 07:43:45,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:43:45,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:45,839 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:45,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:43:45,839 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:45,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:45,839 INFO L85 PathProgramCache]: Analyzing trace with hash -66961465, now seen corresponding path program 1 times [2024-11-09 07:43:45,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:45,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649021099] [2024-11-09 07:43:45,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:45,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:46,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:43:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:46,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:46,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:46,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649021099] [2024-11-09 07:43:46,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649021099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:46,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:46,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:43:46,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391102759] [2024-11-09 07:43:46,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:46,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:43:46,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:46,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:43:46,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:43:46,038 INFO L87 Difference]: Start difference. First operand 285 states and 380 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:46,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:46,359 INFO L93 Difference]: Finished difference Result 357 states and 481 transitions. [2024-11-09 07:43:46,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:43:46,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 17 [2024-11-09 07:43:46,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:46,360 INFO L225 Difference]: With dead ends: 357 [2024-11-09 07:43:46,360 INFO L226 Difference]: Without dead ends: 357 [2024-11-09 07:43:46,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:43:46,361 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 246 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:46,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 464 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:43:46,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-09 07:43:46,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 347. [2024-11-09 07:43:46,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 274 states have (on average 1.667883211678832) internal successors, (457), 334 states have internal predecessors, (457), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-09 07:43:46,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 481 transitions. [2024-11-09 07:43:46,375 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 481 transitions. Word has length 17 [2024-11-09 07:43:46,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:46,375 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 481 transitions. [2024-11-09 07:43:46,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:46,375 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 481 transitions. [2024-11-09 07:43:46,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:43:46,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:46,376 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:46,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:43:46,376 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:46,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:46,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1874415928, now seen corresponding path program 1 times [2024-11-09 07:43:46,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:46,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862728057] [2024-11-09 07:43:46,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:46,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:46,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:43:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:46,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:46,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:46,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862728057] [2024-11-09 07:43:46,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862728057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:46,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:46,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:43:46,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221923686] [2024-11-09 07:43:46,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:46,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:43:46,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:46,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:43:46,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:43:46,452 INFO L87 Difference]: Start difference. First operand 347 states and 481 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:46,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:46,482 INFO L93 Difference]: Finished difference Result 347 states and 479 transitions. [2024-11-09 07:43:46,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:43:46,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-09 07:43:46,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:46,484 INFO L225 Difference]: With dead ends: 347 [2024-11-09 07:43:46,484 INFO L226 Difference]: Without dead ends: 347 [2024-11-09 07:43:46,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:43:46,485 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 1 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:46,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 861 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:43:46,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-09 07:43:46,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2024-11-09 07:43:46,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 274 states have (on average 1.6605839416058394) internal successors, (455), 334 states have internal predecessors, (455), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-09 07:43:46,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 479 transitions. [2024-11-09 07:43:46,495 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 479 transitions. Word has length 17 [2024-11-09 07:43:46,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:46,495 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 479 transitions. [2024-11-09 07:43:46,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:46,496 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 479 transitions. [2024-11-09 07:43:46,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:43:46,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:46,496 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:46,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:43:46,497 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:46,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:46,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2022703953, now seen corresponding path program 1 times [2024-11-09 07:43:46,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:46,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342871439] [2024-11-09 07:43:46,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:46,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:46,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:43:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:46,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:46,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:46,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342871439] [2024-11-09 07:43:46,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342871439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:46,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:46,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:43:46,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435875348] [2024-11-09 07:43:46,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:46,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:43:46,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:46,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:43:46,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:43:46,678 INFO L87 Difference]: Start difference. First operand 347 states and 479 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:46,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:46,875 INFO L93 Difference]: Finished difference Result 398 states and 550 transitions. [2024-11-09 07:43:46,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:43:46,876 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 18 [2024-11-09 07:43:46,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:46,877 INFO L225 Difference]: With dead ends: 398 [2024-11-09 07:43:46,877 INFO L226 Difference]: Without dead ends: 398 [2024-11-09 07:43:46,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:43:46,878 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 200 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:46,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 552 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:43:46,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-09 07:43:46,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 342. [2024-11-09 07:43:46,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 269 states have (on average 1.661710037174721) internal successors, (447), 329 states have internal predecessors, (447), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-09 07:43:46,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 471 transitions. [2024-11-09 07:43:46,885 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 471 transitions. Word has length 18 [2024-11-09 07:43:46,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:46,886 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 471 transitions. [2024-11-09 07:43:46,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:46,886 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 471 transitions. [2024-11-09 07:43:46,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:43:46,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:46,886 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:46,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:43:46,892 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:46,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:46,893 INFO L85 PathProgramCache]: Analyzing trace with hash 413987999, now seen corresponding path program 1 times [2024-11-09 07:43:46,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:46,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839957921] [2024-11-09 07:43:46,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:46,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:47,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 07:43:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:47,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:47,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:47,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839957921] [2024-11-09 07:43:47,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839957921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:47,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:47,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:43:47,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957199433] [2024-11-09 07:43:47,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:47,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:43:47,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:47,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:43:47,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:43:47,139 INFO L87 Difference]: Start difference. First operand 342 states and 471 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:47,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:47,444 INFO L93 Difference]: Finished difference Result 450 states and 593 transitions. [2024-11-09 07:43:47,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:43:47,445 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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 21 [2024-11-09 07:43:47,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:47,448 INFO L225 Difference]: With dead ends: 450 [2024-11-09 07:43:47,448 INFO L226 Difference]: Without dead ends: 450 [2024-11-09 07:43:47,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:43:47,449 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 109 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:47,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1006 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:43:47,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-11-09 07:43:47,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 336. [2024-11-09 07:43:47,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 263 states have (on average 1.6577946768060836) internal successors, (436), 323 states have internal predecessors, (436), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-09 07:43:47,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 460 transitions. [2024-11-09 07:43:47,466 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 460 transitions. Word has length 21 [2024-11-09 07:43:47,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:47,466 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 460 transitions. [2024-11-09 07:43:47,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:47,466 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 460 transitions. [2024-11-09 07:43:47,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:43:47,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:47,467 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:47,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:43:47,467 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:47,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:47,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1380079796, now seen corresponding path program 1 times [2024-11-09 07:43:47,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:47,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454052455] [2024-11-09 07:43:47,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:47,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:47,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:47,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:43:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:47,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:47,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:47,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454052455] [2024-11-09 07:43:47,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454052455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:47,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:47,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:43:47,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720226812] [2024-11-09 07:43:47,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:47,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:43:47,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:47,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:43:47,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:43:47,624 INFO L87 Difference]: Start difference. First operand 336 states and 460 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:47,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:47,811 INFO L93 Difference]: Finished difference Result 476 states and 628 transitions. [2024-11-09 07:43:47,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:43:47,811 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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 21 [2024-11-09 07:43:47,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:47,813 INFO L225 Difference]: With dead ends: 476 [2024-11-09 07:43:47,813 INFO L226 Difference]: Without dead ends: 476 [2024-11-09 07:43:47,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:43:47,813 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 140 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:47,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 971 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:43:47,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-11-09 07:43:47,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 354. [2024-11-09 07:43:47,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 281 states have (on average 1.6334519572953736) internal successors, (459), 339 states have internal predecessors, (459), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-09 07:43:47,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 483 transitions. [2024-11-09 07:43:47,820 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 483 transitions. Word has length 21 [2024-11-09 07:43:47,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:47,820 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 483 transitions. [2024-11-09 07:43:47,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:47,821 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 483 transitions. [2024-11-09 07:43:47,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:43:47,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:47,821 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-09 07:43:47,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:43:47,822 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:47,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:47,822 INFO L85 PathProgramCache]: Analyzing trace with hash -548760106, now seen corresponding path program 1 times [2024-11-09 07:43:47,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:47,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652346866] [2024-11-09 07:43:47,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:47,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:47,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:43:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:48,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:48,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:48,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652346866] [2024-11-09 07:43:48,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652346866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:48,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:48,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:43:48,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181041543] [2024-11-09 07:43:48,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:48,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:43:48,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:48,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:43:48,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:43:48,004 INFO L87 Difference]: Start difference. First operand 354 states and 483 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:48,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:48,203 INFO L93 Difference]: Finished difference Result 476 states and 622 transitions. [2024-11-09 07:43:48,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:43:48,221 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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 22 [2024-11-09 07:43:48,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:48,223 INFO L225 Difference]: With dead ends: 476 [2024-11-09 07:43:48,223 INFO L226 Difference]: Without dead ends: 476 [2024-11-09 07:43:48,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:43:48,223 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 117 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:48,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1125 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:43:48,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-11-09 07:43:48,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 362. [2024-11-09 07:43:48,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 289 states have (on average 1.6159169550173011) internal successors, (467), 345 states have internal predecessors, (467), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-09 07:43:48,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 491 transitions. [2024-11-09 07:43:48,231 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 491 transitions. Word has length 22 [2024-11-09 07:43:48,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:48,231 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 491 transitions. [2024-11-09 07:43:48,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:48,231 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 491 transitions. [2024-11-09 07:43:48,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:43:48,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:48,232 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] [2024-11-09 07:43:48,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:43:48,232 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:48,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:48,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1581850198, now seen corresponding path program 1 times [2024-11-09 07:43:48,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:48,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598328709] [2024-11-09 07:43:48,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:48,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:48,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 07:43:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:48,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:48,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:48,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598328709] [2024-11-09 07:43:48,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598328709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:48,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:48,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:43:48,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316084850] [2024-11-09 07:43:48,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:48,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:43:48,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:48,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:43:48,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:43:48,269 INFO L87 Difference]: Start difference. First operand 362 states and 491 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:48,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:48,343 INFO L93 Difference]: Finished difference Result 362 states and 489 transitions. [2024-11-09 07:43:48,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:43:48,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 23 [2024-11-09 07:43:48,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:48,345 INFO L225 Difference]: With dead ends: 362 [2024-11-09 07:43:48,345 INFO L226 Difference]: Without dead ends: 362 [2024-11-09 07:43:48,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:43:48,345 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 38 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:48,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 366 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:43:48,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-09 07:43:48,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 357. [2024-11-09 07:43:48,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 290 states have (on average 1.5827586206896551) internal successors, (459), 340 states have internal predecessors, (459), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-09 07:43:48,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 483 transitions. [2024-11-09 07:43:48,352 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 483 transitions. Word has length 23 [2024-11-09 07:43:48,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:48,352 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 483 transitions. [2024-11-09 07:43:48,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:48,353 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 483 transitions. [2024-11-09 07:43:48,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:43:48,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:48,353 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] [2024-11-09 07:43:48,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 07:43:48,353 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:48,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:48,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1581850197, now seen corresponding path program 1 times [2024-11-09 07:43:48,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:48,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631862453] [2024-11-09 07:43:48,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:48,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:48,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 07:43:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:48,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:48,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:48,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631862453] [2024-11-09 07:43:48,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631862453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:48,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:48,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:43:48,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001283290] [2024-11-09 07:43:48,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:48,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:43:48,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:48,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:43:48,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:43:48,463 INFO L87 Difference]: Start difference. First operand 357 states and 483 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:48,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:48,672 INFO L93 Difference]: Finished difference Result 334 states and 443 transitions. [2024-11-09 07:43:48,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:43:48,673 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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 23 [2024-11-09 07:43:48,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:48,675 INFO L225 Difference]: With dead ends: 334 [2024-11-09 07:43:48,675 INFO L226 Difference]: Without dead ends: 334 [2024-11-09 07:43:48,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:43:48,676 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 58 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:48,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1014 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:43:48,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-09 07:43:48,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 304. [2024-11-09 07:43:48,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 241 states have (on average 1.6099585062240664) internal successors, (388), 291 states have internal predecessors, (388), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 07:43:48,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 406 transitions. [2024-11-09 07:43:48,684 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 406 transitions. Word has length 23 [2024-11-09 07:43:48,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:48,684 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 406 transitions. [2024-11-09 07:43:48,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:48,685 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 406 transitions. [2024-11-09 07:43:48,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:43:48,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:48,685 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] [2024-11-09 07:43:48,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:43:48,685 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:48,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:48,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1433519231, now seen corresponding path program 1 times [2024-11-09 07:43:48,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:48,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569882193] [2024-11-09 07:43:48,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:48,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:48,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:43:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:48,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:48,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:48,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569882193] [2024-11-09 07:43:48,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569882193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:48,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:48,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:43:48,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548978506] [2024-11-09 07:43:48,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:48,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:43:48,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:48,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:43:48,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:43:48,712 INFO L87 Difference]: Start difference. First operand 304 states and 406 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:48,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:48,727 INFO L93 Difference]: Finished difference Result 316 states and 418 transitions. [2024-11-09 07:43:48,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:43:48,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 25 [2024-11-09 07:43:48,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:48,728 INFO L225 Difference]: With dead ends: 316 [2024-11-09 07:43:48,728 INFO L226 Difference]: Without dead ends: 316 [2024-11-09 07:43:48,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:43:48,729 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 1 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:48,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 478 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:43:48,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-11-09 07:43:48,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2024-11-09 07:43:48,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 253 states have (on average 1.5810276679841897) internal successors, (400), 303 states have internal predecessors, (400), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 07:43:48,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 418 transitions. [2024-11-09 07:43:48,735 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 418 transitions. Word has length 25 [2024-11-09 07:43:48,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:48,735 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 418 transitions. [2024-11-09 07:43:48,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:48,735 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 418 transitions. [2024-11-09 07:43:48,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:43:48,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:48,735 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] [2024-11-09 07:43:48,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 07:43:48,736 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:48,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:48,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1431672189, now seen corresponding path program 1 times [2024-11-09 07:43:48,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:48,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497475961] [2024-11-09 07:43:48,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:48,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:48,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:43:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:48,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:48,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:48,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497475961] [2024-11-09 07:43:48,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497475961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:48,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:48,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:43:48,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258597709] [2024-11-09 07:43:48,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:48,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:43:48,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:48,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:43:48,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:43:48,792 INFO L87 Difference]: Start difference. First operand 316 states and 418 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:48,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:48,862 INFO L93 Difference]: Finished difference Result 394 states and 525 transitions. [2024-11-09 07:43:48,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:43:48,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 25 [2024-11-09 07:43:48,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:48,863 INFO L225 Difference]: With dead ends: 394 [2024-11-09 07:43:48,863 INFO L226 Difference]: Without dead ends: 394 [2024-11-09 07:43:48,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:43:48,864 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 73 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:48,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 247 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:43:48,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-09 07:43:48,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 388. [2024-11-09 07:43:48,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 325 states have (on average 1.56) internal successors, (507), 375 states have internal predecessors, (507), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 07:43:48,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 525 transitions. [2024-11-09 07:43:48,870 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 525 transitions. Word has length 25 [2024-11-09 07:43:48,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:48,870 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 525 transitions. [2024-11-09 07:43:48,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:48,871 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 525 transitions. [2024-11-09 07:43:48,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:43:48,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:48,871 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:48,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 07:43:48,871 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:48,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:48,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1431672190, now seen corresponding path program 1 times [2024-11-09 07:43:48,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:48,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814391155] [2024-11-09 07:43:48,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:48,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:48,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:43:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:48,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:48,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:48,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814391155] [2024-11-09 07:43:48,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814391155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:48,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:48,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:43:48,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163611384] [2024-11-09 07:43:48,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:48,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:43:48,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:48,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:43:48,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:43:48,896 INFO L87 Difference]: Start difference. First operand 388 states and 525 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:48,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:48,949 INFO L93 Difference]: Finished difference Result 386 states and 513 transitions. [2024-11-09 07:43:48,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:43:48,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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 25 [2024-11-09 07:43:48,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:48,950 INFO L225 Difference]: With dead ends: 386 [2024-11-09 07:43:48,950 INFO L226 Difference]: Without dead ends: 386 [2024-11-09 07:43:48,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:43:48,951 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 34 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:48,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 221 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:43:48,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-09 07:43:48,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2024-11-09 07:43:48,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 325 states have (on average 1.523076923076923) internal successors, (495), 373 states have internal predecessors, (495), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 07:43:48,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 513 transitions. [2024-11-09 07:43:48,958 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 513 transitions. Word has length 25 [2024-11-09 07:43:48,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:48,958 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 513 transitions. [2024-11-09 07:43:48,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:48,958 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 513 transitions. [2024-11-09 07:43:48,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:43:48,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:48,958 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:48,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 07:43:48,959 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:48,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:48,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1827200530, now seen corresponding path program 1 times [2024-11-09 07:43:48,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:48,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5035945] [2024-11-09 07:43:48,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:48,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:48,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:43:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:49,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:49,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:49,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5035945] [2024-11-09 07:43:49,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5035945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:49,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:49,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:43:49,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386024793] [2024-11-09 07:43:49,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:49,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:43:49,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:49,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:43:49,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:43:49,002 INFO L87 Difference]: Start difference. First operand 386 states and 513 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:49,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:49,022 INFO L93 Difference]: Finished difference Result 435 states and 576 transitions. [2024-11-09 07:43:49,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:43:49,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 26 [2024-11-09 07:43:49,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:49,024 INFO L225 Difference]: With dead ends: 435 [2024-11-09 07:43:49,024 INFO L226 Difference]: Without dead ends: 435 [2024-11-09 07:43:49,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:43:49,025 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 44 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:49,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 795 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:43:49,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-11-09 07:43:49,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 386. [2024-11-09 07:43:49,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 325 states have (on average 1.5138461538461538) internal successors, (492), 373 states have internal predecessors, (492), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 07:43:49,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 510 transitions. [2024-11-09 07:43:49,032 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 510 transitions. Word has length 26 [2024-11-09 07:43:49,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:49,032 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 510 transitions. [2024-11-09 07:43:49,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:49,032 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 510 transitions. [2024-11-09 07:43:49,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:43:49,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:49,032 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:49,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 07:43:49,033 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:49,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:49,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1470694413, now seen corresponding path program 1 times [2024-11-09 07:43:49,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:49,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344685374] [2024-11-09 07:43:49,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:49,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:49,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:43:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:49,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:49,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:49,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344685374] [2024-11-09 07:43:49,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344685374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:49,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:49,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:43:49,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377003245] [2024-11-09 07:43:49,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:49,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:43:49,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:49,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:43:49,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:43:49,089 INFO L87 Difference]: Start difference. First operand 386 states and 510 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:49,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:49,160 INFO L93 Difference]: Finished difference Result 464 states and 613 transitions. [2024-11-09 07:43:49,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:43:49,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 26 [2024-11-09 07:43:49,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:49,162 INFO L225 Difference]: With dead ends: 464 [2024-11-09 07:43:49,163 INFO L226 Difference]: Without dead ends: 464 [2024-11-09 07:43:49,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:43:49,163 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 56 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:49,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 261 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:43:49,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-11-09 07:43:49,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 386. [2024-11-09 07:43:49,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 325 states have (on average 1.5138461538461538) internal successors, (492), 373 states have internal predecessors, (492), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 07:43:49,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 510 transitions. [2024-11-09 07:43:49,171 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 510 transitions. Word has length 26 [2024-11-09 07:43:49,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:49,172 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 510 transitions. [2024-11-09 07:43:49,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:49,172 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 510 transitions. [2024-11-09 07:43:49,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:43:49,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:49,173 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:49,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 07:43:49,173 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:49,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:49,173 INFO L85 PathProgramCache]: Analyzing trace with hash -2123208305, now seen corresponding path program 1 times [2024-11-09 07:43:49,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:49,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360012755] [2024-11-09 07:43:49,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:49,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:49,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:43:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:49,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:49,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:49,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360012755] [2024-11-09 07:43:49,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360012755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:49,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:49,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:43:49,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898660207] [2024-11-09 07:43:49,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:49,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:43:49,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:49,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:43:49,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:43:49,218 INFO L87 Difference]: Start difference. First operand 386 states and 510 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:49,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:49,234 INFO L93 Difference]: Finished difference Result 313 states and 400 transitions. [2024-11-09 07:43:49,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:43:49,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 26 [2024-11-09 07:43:49,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:49,235 INFO L225 Difference]: With dead ends: 313 [2024-11-09 07:43:49,235 INFO L226 Difference]: Without dead ends: 313 [2024-11-09 07:43:49,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:43:49,236 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:49,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 805 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:43:49,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-09 07:43:49,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2024-11-09 07:43:49,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 253 states have (on average 1.5098814229249011) internal successors, (382), 300 states have internal predecessors, (382), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 07:43:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 400 transitions. [2024-11-09 07:43:49,241 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 400 transitions. Word has length 26 [2024-11-09 07:43:49,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:49,241 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 400 transitions. [2024-11-09 07:43:49,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:49,241 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 400 transitions. [2024-11-09 07:43:49,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:43:49,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:49,241 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:49,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 07:43:49,242 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:49,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:49,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1447437661, now seen corresponding path program 1 times [2024-11-09 07:43:49,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:49,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201608298] [2024-11-09 07:43:49,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:49,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:49,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:43:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:49,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:49,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:49,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201608298] [2024-11-09 07:43:49,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201608298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:49,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:49,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:43:49,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231749137] [2024-11-09 07:43:49,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:49,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:43:49,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:49,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:43:49,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:43:49,315 INFO L87 Difference]: Start difference. First operand 313 states and 400 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:49,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:49,411 INFO L93 Difference]: Finished difference Result 351 states and 446 transitions. [2024-11-09 07:43:49,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:43:49,412 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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 27 [2024-11-09 07:43:49,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:49,413 INFO L225 Difference]: With dead ends: 351 [2024-11-09 07:43:49,413 INFO L226 Difference]: Without dead ends: 351 [2024-11-09 07:43:49,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:43:49,413 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 14 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:49,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 681 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:43:49,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-09 07:43:49,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 345. [2024-11-09 07:43:49,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 285 states have (on average 1.4736842105263157) internal successors, (420), 332 states have internal predecessors, (420), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 07:43:49,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 438 transitions. [2024-11-09 07:43:49,419 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 438 transitions. Word has length 27 [2024-11-09 07:43:49,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:49,419 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 438 transitions. [2024-11-09 07:43:49,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:49,419 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 438 transitions. [2024-11-09 07:43:49,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:43:49,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:49,419 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:49,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 07:43:49,420 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:49,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:49,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1447437467, now seen corresponding path program 1 times [2024-11-09 07:43:49,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:49,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974839178] [2024-11-09 07:43:49,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:49,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:49,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:43:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:49,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:49,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:49,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974839178] [2024-11-09 07:43:49,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974839178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:49,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:49,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:43:49,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386773883] [2024-11-09 07:43:49,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:49,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:43:49,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:49,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:43:49,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:43:49,471 INFO L87 Difference]: Start difference. First operand 345 states and 438 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:49,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:49,513 INFO L93 Difference]: Finished difference Result 492 states and 635 transitions. [2024-11-09 07:43:49,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:43:49,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 27 [2024-11-09 07:43:49,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:49,515 INFO L225 Difference]: With dead ends: 492 [2024-11-09 07:43:49,516 INFO L226 Difference]: Without dead ends: 492 [2024-11-09 07:43:49,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:43:49,516 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 82 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:49,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 426 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:43:49,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2024-11-09 07:43:49,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 457. [2024-11-09 07:43:49,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 397 states have (on average 1.4534005037783375) internal successors, (577), 444 states have internal predecessors, (577), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 07:43:49,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 595 transitions. [2024-11-09 07:43:49,523 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 595 transitions. Word has length 27 [2024-11-09 07:43:49,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:49,523 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 595 transitions. [2024-11-09 07:43:49,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:49,523 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 595 transitions. [2024-11-09 07:43:49,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:43:49,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:49,524 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:49,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 07:43:49,524 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:49,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:49,524 INFO L85 PathProgramCache]: Analyzing trace with hash 293091951, now seen corresponding path program 1 times [2024-11-09 07:43:49,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:49,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641381033] [2024-11-09 07:43:49,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:49,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:49,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:43:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:49,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:49,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:49,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641381033] [2024-11-09 07:43:49,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641381033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:49,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:49,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:43:49,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647792051] [2024-11-09 07:43:49,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:49,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:43:49,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:49,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:43:49,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:43:49,573 INFO L87 Difference]: Start difference. First operand 457 states and 595 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:49,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:49,659 INFO L93 Difference]: Finished difference Result 492 states and 627 transitions. [2024-11-09 07:43:49,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:43:49,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 28 [2024-11-09 07:43:49,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:49,661 INFO L225 Difference]: With dead ends: 492 [2024-11-09 07:43:49,661 INFO L226 Difference]: Without dead ends: 492 [2024-11-09 07:43:49,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:43:49,662 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 67 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:49,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 352 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:43:49,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2024-11-09 07:43:49,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 344. [2024-11-09 07:43:49,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 285 states have (on average 1.4456140350877194) internal successors, (412), 331 states have internal predecessors, (412), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 07:43:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 430 transitions. [2024-11-09 07:43:49,667 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 430 transitions. Word has length 28 [2024-11-09 07:43:49,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:49,668 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 430 transitions. [2024-11-09 07:43:49,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:49,668 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 430 transitions. [2024-11-09 07:43:49,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 07:43:49,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:49,668 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:49,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 07:43:49,668 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:49,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:49,669 INFO L85 PathProgramCache]: Analyzing trace with hash -417408815, now seen corresponding path program 1 times [2024-11-09 07:43:49,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:49,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300568985] [2024-11-09 07:43:49,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:49,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:49,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:43:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:49,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:49,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:49,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300568985] [2024-11-09 07:43:49,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300568985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:49,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:49,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:43:49,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268973265] [2024-11-09 07:43:49,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:49,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:43:49,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:49,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:43:49,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:43:49,772 INFO L87 Difference]: Start difference. First operand 344 states and 430 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:49,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:49,867 INFO L93 Difference]: Finished difference Result 345 states and 430 transitions. [2024-11-09 07:43:49,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:43:49,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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 33 [2024-11-09 07:43:49,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:49,869 INFO L225 Difference]: With dead ends: 345 [2024-11-09 07:43:49,869 INFO L226 Difference]: Without dead ends: 345 [2024-11-09 07:43:49,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:43:49,870 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 40 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:49,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 421 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:43:49,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-09 07:43:49,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2024-11-09 07:43:49,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 285 states have (on average 1.4385964912280702) internal successors, (410), 330 states have internal predecessors, (410), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 07:43:49,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 428 transitions. [2024-11-09 07:43:49,877 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 428 transitions. Word has length 33 [2024-11-09 07:43:49,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:49,877 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 428 transitions. [2024-11-09 07:43:49,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:49,877 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 428 transitions. [2024-11-09 07:43:49,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 07:43:49,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:49,879 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:49,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 07:43:49,879 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:49,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:49,880 INFO L85 PathProgramCache]: Analyzing trace with hash -417408816, now seen corresponding path program 1 times [2024-11-09 07:43:49,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:49,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142682912] [2024-11-09 07:43:49,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:49,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:49,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:43:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:49,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:49,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:49,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142682912] [2024-11-09 07:43:49,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142682912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:49,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:49,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:43:49,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033765996] [2024-11-09 07:43:49,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:49,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:43:49,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:49,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:43:49,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:43:49,940 INFO L87 Difference]: Start difference. First operand 343 states and 428 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:50,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:50,034 INFO L93 Difference]: Finished difference Result 344 states and 428 transitions. [2024-11-09 07:43:50,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:43:50,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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 33 [2024-11-09 07:43:50,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:50,035 INFO L225 Difference]: With dead ends: 344 [2024-11-09 07:43:50,035 INFO L226 Difference]: Without dead ends: 344 [2024-11-09 07:43:50,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:43:50,037 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 52 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:50,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 409 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:43:50,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-09 07:43:50,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 342. [2024-11-09 07:43:50,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 285 states have (on average 1.431578947368421) internal successors, (408), 329 states have internal predecessors, (408), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 07:43:50,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 426 transitions. [2024-11-09 07:43:50,043 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 426 transitions. Word has length 33 [2024-11-09 07:43:50,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:50,043 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 426 transitions. [2024-11-09 07:43:50,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:50,043 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 426 transitions. [2024-11-09 07:43:50,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:43:50,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:50,044 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:50,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 07:43:50,044 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:50,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:50,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1697910415, now seen corresponding path program 1 times [2024-11-09 07:43:50,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:50,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243036819] [2024-11-09 07:43:50,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:50,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:50,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:43:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:50,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:50,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:50,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243036819] [2024-11-09 07:43:50,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243036819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:50,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:50,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:43:50,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742388270] [2024-11-09 07:43:50,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:50,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:43:50,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:50,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:43:50,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:43:50,105 INFO L87 Difference]: Start difference. First operand 342 states and 426 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:50,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:50,174 INFO L93 Difference]: Finished difference Result 348 states and 422 transitions. [2024-11-09 07:43:50,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:43:50,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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 35 [2024-11-09 07:43:50,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:50,175 INFO L225 Difference]: With dead ends: 348 [2024-11-09 07:43:50,175 INFO L226 Difference]: Without dead ends: 348 [2024-11-09 07:43:50,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:43:50,175 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 98 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:50,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 327 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:43:50,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-09 07:43:50,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 339. [2024-11-09 07:43:50,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 285 states have (on average 1.4105263157894736) internal successors, (402), 326 states have internal predecessors, (402), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 07:43:50,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 420 transitions. [2024-11-09 07:43:50,182 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 420 transitions. Word has length 35 [2024-11-09 07:43:50,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:50,182 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 420 transitions. [2024-11-09 07:43:50,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:50,182 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 420 transitions. [2024-11-09 07:43:50,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:43:50,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:50,182 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:50,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 07:43:50,183 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:50,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:50,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1697910414, now seen corresponding path program 1 times [2024-11-09 07:43:50,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:50,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480393873] [2024-11-09 07:43:50,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:50,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:50,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:43:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:50,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:50,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:50,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480393873] [2024-11-09 07:43:50,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480393873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:50,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:50,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:43:50,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243552562] [2024-11-09 07:43:50,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:50,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:43:50,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:50,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:43:50,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:43:50,269 INFO L87 Difference]: Start difference. First operand 339 states and 420 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:50,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:50,361 INFO L93 Difference]: Finished difference Result 347 states and 420 transitions. [2024-11-09 07:43:50,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:43:50,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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 35 [2024-11-09 07:43:50,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:50,362 INFO L225 Difference]: With dead ends: 347 [2024-11-09 07:43:50,362 INFO L226 Difference]: Without dead ends: 347 [2024-11-09 07:43:50,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:43:50,363 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 263 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:50,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 310 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:43:50,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-09 07:43:50,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 338. [2024-11-09 07:43:50,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 285 states have (on average 1.4035087719298245) internal successors, (400), 325 states have internal predecessors, (400), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 07:43:50,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 418 transitions. [2024-11-09 07:43:50,368 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 418 transitions. Word has length 35 [2024-11-09 07:43:50,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:50,368 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 418 transitions. [2024-11-09 07:43:50,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:50,368 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 418 transitions. [2024-11-09 07:43:50,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:43:50,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:50,369 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:50,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 07:43:50,369 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:50,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:50,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1697910253, now seen corresponding path program 1 times [2024-11-09 07:43:50,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:50,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257479957] [2024-11-09 07:43:50,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:50,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:50,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:43:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:50,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:50,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:50,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257479957] [2024-11-09 07:43:50,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257479957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:50,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:50,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 07:43:50,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494495670] [2024-11-09 07:43:50,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:50,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 07:43:50,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:50,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 07:43:50,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:43:50,821 INFO L87 Difference]: Start difference. First operand 338 states and 418 transitions. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 14 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:51,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:51,234 INFO L93 Difference]: Finished difference Result 438 states and 535 transitions. [2024-11-09 07:43:51,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:43:51,234 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 14 states have internal predecessors, (33), 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 35 [2024-11-09 07:43:51,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:51,236 INFO L225 Difference]: With dead ends: 438 [2024-11-09 07:43:51,236 INFO L226 Difference]: Without dead ends: 438 [2024-11-09 07:43:51,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2024-11-09 07:43:51,236 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 297 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:51,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 761 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:43:51,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-09 07:43:51,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 408. [2024-11-09 07:43:51,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 355 states have (on average 1.371830985915493) internal successors, (487), 395 states have internal predecessors, (487), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 07:43:51,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 505 transitions. [2024-11-09 07:43:51,242 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 505 transitions. Word has length 35 [2024-11-09 07:43:51,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:51,243 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 505 transitions. [2024-11-09 07:43:51,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 14 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:51,243 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 505 transitions. [2024-11-09 07:43:51,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 07:43:51,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:51,243 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:51,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 07:43:51,243 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:51,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:51,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1095615204, now seen corresponding path program 1 times [2024-11-09 07:43:51,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:51,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474775667] [2024-11-09 07:43:51,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:51,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:51,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:43:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:51,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:51,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:51,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474775667] [2024-11-09 07:43:51,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474775667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:51,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:51,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:43:51,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747563225] [2024-11-09 07:43:51,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:51,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:43:51,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:51,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:43:51,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:43:51,373 INFO L87 Difference]: Start difference. First operand 408 states and 505 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:51,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:51,439 INFO L93 Difference]: Finished difference Result 408 states and 503 transitions. [2024-11-09 07:43:51,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:43:51,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2024-11-09 07:43:51,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:51,441 INFO L225 Difference]: With dead ends: 408 [2024-11-09 07:43:51,441 INFO L226 Difference]: Without dead ends: 408 [2024-11-09 07:43:51,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:43:51,441 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 177 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:51,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 175 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:43:51,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-09 07:43:51,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 336. [2024-11-09 07:43:51,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 285 states have (on average 1.3894736842105264) internal successors, (396), 323 states have internal predecessors, (396), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 07:43:51,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 414 transitions. [2024-11-09 07:43:51,446 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 414 transitions. Word has length 36 [2024-11-09 07:43:51,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:51,446 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 414 transitions. [2024-11-09 07:43:51,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:51,447 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 414 transitions. [2024-11-09 07:43:51,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 07:43:51,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:51,447 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:51,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-09 07:43:51,447 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:51,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:51,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1314168092, now seen corresponding path program 1 times [2024-11-09 07:43:51,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:51,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407286057] [2024-11-09 07:43:51,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:51,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:51,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:43:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:51,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:51,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:51,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407286057] [2024-11-09 07:43:51,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407286057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:51,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:51,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:43:51,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399550924] [2024-11-09 07:43:51,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:51,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:43:51,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:51,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:43:51,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:43:51,874 INFO L87 Difference]: Start difference. First operand 336 states and 414 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:52,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:52,324 INFO L93 Difference]: Finished difference Result 451 states and 519 transitions. [2024-11-09 07:43:52,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:43:52,324 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 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 49 [2024-11-09 07:43:52,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:52,326 INFO L225 Difference]: With dead ends: 451 [2024-11-09 07:43:52,326 INFO L226 Difference]: Without dead ends: 451 [2024-11-09 07:43:52,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2024-11-09 07:43:52,326 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 273 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:52,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 730 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:43:52,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-11-09 07:43:52,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 370. [2024-11-09 07:43:52,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 319 states have (on average 1.3667711598746082) internal successors, (436), 357 states have internal predecessors, (436), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 07:43:52,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 454 transitions. [2024-11-09 07:43:52,335 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 454 transitions. Word has length 49 [2024-11-09 07:43:52,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:52,335 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 454 transitions. [2024-11-09 07:43:52,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:52,335 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 454 transitions. [2024-11-09 07:43:52,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 07:43:52,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:52,336 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:52,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-09 07:43:52,336 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:52,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:52,336 INFO L85 PathProgramCache]: Analyzing trace with hash 2078878253, now seen corresponding path program 1 times [2024-11-09 07:43:52,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:52,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911630412] [2024-11-09 07:43:52,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:52,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:52,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:52,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:43:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:52,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:52,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:52,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911630412] [2024-11-09 07:43:52,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911630412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:52,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:52,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:43:52,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323888048] [2024-11-09 07:43:52,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:52,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:43:52,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:52,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:43:52,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:43:52,878 INFO L87 Difference]: Start difference. First operand 370 states and 454 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:53,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:53,173 INFO L93 Difference]: Finished difference Result 397 states and 481 transitions. [2024-11-09 07:43:53,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:43:53,174 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 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 50 [2024-11-09 07:43:53,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:53,175 INFO L225 Difference]: With dead ends: 397 [2024-11-09 07:43:53,175 INFO L226 Difference]: Without dead ends: 397 [2024-11-09 07:43:53,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:43:53,175 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 75 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:53,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 872 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:43:53,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-09 07:43:53,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 388. [2024-11-09 07:43:53,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 337 states have (on average 1.3471810089020773) internal successors, (454), 375 states have internal predecessors, (454), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 07:43:53,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 472 transitions. [2024-11-09 07:43:53,181 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 472 transitions. Word has length 50 [2024-11-09 07:43:53,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:53,181 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 472 transitions. [2024-11-09 07:43:53,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:53,181 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 472 transitions. [2024-11-09 07:43:53,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 07:43:53,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:53,182 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:53,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-09 07:43:53,182 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:53,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:53,182 INFO L85 PathProgramCache]: Analyzing trace with hash -457671058, now seen corresponding path program 1 times [2024-11-09 07:43:53,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:53,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207638835] [2024-11-09 07:43:53,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:53,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:53,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:43:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:53,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:53,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:53,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207638835] [2024-11-09 07:43:53,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207638835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:53,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:53,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 07:43:53,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754864376] [2024-11-09 07:43:53,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:53,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 07:43:53,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:53,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 07:43:53,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:43:53,957 INFO L87 Difference]: Start difference. First operand 388 states and 472 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:54,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:54,604 INFO L93 Difference]: Finished difference Result 404 states and 488 transitions. [2024-11-09 07:43:54,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:43:54,604 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 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 50 [2024-11-09 07:43:54,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:54,606 INFO L225 Difference]: With dead ends: 404 [2024-11-09 07:43:54,606 INFO L226 Difference]: Without dead ends: 404 [2024-11-09 07:43:54,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-11-09 07:43:54,606 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 53 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:54,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1415 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:43:54,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-09 07:43:54,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 388. [2024-11-09 07:43:54,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 337 states have (on average 1.3471810089020773) internal successors, (454), 375 states have internal predecessors, (454), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 07:43:54,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 472 transitions. [2024-11-09 07:43:54,611 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 472 transitions. Word has length 50 [2024-11-09 07:43:54,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:54,612 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 472 transitions. [2024-11-09 07:43:54,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:54,612 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 472 transitions. [2024-11-09 07:43:54,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 07:43:54,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:54,612 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:54,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-09 07:43:54,612 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:54,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:54,612 INFO L85 PathProgramCache]: Analyzing trace with hash 267567628, now seen corresponding path program 1 times [2024-11-09 07:43:54,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:54,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078975753] [2024-11-09 07:43:54,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:54,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:54,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:43:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:54,866 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:54,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:54,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078975753] [2024-11-09 07:43:54,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078975753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:54,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:54,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:43:54,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756607650] [2024-11-09 07:43:54,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:54,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:43:54,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:54,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:43:54,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:43:54,869 INFO L87 Difference]: Start difference. First operand 388 states and 472 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:55,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:55,129 INFO L93 Difference]: Finished difference Result 631 states and 769 transitions. [2024-11-09 07:43:55,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:43:55,130 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 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 51 [2024-11-09 07:43:55,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:55,131 INFO L225 Difference]: With dead ends: 631 [2024-11-09 07:43:55,131 INFO L226 Difference]: Without dead ends: 631 [2024-11-09 07:43:55,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-11-09 07:43:55,132 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 393 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:55,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 774 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:43:55,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-09 07:43:55,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 452. [2024-11-09 07:43:55,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 394 states have (on average 1.3451776649746192) internal successors, (530), 435 states have internal predecessors, (530), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-09 07:43:55,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 560 transitions. [2024-11-09 07:43:55,139 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 560 transitions. Word has length 51 [2024-11-09 07:43:55,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:55,140 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 560 transitions. [2024-11-09 07:43:55,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:55,140 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 560 transitions. [2024-11-09 07:43:55,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 07:43:55,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:55,140 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:55,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-09 07:43:55,141 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:55,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:55,141 INFO L85 PathProgramCache]: Analyzing trace with hash 267567629, now seen corresponding path program 1 times [2024-11-09 07:43:55,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:55,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283425454] [2024-11-09 07:43:55,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:55,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:55,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:43:55,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:55,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:55,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:55,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283425454] [2024-11-09 07:43:55,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283425454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:55,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:55,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 07:43:55,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930574571] [2024-11-09 07:43:55,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:55,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:43:55,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:55,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:43:55,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:43:55,584 INFO L87 Difference]: Start difference. First operand 452 states and 560 transitions. Second operand has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:56,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:56,038 INFO L93 Difference]: Finished difference Result 674 states and 827 transitions. [2024-11-09 07:43:56,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:43:56,039 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 states have internal predecessors, (49), 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 51 [2024-11-09 07:43:56,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:56,041 INFO L225 Difference]: With dead ends: 674 [2024-11-09 07:43:56,041 INFO L226 Difference]: Without dead ends: 674 [2024-11-09 07:43:56,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2024-11-09 07:43:56,041 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 364 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:56,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 1032 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:43:56,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2024-11-09 07:43:56,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 502. [2024-11-09 07:43:56,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 440 states have (on average 1.3636363636363635) internal successors, (600), 483 states have internal predecessors, (600), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2024-11-09 07:43:56,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 636 transitions. [2024-11-09 07:43:56,052 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 636 transitions. Word has length 51 [2024-11-09 07:43:56,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:56,053 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 636 transitions. [2024-11-09 07:43:56,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:56,053 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 636 transitions. [2024-11-09 07:43:56,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 07:43:56,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:56,053 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:56,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-09 07:43:56,053 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:56,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:56,054 INFO L85 PathProgramCache]: Analyzing trace with hash 269414670, now seen corresponding path program 1 times [2024-11-09 07:43:56,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:56,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466384551] [2024-11-09 07:43:56,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:56,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:57,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:43:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:57,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:57,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:57,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466384551] [2024-11-09 07:43:57,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466384551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:43:57,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124305107] [2024-11-09 07:43:57,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:57,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:43:57,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:43:57,165 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:43:57,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:43:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:57,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 07:43:57,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:43:57,616 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-09 07:43:57,811 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:43:57,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 07:43:57,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:57,835 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:43:57,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124305107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:57,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:43:57,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [17] total 24 [2024-11-09 07:43:57,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349745672] [2024-11-09 07:43:57,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:57,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:43:57,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:57,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:43:57,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2024-11-09 07:43:57,837 INFO L87 Difference]: Start difference. First operand 502 states and 636 transitions. Second operand has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:58,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:58,267 INFO L93 Difference]: Finished difference Result 739 states and 924 transitions. [2024-11-09 07:43:58,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:43:58,268 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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 51 [2024-11-09 07:43:58,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:58,270 INFO L225 Difference]: With dead ends: 739 [2024-11-09 07:43:58,270 INFO L226 Difference]: Without dead ends: 739 [2024-11-09 07:43:58,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2024-11-09 07:43:58,271 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 330 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:58,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 795 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:43:58,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2024-11-09 07:43:58,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 561. [2024-11-09 07:43:58,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 491 states have (on average 1.3625254582484725) internal successors, (669), 538 states have internal predecessors, (669), 16 states have call successors, (16), 8 states have call predecessors, (16), 16 states have return successors, (32), 14 states have call predecessors, (32), 16 states have call successors, (32) [2024-11-09 07:43:58,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 717 transitions. [2024-11-09 07:43:58,280 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 717 transitions. Word has length 51 [2024-11-09 07:43:58,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:58,281 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 717 transitions. [2024-11-09 07:43:58,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:43:58,281 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 717 transitions. [2024-11-09 07:43:58,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 07:43:58,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:58,282 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:58,303 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-09 07:43:58,483 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,SelfDestructingSolverStorable38 [2024-11-09 07:43:58,483 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:43:58,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:58,483 INFO L85 PathProgramCache]: Analyzing trace with hash 269414671, now seen corresponding path program 1 times [2024-11-09 07:43:58,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:58,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287487761] [2024-11-09 07:43:58,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:58,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:59,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:43:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:59,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:59,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:59,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287487761] [2024-11-09 07:43:59,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287487761] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:43:59,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863283571] [2024-11-09 07:43:59,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:59,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:43:59,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:43:59,608 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:43:59,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:43:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:59,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 07:43:59,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:43:59,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:44:00,166 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-09 07:44:00,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:44:00,425 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:44:00,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 07:44:00,433 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:44:00,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-09 07:44:00,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:00,502 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:44:00,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863283571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:44:00,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:44:00,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 28 [2024-11-09 07:44:00,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002789553] [2024-11-09 07:44:00,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:44:00,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:44:00,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:44:00,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:44:00,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2024-11-09 07:44:00,503 INFO L87 Difference]: Start difference. First operand 561 states and 717 transitions. Second operand has 11 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:44:01,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:44:01,008 INFO L93 Difference]: Finished difference Result 789 states and 994 transitions. [2024-11-09 07:44:01,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:44:01,008 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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 51 [2024-11-09 07:44:01,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:44:01,010 INFO L225 Difference]: With dead ends: 789 [2024-11-09 07:44:01,010 INFO L226 Difference]: Without dead ends: 789 [2024-11-09 07:44:01,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=94, Invalid=898, Unknown=0, NotChecked=0, Total=992 [2024-11-09 07:44:01,011 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 295 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:44:01,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1042 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:44:01,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2024-11-09 07:44:01,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 600. [2024-11-09 07:44:01,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 526 states have (on average 1.3745247148288973) internal successors, (723), 575 states have internal predecessors, (723), 18 states have call successors, (18), 9 states have call predecessors, (18), 18 states have return successors, (36), 15 states have call predecessors, (36), 18 states have call successors, (36) [2024-11-09 07:44:01,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 777 transitions. [2024-11-09 07:44:01,020 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 777 transitions. Word has length 51 [2024-11-09 07:44:01,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:44:01,020 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 777 transitions. [2024-11-09 07:44:01,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:44:01,020 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 777 transitions. [2024-11-09 07:44:01,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 07:44:01,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:44:01,021 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:44:01,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 07:44:01,221 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,SelfDestructingSolverStorable39 [2024-11-09 07:44:01,221 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:44:01,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:44:01,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1432637723, now seen corresponding path program 1 times [2024-11-09 07:44:01,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:44:01,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872416099] [2024-11-09 07:44:01,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:01,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:44:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:01,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:44:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:01,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:01,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:44:01,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872416099] [2024-11-09 07:44:01,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872416099] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:44:01,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844860719] [2024-11-09 07:44:01,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:01,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:44:01,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:44:01,572 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:44:01,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:44:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:01,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-09 07:44:01,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:44:02,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:44:02,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:44:02,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2024-11-09 07:44:02,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:44:02,305 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-09 07:44:02,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:02,309 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:44:02,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844860719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:44:02,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:44:02,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 25 [2024-11-09 07:44:02,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172482170] [2024-11-09 07:44:02,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:44:02,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 07:44:02,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:44:02,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 07:44:02,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2024-11-09 07:44:02,310 INFO L87 Difference]: Start difference. First operand 600 states and 777 transitions. Second operand has 15 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:44:02,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:44:02,986 INFO L93 Difference]: Finished difference Result 1014 states and 1292 transitions. [2024-11-09 07:44:02,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 07:44:02,986 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 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 51 [2024-11-09 07:44:02,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:44:02,990 INFO L225 Difference]: With dead ends: 1014 [2024-11-09 07:44:02,991 INFO L226 Difference]: Without dead ends: 1014 [2024-11-09 07:44:02,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=918, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 07:44:03,007 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 297 mSDsluCounter, 2236 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 2507 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:44:03,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 2507 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1209 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:44:03,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2024-11-09 07:44:03,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 727. [2024-11-09 07:44:03,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 645 states have (on average 1.365891472868217) internal successors, (881), 698 states have internal predecessors, (881), 22 states have call successors, (22), 11 states have call predecessors, (22), 22 states have return successors, (44), 17 states have call predecessors, (44), 22 states have call successors, (44) [2024-11-09 07:44:03,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 947 transitions. [2024-11-09 07:44:03,020 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 947 transitions. Word has length 51 [2024-11-09 07:44:03,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:44:03,020 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 947 transitions. [2024-11-09 07:44:03,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:44:03,020 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 947 transitions. [2024-11-09 07:44:03,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 07:44:03,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:44:03,021 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:44:03,039 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-09 07:44:03,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:44:03,225 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:44:03,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:44:03,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1432637722, now seen corresponding path program 1 times [2024-11-09 07:44:03,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:44:03,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427358362] [2024-11-09 07:44:03,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:03,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:44:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:03,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:44:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:03,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:03,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:44:03,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427358362] [2024-11-09 07:44:03,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427358362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:44:03,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:44:03,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:44:03,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161854351] [2024-11-09 07:44:03,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:44:03,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:44:03,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:44:03,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:44:03,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:44:03,821 INFO L87 Difference]: Start difference. First operand 727 states and 947 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:44:04,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:44:04,487 INFO L93 Difference]: Finished difference Result 1077 states and 1372 transitions. [2024-11-09 07:44:04,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:44:04,489 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 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 51 [2024-11-09 07:44:04,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:44:04,492 INFO L225 Difference]: With dead ends: 1077 [2024-11-09 07:44:04,492 INFO L226 Difference]: Without dead ends: 1077 [2024-11-09 07:44:04,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2024-11-09 07:44:04,495 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 370 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:44:04,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1486 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:44:04,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2024-11-09 07:44:04,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 745. [2024-11-09 07:44:04,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 663 states have (on average 1.3755656108597285) internal successors, (912), 716 states have internal predecessors, (912), 22 states have call successors, (22), 11 states have call predecessors, (22), 22 states have return successors, (44), 17 states have call predecessors, (44), 22 states have call successors, (44) [2024-11-09 07:44:04,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 978 transitions. [2024-11-09 07:44:04,507 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 978 transitions. Word has length 51 [2024-11-09 07:44:04,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:44:04,507 INFO L471 AbstractCegarLoop]: Abstraction has 745 states and 978 transitions. [2024-11-09 07:44:04,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:44:04,507 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 978 transitions. [2024-11-09 07:44:04,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 07:44:04,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:44:04,508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:44:04,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-09 07:44:04,508 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:44:04,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:44:04,508 INFO L85 PathProgramCache]: Analyzing trace with hash -295339386, now seen corresponding path program 1 times [2024-11-09 07:44:04,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:44:04,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645243656] [2024-11-09 07:44:04,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:04,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:44:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:05,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:44:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:05,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:05,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:44:05,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645243656] [2024-11-09 07:44:05,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645243656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:44:05,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:44:05,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 07:44:05,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021562050] [2024-11-09 07:44:05,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:44:05,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 07:44:05,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:44:05,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 07:44:05,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:44:05,091 INFO L87 Difference]: Start difference. First operand 745 states and 978 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:44:05,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:44:05,430 INFO L93 Difference]: Finished difference Result 1269 states and 1656 transitions. [2024-11-09 07:44:05,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 07:44:05,430 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 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 52 [2024-11-09 07:44:05,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:44:05,433 INFO L225 Difference]: With dead ends: 1269 [2024-11-09 07:44:05,434 INFO L226 Difference]: Without dead ends: 1269 [2024-11-09 07:44:05,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2024-11-09 07:44:05,434 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 404 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:44:05,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1508 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:44:05,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2024-11-09 07:44:05,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1046. [2024-11-09 07:44:05,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 932 states have (on average 1.3873390557939915) internal successors, (1293), 1001 states have internal predecessors, (1293), 38 states have call successors, (38), 19 states have call predecessors, (38), 38 states have return successors, (76), 25 states have call predecessors, (76), 38 states have call successors, (76) [2024-11-09 07:44:05,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1407 transitions. [2024-11-09 07:44:05,447 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1407 transitions. Word has length 52 [2024-11-09 07:44:05,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:44:05,447 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1407 transitions. [2024-11-09 07:44:05,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:44:05,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1407 transitions. [2024-11-09 07:44:05,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 07:44:05,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:44:05,447 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:44:05,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-09 07:44:05,447 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:44:05,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:44:05,448 INFO L85 PathProgramCache]: Analyzing trace with hash -238081084, now seen corresponding path program 1 times [2024-11-09 07:44:05,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:44:05,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324599428] [2024-11-09 07:44:05,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:05,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:44:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:05,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:44:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:05,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:05,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:44:05,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324599428] [2024-11-09 07:44:05,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324599428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:44:05,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:44:05,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:44:05,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852726234] [2024-11-09 07:44:05,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:44:05,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:44:05,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:44:05,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:44:05,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:44:05,621 INFO L87 Difference]: Start difference. First operand 1046 states and 1407 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:44:05,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:44:05,829 INFO L93 Difference]: Finished difference Result 1519 states and 2029 transitions. [2024-11-09 07:44:05,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:44:05,830 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 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 52 [2024-11-09 07:44:05,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:44:05,833 INFO L225 Difference]: With dead ends: 1519 [2024-11-09 07:44:05,833 INFO L226 Difference]: Without dead ends: 1519 [2024-11-09 07:44:05,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:44:05,834 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 300 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:44:05,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1165 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:44:05,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2024-11-09 07:44:05,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1288. [2024-11-09 07:44:05,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 1146 states have (on average 1.3979057591623036) internal successors, (1602), 1229 states have internal predecessors, (1602), 52 states have call successors, (52), 26 states have call predecessors, (52), 52 states have return successors, (104), 32 states have call predecessors, (104), 52 states have call successors, (104) [2024-11-09 07:44:05,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1758 transitions. [2024-11-09 07:44:05,849 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1758 transitions. Word has length 52 [2024-11-09 07:44:05,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:44:05,849 INFO L471 AbstractCegarLoop]: Abstraction has 1288 states and 1758 transitions. [2024-11-09 07:44:05,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:44:05,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1758 transitions. [2024-11-09 07:44:05,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 07:44:05,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:44:05,850 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:44:05,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-09 07:44:05,850 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:44:05,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:44:05,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1519356017, now seen corresponding path program 1 times [2024-11-09 07:44:05,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:44:05,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822507492] [2024-11-09 07:44:05,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:05,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:44:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:06,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:44:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:06,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:06,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:44:06,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822507492] [2024-11-09 07:44:06,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822507492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:44:06,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:44:06,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:44:06,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996227563] [2024-11-09 07:44:06,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:44:06,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:44:06,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:44:06,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:44:06,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:44:06,039 INFO L87 Difference]: Start difference. First operand 1288 states and 1758 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:44:06,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:44:06,272 INFO L93 Difference]: Finished difference Result 1502 states and 2006 transitions. [2024-11-09 07:44:06,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:44:06,273 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 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 52 [2024-11-09 07:44:06,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:44:06,276 INFO L225 Difference]: With dead ends: 1502 [2024-11-09 07:44:06,276 INFO L226 Difference]: Without dead ends: 1502 [2024-11-09 07:44:06,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:44:06,277 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 375 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:44:06,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1226 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:44:06,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2024-11-09 07:44:06,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1084. [2024-11-09 07:44:06,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 966 states have (on average 1.3933747412008282) internal successors, (1346), 1037 states have internal predecessors, (1346), 40 states have call successors, (40), 20 states have call predecessors, (40), 40 states have return successors, (80), 26 states have call predecessors, (80), 40 states have call successors, (80) [2024-11-09 07:44:06,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1466 transitions. [2024-11-09 07:44:06,292 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1466 transitions. Word has length 52 [2024-11-09 07:44:06,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:44:06,292 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1466 transitions. [2024-11-09 07:44:06,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:44:06,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1466 transitions. [2024-11-09 07:44:06,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 07:44:06,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:44:06,293 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:44:06,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-09 07:44:06,293 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:44:06,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:44:06,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1462097715, now seen corresponding path program 1 times [2024-11-09 07:44:06,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:44:06,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235586068] [2024-11-09 07:44:06,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:06,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:44:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:06,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:44:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:06,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:06,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:44:06,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235586068] [2024-11-09 07:44:06,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235586068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:44:06,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:44:06,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:44:06,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913703955] [2024-11-09 07:44:06,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:44:06,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:44:06,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:44:06,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:44:06,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:44:06,459 INFO L87 Difference]: Start difference. First operand 1084 states and 1466 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:44:06,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:44:06,686 INFO L93 Difference]: Finished difference Result 1335 states and 1769 transitions. [2024-11-09 07:44:06,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:44:06,686 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 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 52 [2024-11-09 07:44:06,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:44:06,689 INFO L225 Difference]: With dead ends: 1335 [2024-11-09 07:44:06,689 INFO L226 Difference]: Without dead ends: 1335 [2024-11-09 07:44:06,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:44:06,690 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 257 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:44:06,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1191 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:44:06,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2024-11-09 07:44:06,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 879. [2024-11-09 07:44:06,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 785 states have (on average 1.3859872611464967) internal successors, (1088), 844 states have internal predecessors, (1088), 28 states have call successors, (28), 14 states have call predecessors, (28), 28 states have return successors, (56), 20 states have call predecessors, (56), 28 states have call successors, (56) [2024-11-09 07:44:06,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1172 transitions. [2024-11-09 07:44:06,706 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1172 transitions. Word has length 52 [2024-11-09 07:44:06,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:44:06,707 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1172 transitions. [2024-11-09 07:44:06,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:44:06,707 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1172 transitions. [2024-11-09 07:44:06,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 07:44:06,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:44:06,707 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:44:06,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-09 07:44:06,708 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:44:06,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:44:06,708 INFO L85 PathProgramCache]: Analyzing trace with hash -351851286, now seen corresponding path program 1 times [2024-11-09 07:44:06,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:44:06,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575579463] [2024-11-09 07:44:06,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:06,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:44:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:07,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:44:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:07,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:07,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:44:07,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575579463] [2024-11-09 07:44:07,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575579463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:44:07,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:44:07,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 07:44:07,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211553588] [2024-11-09 07:44:07,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:44:07,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 07:44:07,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:44:07,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 07:44:07,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:44:07,218 INFO L87 Difference]: Start difference. First operand 879 states and 1172 transitions. Second operand has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:44:07,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:44:07,796 INFO L93 Difference]: Finished difference Result 1317 states and 1724 transitions. [2024-11-09 07:44:07,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 07:44:07,796 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2024-11-09 07:44:07,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:44:07,800 INFO L225 Difference]: With dead ends: 1317 [2024-11-09 07:44:07,800 INFO L226 Difference]: Without dead ends: 1317 [2024-11-09 07:44:07,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2024-11-09 07:44:07,800 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 460 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:44:07,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1326 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:44:07,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2024-11-09 07:44:07,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1102. [2024-11-09 07:44:07,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 984 states have (on average 1.3922764227642277) internal successors, (1370), 1055 states have internal predecessors, (1370), 40 states have call successors, (40), 20 states have call predecessors, (40), 40 states have return successors, (80), 26 states have call predecessors, (80), 40 states have call successors, (80) [2024-11-09 07:44:07,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1490 transitions. [2024-11-09 07:44:07,817 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1490 transitions. Word has length 54 [2024-11-09 07:44:07,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:44:07,817 INFO L471 AbstractCegarLoop]: Abstraction has 1102 states and 1490 transitions. [2024-11-09 07:44:07,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:44:07,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1490 transitions. [2024-11-09 07:44:07,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 07:44:07,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:44:07,818 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:44:07,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-09 07:44:07,818 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:44:07,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:44:07,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1161197912, now seen corresponding path program 1 times [2024-11-09 07:44:07,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:44:07,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410297490] [2024-11-09 07:44:07,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:07,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:44:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:08,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:44:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:08,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:08,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:44:08,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410297490] [2024-11-09 07:44:08,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410297490] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:44:08,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664711574] [2024-11-09 07:44:08,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:08,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:44:08,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:44:08,849 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:44:08,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:44:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:08,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 07:44:08,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:44:09,292 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-09 07:44:09,438 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:44:09,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 07:44:09,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:09,469 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:44:09,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664711574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:44:09,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:44:09,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 27 [2024-11-09 07:44:09,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572599000] [2024-11-09 07:44:09,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:44:09,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:44:09,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:44:09,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:44:09,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2024-11-09 07:44:09,470 INFO L87 Difference]: Start difference. First operand 1102 states and 1490 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:44:09,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:44:09,841 INFO L93 Difference]: Finished difference Result 1424 states and 1888 transitions. [2024-11-09 07:44:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:44:09,841 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2024-11-09 07:44:09,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:44:09,844 INFO L225 Difference]: With dead ends: 1424 [2024-11-09 07:44:09,845 INFO L226 Difference]: Without dead ends: 1424 [2024-11-09 07:44:09,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=886, Unknown=0, NotChecked=0, Total=992 [2024-11-09 07:44:09,845 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 359 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:44:09,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 938 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:44:09,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2024-11-09 07:44:09,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1200. [2024-11-09 07:44:09,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 1070 states have (on average 1.3953271028037384) internal successors, (1493), 1147 states have internal predecessors, (1493), 46 states have call successors, (46), 23 states have call predecessors, (46), 46 states have return successors, (92), 29 states have call predecessors, (92), 46 states have call successors, (92) [2024-11-09 07:44:09,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1631 transitions. [2024-11-09 07:44:09,862 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1631 transitions. Word has length 54 [2024-11-09 07:44:09,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:44:09,863 INFO L471 AbstractCegarLoop]: Abstraction has 1200 states and 1631 transitions. [2024-11-09 07:44:09,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:44:09,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1631 transitions. [2024-11-09 07:44:09,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 07:44:09,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:44:09,864 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:44:09,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 07:44:10,067 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,SelfDestructingSolverStorable47 [2024-11-09 07:44:10,070 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:44:10,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:44:10,071 INFO L85 PathProgramCache]: Analyzing trace with hash 189205427, now seen corresponding path program 1 times [2024-11-09 07:44:10,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:44:10,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919345684] [2024-11-09 07:44:10,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:10,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:44:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:10,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:44:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:10,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:10,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:44:10,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919345684] [2024-11-09 07:44:10,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919345684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:44:10,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:44:10,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:44:10,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299236856] [2024-11-09 07:44:10,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:44:10,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:44:10,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:44:10,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:44:10,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:44:10,314 INFO L87 Difference]: Start difference. First operand 1200 states and 1631 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:44:10,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:44:10,566 INFO L93 Difference]: Finished difference Result 1424 states and 1888 transitions. [2024-11-09 07:44:10,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:44:10,568 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2024-11-09 07:44:10,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:44:10,571 INFO L225 Difference]: With dead ends: 1424 [2024-11-09 07:44:10,571 INFO L226 Difference]: Without dead ends: 1424 [2024-11-09 07:44:10,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-11-09 07:44:10,571 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 416 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:44:10,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 865 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:44:10,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2024-11-09 07:44:10,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 996. [2024-11-09 07:44:10,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 890 states have (on average 1.3898876404494382) internal successors, (1237), 955 states have internal predecessors, (1237), 34 states have call successors, (34), 17 states have call predecessors, (34), 34 states have return successors, (68), 23 states have call predecessors, (68), 34 states have call successors, (68) [2024-11-09 07:44:10,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1339 transitions. [2024-11-09 07:44:10,586 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1339 transitions. Word has length 54 [2024-11-09 07:44:10,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:44:10,586 INFO L471 AbstractCegarLoop]: Abstraction has 996 states and 1339 transitions. [2024-11-09 07:44:10,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:44:10,586 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1339 transitions. [2024-11-09 07:44:10,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 07:44:10,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:44:10,587 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:44:10,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-09 07:44:10,587 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:44:10,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:44:10,588 INFO L85 PathProgramCache]: Analyzing trace with hash -620141199, now seen corresponding path program 1 times [2024-11-09 07:44:10,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:44:10,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679177475] [2024-11-09 07:44:10,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:10,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:44:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:10,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:44:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:10,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:10,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:44:10,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679177475] [2024-11-09 07:44:10,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679177475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:44:10,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:44:10,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:44:10,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717065864] [2024-11-09 07:44:10,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:44:10,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:44:10,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:44:10,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:44:10,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:44:10,954 INFO L87 Difference]: Start difference. First operand 996 states and 1339 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:44:11,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:44:11,419 INFO L93 Difference]: Finished difference Result 1213 states and 1576 transitions. [2024-11-09 07:44:11,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 07:44:11,419 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2024-11-09 07:44:11,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:44:11,421 INFO L225 Difference]: With dead ends: 1213 [2024-11-09 07:44:11,421 INFO L226 Difference]: Without dead ends: 1213 [2024-11-09 07:44:11,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-09 07:44:11,422 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 305 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1725 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:44:11,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1725 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:44:11,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2024-11-09 07:44:11,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 887. [2024-11-09 07:44:11,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 793 states have (on average 1.3871374527112232) internal successors, (1100), 852 states have internal predecessors, (1100), 28 states have call successors, (28), 14 states have call predecessors, (28), 28 states have return successors, (56), 20 states have call predecessors, (56), 28 states have call successors, (56) [2024-11-09 07:44:11,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1184 transitions. [2024-11-09 07:44:11,432 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1184 transitions. Word has length 54 [2024-11-09 07:44:11,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:44:11,432 INFO L471 AbstractCegarLoop]: Abstraction has 887 states and 1184 transitions. [2024-11-09 07:44:11,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:44:11,432 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1184 transitions. [2024-11-09 07:44:11,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 07:44:11,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:44:11,433 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:44:11,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-09 07:44:11,433 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:44:11,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:44:11,434 INFO L85 PathProgramCache]: Analyzing trace with hash 839700204, now seen corresponding path program 1 times [2024-11-09 07:44:11,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:44:11,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234892923] [2024-11-09 07:44:11,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:11,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:44:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:11,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:44:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:11,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 07:44:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:11,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:44:11,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:44:11,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234892923] [2024-11-09 07:44:11,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234892923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:44:11,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:44:11,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 07:44:11,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505566838] [2024-11-09 07:44:11,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:44:11,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:44:11,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:44:11,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:44:11,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:44:11,781 INFO L87 Difference]: Start difference. First operand 887 states and 1184 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 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-09 07:44:12,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:44:12,096 INFO L93 Difference]: Finished difference Result 1176 states and 1539 transitions. [2024-11-09 07:44:12,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:44:12,097 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 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) Word has length 56 [2024-11-09 07:44:12,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:44:12,103 INFO L225 Difference]: With dead ends: 1176 [2024-11-09 07:44:12,103 INFO L226 Difference]: Without dead ends: 1176 [2024-11-09 07:44:12,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2024-11-09 07:44:12,103 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 280 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:44:12,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 1362 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:44:12,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2024-11-09 07:44:12,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 972. [2024-11-09 07:44:12,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 866 states have (on average 1.3856812933025404) internal successors, (1200), 931 states have internal predecessors, (1200), 34 states have call successors, (34), 17 states have call predecessors, (34), 34 states have return successors, (68), 23 states have call predecessors, (68), 34 states have call successors, (68) [2024-11-09 07:44:12,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1302 transitions. [2024-11-09 07:44:12,117 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1302 transitions. Word has length 56 [2024-11-09 07:44:12,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:44:12,117 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1302 transitions. [2024-11-09 07:44:12,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 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-09 07:44:12,118 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1302 transitions. [2024-11-09 07:44:12,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 07:44:12,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:44:12,119 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2024-11-09 07:44:12,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-09 07:44:12,119 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-09 07:44:12,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:44:12,120 INFO L85 PathProgramCache]: Analyzing trace with hash -954367591, now seen corresponding path program 1 times [2024-11-09 07:44:12,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:44:12,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207908682] [2024-11-09 07:44:12,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:12,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:44:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:12,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 07:44:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:12,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 07:44:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:12,590 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:44:12,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:44:12,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207908682] [2024-11-09 07:44:12,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207908682] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:44:12,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424836947] [2024-11-09 07:44:12,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:12,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:44:12,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:44:12,594 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:44:12,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 07:44:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:12,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-09 07:44:12,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:44:12,892 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-09 07:44:12,930 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-09 07:44:12,994 INFO L349 Elim1Store]: treesize reduction 42, result has 25.0 percent of original size [2024-11-09 07:44:12,994 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 21 treesize of output 23 [2024-11-09 07:44:17,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:44:17,161 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-09 07:44:17,174 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:17,174 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:44:17,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424836947] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:44:17,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:44:17,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 22 [2024-11-09 07:44:17,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032783627] [2024-11-09 07:44:17,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:44:17,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 07:44:17,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:44:17,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 07:44:17,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=561, Unknown=1, NotChecked=0, Total=650 [2024-11-09 07:44:17,269 INFO L87 Difference]: Start difference. First operand 972 states and 1302 transitions. Second operand has 23 states, 22 states have (on average 4.545454545454546) internal successors, (100), 21 states have internal predecessors, (100), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:44:25,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:44:38,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:44:42,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:44:46,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:44:50,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:44:54,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:44:58,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:45:02,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:45:04,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]